Univariate polynomials: Nearly optimal algorithms for factorization and rootfinding

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2001, Pages 253-267

  Pan, V Y ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Computational complexity; Geometry of polynomial zeros; Graeffe's lifting; Numerical polynomial factorization; Pad approximation; Rootfinding; Univariate polynomials

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN ALGEBRA; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; GEOMETRY; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; POLES AND ZEROS;

GRAEFFE LIFTING; PADE APPROXIMATION; POLYNOMIAL FACTORIZATION; POLYNOMIAL ZEROS; ROOTFINDING; UNIVARIATE POLYNOMIALS;

POLYNOMIALS;

EID: 0034772190     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (42)

1. Fast solution of Toeplitz systems of equations and computation of Padé approximations
2. Stability of methods for solving toeplitz systems of equations
3. Roots of a Polynomial and its derivatives
4. A numerical method for locating zeros of an analytic functions
5. A numerical univariate polynomial GCD
6. Certified approximate polynomial gcds
7. The simultaneous improvement of a complete set of approximate factors of a polynomial
8. The Padé table and its relation to certain algorithms of numerical analysis
9. Fast computation of numerical partial fraction decompositions and contour integrals of rational functions
10. Polynomial factorization and partial fraction decomposition by simultaneous Newton's iteration
11. Elimination methods: An introduction
12. Bibliography on roots of polynomials
13. A supplementary bibliography on roots of polynomials
14. An inequality about factors of polynomials
15. Asymptotic acceleration of solving polynomial systems
16. Multivariate polynomials, duality and structured matrices
17. Specified precision polynomial root isolation is NC
18. l+ε) algorithm for the complex root problem
19. An efficient algorithm for the complex roots problem
20. Sequential and parallel complexity of approximate evaluation of polynomial zeros
21. Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros
22. Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
23. Optimal and nearly optimal algorithms for approximating polynomial zeros
24. Solving a polynomial equation: Some history and recent progress
25. Approximate polynomial gcds, Padé approximation, polynomial zeros, and bipartite graphs
26. Approximating complex polynomial zeros: Modified quadtree (Weyl's) construction and improved Newton's iteration
27. Perturbation of Padé approximation
28. Computation of approximate polynomial GCD's and an extension
29. The complexity of the matrix eigenproblem
30. On the worst-case arithmetic complexity of approximating zeros of polynomials
31. Asymptotically fast algorithms for the numerical multiplication and division of polynomials with complex coefficients
32. Quasi-gcd computations
33. The fundamental theorem of algebra and complexity theory
34. On the efficiency of algorithms of analysis