Factoring Very-High-Degree Polynomials

IEEE Signal Processing Magazine

Volumn 20, Issue 6, 2003, Pages 27-42

  Sitton, Gary A ^b   Burrus, C Sidney ^a,b   Fox, James W ^b   Treitel, Sven ^b,c  

^a RICE UNIVERSITY   (United States)

^b Department of Electrical Engineering ^*

^c BP EXPLORATION   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVOLUTION; DIGITAL ARITHMETIC; FAST FOURIER TRANSFORMS; NUMBER THEORY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; RANDOM PROCESSES;

COMPLEX NUMBERS; FACTORIZATION; ROOT APPROXIMATION METHOD; ROOT REFINEMENT METHOD;

DIGITAL SIGNAL PROCESSING;

EID: 85032752420     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2003.1253552     Document Type: Article

References (49)

1. J.P. Lindsey and J.W. Fox, "A method of factoring long z-transform polynomials," Comput Methods Geoscicnces, SIAM, pp. 78-90, 1992. Reprinted in Seismic Source Signature Estimation und Measurement, O. Osman and E. Robinson, Ed. (Geophysics Reprint Series no. 18), SEG, 1996, pp. 712-724.
2. J.P. Lindsey and J.W. Fox, "A method of factoring long z-transform polynomials," Comput Methods Geoscicnces, SIAM, pp. 78-90, 1992. Reprinted in Seismic Source Signature Estimation und Measurement, O. Osman and E. Robinson, Ed. (Geophysics Reprint Series no. 18), SEG, 1996, pp. 712-724.
3. V.Y. Pan "Solving a polynomial equation: Some history and recent progress," SIAM Rev., vol. 39, no. 2, pp. 187-220, June 1997.
4. V.Y. Pan, "Solving polynomials with computers," Amer. Sci., vol. 86, no. 1, pp. 62-69, Jan.-Feb. 1998.
5. J.F. Traub, "Another algorithm," Amer. Sci., vol. 86, no. 2, pp. 108-109, Mar.-Apr, 1998.
6. A.V. Oppenheim and R.W. Schafer, Discrete-Time Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1989.
7. C.S. Burrus and T.W. Parks, DFT/FFT and Convolution Algorithms. New York: Wiley, 1985.
8. J.W. Fox, "Improving the accuracy of polynomial evaluation, deflation, and root finding," draft manuscript, Jan. 14 2002.
9. W.H. Press, B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling, Numerical Recipes in Fortran: The Art of Scientific Computing, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 1992.
10. C.S. Burrus. "An algorithm for factoring a polynomial of a complex variable," unpublished notes, ECE Dept., Rice Univ., Nov. 2000.
11. J.W. Fox, "Using the FFT to factor polynomials," unpublished, Jan. 2001.
12. N.J. Higham. Accuracy and Stability of Numerical Algorithms. Philadelphia, PA: SIAM, 1996.
13. M. Snub, "Mysteries of mathematics and computation," Math. Intell., vol. 16, no. 1, pp. 10-15, Winter 1994.
14. B.B. Mandelbrot, The Fractal Geometry of Nature. San Francisco, CA: Freeman, 1983.
15. L. Arnold, "Über die nullstellenverteilung zufälliger polynome," Mathematische Zeitschrift, no. 92, pp. 12-18, 1966.
16. H.J. Orchard, "The Laguerre method for finding the zeros of polynomials," IEEE Trans. Circuits Syst, vol. 36, no. 11, pp. 1377-1381, Nov. 1989.
17. J.W. Fox, "Newton, Laguerre, and Zeno," unpublished, Mar. 2, 2002.
18. F.S. Acton. Numerical Methods That Work. Washington, DC: Mathematical Assoc. of America, 1990.
19. J.W. Fox, G.A. Sitton, J.P. Lindsey, C.S. Burrus, and S. Treitel, "Factoring ultra-high degree polynomials," unpublished, 2003.
20. K. Steiglitz and B. Dickinson, "Phase unwrapping by factorization," IEEE Trans. Acoust., Speech, Signal Processing, vol. 30, no. 6, pp. 984-991, Dec. 1982.
21. J.H. Wilkinson, Rounding Errors in Algebraic Processes. Englewood Cliffs, NJ: Prentice-Hall, 1963.
22. J.B. Moore, "A convergent algorithm for solving polynomial equations," J. ACM, vol. 14, no. 2, pp. 311-315, Apr. 1967.
23. J.B. Moore, "A consistently rapid algorithm for solving polynomial equations," J. IMA, vol. 17, pp. 99-110, 1976.
24. K. Madsen, "A root-finding algorithm based on Newton's method, " BIT, vol. 13, pp. 71-75, 1973.
25. L.V. Ahlfors, Complex Analysis, 2nd ed. New York: McGraw-Hill, 1966.
26. H.V. Sorensen, D.L. Jones, M.T. Heideman, and C.S. Burrus, "Real-valued fast Fourier transform algorithms," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, no. 6, pp. 849-863, June 1987.
27. C.E. Schmidt and L.R. Rabiner, "A study of techniques for finding the zeros of linear phase FIR digital filters," IEEE Trans. Acoust., Speech, Signal Processing, vol. 25, no. 1, pp. 96-98, Feb. 1977.
28. L. Hoteit, "FFT-based fast polynomial rooting," IEE Electron. Lett., vol. 35, no. 12, p. 965, 1999.
29. E. Kostlan, "On the distribution of roots of random polynomials," From Topology to Computation, M.W. Hirsch, J.E. Marsden, and M. Shub, Eds. New York: Springer-Verlag, 1993, pp. 419-432.
30. L. Shepp and R.J. Vanderbei, "The complex zeros of random polynomials," Trans. AMS, vol. 347, pp. 4365-4383, 1995.
31. G.H. Golub and C.F. Van Loan, Matrix Computations, 3rd ed. Baltimore, MD: John Hopkins Univ. Press, 1996.
32. M. Lang and B.-C. Frenzel, "Polynomial root finding," IEEE Signal Processing Lett., vol. 1, no. 10, pp. 141-143, Oct. 1994.
33. M.A. Jenkins and S.F. Traub, "A three-stage algorithm for real polynomials using quadratic iteration," SIAM J. Numerical Anal., pp. 545-566, 1970.
34. A.M. Cohen, "Is the polynomial so perfidious?" Numerische Mathematik, vol. 68, no. 2, pp. 225-238, 1994.
35. M. Lang, "A fast and efficient program for finding all polynomial roots," in Proc. Int. Symp. Circuits and Systems, ISCAS-94, London, 1994.
36. M. Lang, "A new and efficient program for finding all polynomial roots," Elec. Comput. Eng. Dept. Rice Univ., Tech, Rep. 9308, Apr. 15, 1994.
37. K. Toh and L.N. Trefethen, "Pseudozeros of polynomials and pseudospectra of companion matrices," Mathematik, vol. 68, pp. 403-425, 1994.
38. S. Goedecker, "Remark on algorithms to find roots of polynomials," SIAM J. Sci. Comput, vol. 15, pp. 1059-1063, 1994.
39. Steve Fortune, "Polynomial root finding using iterated eigenvalue computation," Center for Discrete Mathematics & Theoretical Computer Science, NSF Science & Technology Center, Rutgers Univ., Tech. Rep., Sept. 19, 2000.
40. J.M. McNamee, "A bibliography on roots of polynomials," J. Comput. Appl. Math., vol. 47, pp. 391-392, 1993.
41. O. Fanton, B. Gleyse, and L. Léger, "Weyl's complex polynomial root finding method: A parallel implementation," in Proc. 5th Eur. SGI/Cray MPP Workshop, Bologna, Sept. 9-10 1999.
42. T.Y. Li, "On the rates of convergence of the Newton-Raphson method: A computer experiment," Dept. Physics, SUNY, Pittsburgh, NY, Tech. Rep., July 1986.
43. K. Steiglitz and B. Dickinson, "Computation of the complex cepstrum by factorization of the z-transform," in Proc. ICASSP-77, 1977, pp. 1333-1335.
44. L. Reichel, "Newton interpolation at Leja points," BIT, vol. 30, pp. 332-346, 1990.
45. J.P. Lindsey, "Measuring wavelet phase from seismic data," Leading Edge, vol. 7, pp. 10-16, 1988.
46. J.M. Tribolet, "A new phase unwrapping algorithm," IEEE Trans. Acoust., Speech, Signal Processing, vol. 26, pp. 170-177, 1977.
47. J.P. Lindsey, "A note on phase unwrapping," Soc. Explor. Geophys., pp. 301-307, 1996.
48. J.W. Fox, "Polynomial factorization and phase unwrapping," Soc. Explor. Geophys., pp. 725-732, 1996. Reprinted in Seismic Source Signature Estimation and Measurement, edited by O. Osman and E. Robinson, Ed. (Geophysics Reprint Series no. 18), SEG, pp. 725-732, 1996.
49. J.W. Fox, "Polynomial factorization and phase unwrapping," Soc. Explor. Geophys., pp. 725-732, 1996. Reprinted in Seismic Source Signature Estimation and Measurement, edited by O. Osman and E. Robinson, Ed. (Geophysics Reprint Series no. 18), SEG, pp. 725-732, 1996.