<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE document PUBLIC "-//CNX//DTD CNXML 0.5 plus MathML//EN" "http://cnx.rice.edu/cnxml/0.5/DTD/cnxml_mathml.dtd">
<document xmlns="http://cnx.rice.edu/cnxml" xmlns:md="http://cnx.rice.edu/mdml/0.4" xmlns:m="http://www.w3.org/1998/Math/MathML" xmlns:bib="http://bibtexml.sf.net/" id="id10617757">
  <name>References for the LF Algorithm</name>
  <metadata>
  <md:version>1.4</md:version>
  <md:created>2007/09/03 22:13:10 GMT-5</md:created>
  <md:revised>2007/12/05 21:26:05.103 US/Central</md:revised>
  <md:authorlist>
      <md:author id="cburrus">
      <md:firstname>C.</md:firstname>
      <md:othername>Sidney</md:othername>
      <md:surname>Burrus</md:surname>
      <md:email>csb@rice.edu</md:email>
    </md:author>
  </md:authorlist>

  <md:maintainerlist>
    <md:maintainer id="cburrus">
      <md:firstname>C.</md:firstname>
      <md:othername>Sidney</md:othername>
      <md:surname>Burrus</md:surname>
      <md:email>csb@rice.edu</md:email>
    </md:maintainer>
  </md:maintainerlist>
  
  <md:keywordlist>
    <md:keyword>factor</md:keyword>
    <md:keyword>polynomial</md:keyword>
    <md:keyword>references on polynomial factoring</md:keyword>
    <md:keyword>root</md:keyword>
    <md:keyword>zero</md:keyword>
  </md:keywordlist>

  <md:abstract>References for the Lindsey-Fox polynomial factoring algorithm</md:abstract>
</metadata>
  <content>
    <section id="id-539930714561">
      <name>References </name>
      <para id="element-965">Below are several references on the <cnxn document="m15573"> Lindsey-Fox algorithm </cnxn> and on the zero distribution for polynomials with random coefficients.</para><list type="enumerated" id="id9349349"><item>J. P. Lindsey and James W. Fox. “A method of factoring long z-transform polynomials”, <cite>Computational Methods in Geosciences</cite>, SIAM, pp. 78-90, 1992. </item>
        <item>Osman Osman (editor), <cite>Seismic Source Signature Estimation and Measurement</cite>, Geophysics Reprint Series #18, Society of Exploration Geophysicists (SEG), 1996, pp. 712-724.</item>
        <item>Gary A. Sitton, C. Sidney Burrus, James W. Fox, and Sven Treitel. “Factoring very high degree polynomials”. <cite>IEEE Signal Processing Magazine</cite>, 20(6):27-42, November 2003. </item>
        <item>C. S. Burrus, J. W. Fox, G. A. Sitton, and S. Treitel, “Factoring High Degree Polynomials in Signal Processing”, <cite>Proceedings of the IEEE DSP Workshop</cite>, Taos, NM, Aug. 3, 2004, pp. 156-157.</item>
        <item>Zhonggang Zeng, "Computing Multiple Roots of Inexact Polynomials", ACM ISSAC, 2003. also: <cite>Math. Comp.</cite> 74 (2005), 869 - 903. </item>
        <item>Zhonggang Zeng, Northeastern Illinois University, March 10, 2006, MultRoot -- A Matlab package computing polynomial roots and multiplicities <link src="http://www.neiu.edu/~zzeng/multroot.htm">http://www.neiu.edu/~zzeng/multroot.htm, </link></item>
        <item>L. Arnold, “Uber die nullstellenverteilung zuf älliger polynome,” <cite>Mathematische Zeitschrift</cite>, vol. 92, pp. 12–18, 1966. </item>
        <item>L. Shepp and R. J. Vanderbei, “The Complex Zeros of Random Polynomials”, <cite>Trans. American Mathematical Society</cite>, 347:4365-­4383, 1995</item>
        <item>Ildar Ibragimov &amp; Ofer Zeitouni, “On Roots of Random Polynomials”, <cite>Transactions of the American Mathematical Society</cite>, vol 349, # 6, June 1997, pp 2427-2441.</item>
        <item>Bharucha-Reid and Sambandham, <cite>Random Polynomials,</cite> Adademic Press, 1986. </item>
        <item>J. H. Wilkinson.<cite> Rounding Errors in Algebraic Processes</cite>. Prentice-Hall, 1963. </item>
        <item>N. J. Higham, <cite>Accuracy and Stability of Numerical Algorithms,</cite> SIAM, 1996. Second edition 2002. Chapter 5 on polynomials. </item>
        <item>Lloyd N. Trefethen and David Bau, <cite>Numerical Linear Algebra,</cite> SIAM, 1997.</item>
        <item>C. S. Burrus, J. W. Fox, G. A. Sitton, and S. Treitel, “Factoring Very High Degree Polynomials”,<cite> Rice Web Site,</cite> March 10, 2006. <link src="http://www.dsp.ece.rice.edu/software/fvhdp.shtml">http://www-dsp.rice.edu/software/fvhdp.shtml</link></item>
      <item>J. B. Moore, "A Convergent Algorithm for Solving Polynomials Equations", <cite>Journal of the ACM</cite>, 14(2):311-315, April 1967.</item>
<item>J. B. Moore, "A Consistently Rapid Algorithm for Solving Polynomial Equations", <cite>Journal of the Institute of Mathematics and Its Applications</cite>, 17:990119, 1976.</item>
<item>M. A. Jenkins and S. F. Traub, "A Three-Stage Algirithm for Real Polynomials using Quadratic Iterations",<cite>SIAM Journal on Numerical Analysis</cite>, 545-566, 1970.</item></list><para id="element-302">More details on the third stage of the Lindsey-Fox program can be found <cnxn document="m15574"> here </cnxn></para>
    </section>
  </content>
</document>
