Graeffe's, Chebyshev-like, and cardinal's processes for splitting a polynomial into factors

Journal of Complexity

Volumn 12, Issue 4, 1996, Pages 492-511

  Bini, Dario ^a   Pan, Victor Y ^b,c  

^a UNIVERSITY OF PISA   (Italy)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030512509     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1996.0030     Document Type: Article

References (14)

1. 1. AHO, A. V., STEIGLITZ, K., ULLMAN, J. D. (1975), Evaluating polynomials at fixed set of points, SIAM J. Comput. 4, 533-539.
2. 2. CARDINAL, J. P. On two iterative methods for approximating the roots of a polynomial, in "Proceedings of Workshop: Mathematics of Numerical Analysis: Real Number Algorithms," Park City, Utah, 1995 (J. Renegar, M. Shub, and S. Smale, Eds.), Lect. in Appl. Math., Amer. Math. Soc., Providence, RI.
3. 3. HOUSEHOLDER, A. S. "The Numerical Treatment of a Single Nonlinear Equation," McGraw-Hill, New York.
4. 4. HOWLAND, J. L. (1978), The resultant iteration for determining the stability of a polynomial, Math. Comp. 143, 779-789.
5. 5. KIRRINNIS, P. Polynomial factorization and partial fraction decomposition by simultaneous Newton's iteration, extended abstract, 1994.
6. 6. OSTROWSKI, A. M. (1940), Recherches sur la Méthode de Graeffe et les Zéros des Polynomes et des Series de Laurent, Acta Math. 72, 99-257.
7. 7. PAN, V. Y. (1987), Sequential and parallel complexity of approximate evaluation of polynomial zeros, Comput. Math. Appl. 14(8), 591-622.
8. 8. PAN, V. Y. (1989), Fast evaluation and interpolation at the set of Chebyshev points, Appl. Math. Lett. 2(3), 255-258.
9. 9. PAN, V. Y. (1995), Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros, in "Proceedings, 27th Annual ACM Symp. on Theory of Computing," pp. 260-270, ACM Press, New York.
10. 10. PAN, V. Y. (1995), Deterministic improvement of complex polynomial factorization based on the properties of associated resultant, Comput. Math. Appl 30(2), 237-250.
11. 11. PAN, V. Y. (1996), Optimal and nearly optimal algorithms for approximating complex polynomial zeros, Comput. Math. Appl 31(12), 97-138.
12. 12. PAN, V. Y. (1996), "On Approximating Complex Polynomial Zeros: Modified Quadtree (Weyl's) Construction and Improved Newton's Iteration," Research Report 2894, INRIA, Sophia-Antipolis, France.
13. 13. ROBERTS, J. (1980), Linear model reduction and solution of the algebraic Riccati equation, Internat. J. Control 32, 677-687.
14. 14. SCHOENHAGE, A. (1982), The fundamental theorem of algebra in terms of computational complexity, manuscript.