Skip to content Skip to navigation

Connexions

You are here: Home » Content » References for the LF Algorithm

Navigation

Content Actions
  • Download module PDF
  • Add to ...
    Add the module to:
    • My Favorites
    • A lens
    • An external social bookmarking service
    • My Favorites (What is 'My Favorites'?)
      'My Favorites' is a special kind of lens which you can use to bookmark modules and collections directly in Connexions. 'My Favorites' can only be seen by you, and collections saved in 'My Favorites' can remember the last module you were on. You need a Connexions account to use 'My Favorites'.
    • A lens (What is a lens?)

      Definition of a lens

      Lenses

      A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

      What is in a lens?

      Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

      Who can create a lens?

      Any individual Connexions member, a community, or a respected organization.

    • External bookmarks
  • E-mail the author

Recently Viewed

References for the LF Algorithm

Module by: C. Sidney Burrus

Summary: References for the Lindsey-Fox polynomial factoring algorithm

References

Below are several references on the Lindsey-Fox algorithm and on the zero distribution for polynomials with random coefficients.

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

More details on the third stage of the Lindsey-Fox program can be found here

Comments, questions, feedback, criticisms?

Send feedback