On isolation of real and nearly real zeros of a univariate polynomial and its splitting into factors

Journal of Complexity

Volumn 12, Issue 4, 1996, Pages 572-594

  Pan, Victor Y ^a,b   Kim, Myong Hi ^c   Sadikou, Akimou ^b   Huang, Xiaohan ^b   Zheng, Ailong ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c STONY BROOK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (30)

1. [AHU74] AHO, A. V., HOPCROFT, J. E., and ULLMAN J. D. (1974), "Design and Analysis of Computer Algorithms," Addison-Wesley, Reading, MA.
2. [ASU75] AHO, A. V., STEIGLITZ, K., and ULLMAN, J. D. (1975), Evaluating polynomials at fixed set of points, SIAM J. Comput. 4, 533-539.
3. [BP94] BINI, D., and PAN, V. Y. (1994), "Polynomial and Matrix Computations, Vol. 1: Fundamental Algorithms," Birkhäuser, Boston.
4. [BPa] BINI D., and PAN, V. Y. (to appear), "Polynomial and Matrix Computations, Vol. 2: Selected Topics," Birkhäuser, Boston.
5. [BPb] BINI, D., and PAN, V. Y. (1996), Graeffe's, Chebyshev-like, and Cardinal's processes for splitting a polynomial into factors, J. of Complexity 12, 492-511.
6. [DH69] DEJON, B., and HENRICI, P. Eds. (1969), "Constructive Aspects of the Fundamental Theorem of Algebra," Wiley, London.
7. [DL67] DELVES, L. M., and LYNESS, J. N., (1967), A numerical method for locating zeros of an analytic function, Math. Comput. 21, 543-560.
8. [G71] GRAU, A. A. (1971), The simultaneous improvement of a complete set of approximate factors of a polynomial, SIAM J. Numer. Anal. 8, 425-438.
9. [Ga75] GAUTSCHI, W. (1975), Norm estimates for the inverses of Vandermonde matrices, Numer. Math. 23, 337-347.
10. [Ga90] GAUTSCHI, W. (1990), How (un)stable are Vandermonde systems?, in "Intern. Symp. on Asymptotic and Computational Analysis: Conference in Honor Frank W. J. Olver's 65th Birthday (R. Wong, Ed.), Lecture Notes in Pure and Applied Math., Vol. 124, pp. 193-210, Decker, New York.
11. [Ge87] Gerasoulis, A. (1987), A fast algorithm for the multiplication of generalized Hilbert matrix by vector, Math. Comput. 50(181), 179-188.
12. [GL89] GOLUB, G. H., and VAN LOAN, C. F. (1989), Matrix Computations, Johns Hopkins Univ. Press, Baltimore.
13. [He74] HENRICI, P. (1974), Applied and Computational Complex Analysis, Vol. 1, Wiley, New York.
14. [Ho71] Householder, A. S. (1971), Generalization of an algorithm of Sebastiao e Silva, Numer. Math. 16, 375-382.
15. [Ki94] KIRRINNIS, P. (1994), Polynomial factorization and partial fraction decomposition by simultaneous Newton's iteration, extended abstract.
16. 1+ε) algorithm for the complex root problem, in "Proc. 35th Ann. IEEE Symp. on Foundation of Computer Science," pp. 540-547.
17. [O40] 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.
18. [P87] Pan, V. Y. (1987), Sequential and parallel complexity of approximate evaluation of polynomial zeros, Comput. Math. Appl. 14(8), 591-622.
19. [P89] PAN, V. Y. (1989), Fast evaluation and interpolation at the Chebyshev set of points, Appl. Math. Lett. 2(3), 255-258.
20. [P94] PAN, V. Y. (1994), New techniques for approximating complex polynomial zeros, in "Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms," pp. 260-270, ACM Press, New York, and SIAM, Philadelphia.
21. [P95] PAN, V. Y. (1995), Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros, in "Proc. 27th Ann. ACM Symp. on Theory of Computing," pp. 741-750, ACM Press, New York.
22. [P95a] PAN, V. Y. (1995), Deterministic improvement of complex polynomial factorization based on the properties of associated resultant, Comput. Math. Appl. 30(2), 237-250.
23. [P96] PAN, V. Y. (1996), On approximating complex polynomial zeros: Modified quadtree (Weyl's) construction and improved Newton's iteration, Technical Report 2894, INRIA, Sophia-Antipolis, France, May.
24. [P96a] PAN, V. Y. (1996), Optimal and nearly optimal algorithms for approximating polynomial zeros, Comput. Math. Appl. 31(12), 97-138.
25. [P,a] PAN, V. Y. (to appear), Solving a polynomial equation: Some history and recent progress, SIAM Rev. 39, 1.
26. [Sc82] SCHÖNHAGE, A. (1982), The fundamental theorem of algebra in terms of computational complexity, manuscript, Math. Dept., University of Tübingen, Tübingen, Germany.
27. [Sc85] SCHÖNHAGE, A. (1985), Quasi-GCD computations, J. Complexity 1, 118-137.
28. [Schr57] SCHRÖDER, J. (1957), Uber das Newtonsche Verfahren, Arch. Rational Mech. Anal. 1, 154-180.
29. [SeS41] SEBASTIAO E SILVA, J. (1941), Sur une Méthode d' Approximation Semblable à Celle de Graeffe, Portugal Math. 2, 271-279.
30. [VdS70] VAN DER SLUIS, A. (1970), Upper bounds for roots of polynomials, Numer. Math. 15, 250-262.