Univariate polynomials, nearly optimal algorithms for factorization and rootfinding

DOI10.1145/384101.384136MaRDI QIDQ2958942zbMATH OpenOpenAlexFDO

Authors Victor Y. Pan

Publication date 3 February 2017

Published in Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/384101.384136

zbMATH Keywords

computational complexitygeometry of polynomial zerosGraeffe's liftingnumerical polynomial factorizationPadé approximationrootfindingunivariate polynomials

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• scientific article; zbMATH DE number 1793930
• scientific article; zbMATH DE number 1859220
• An efficient algorithm for the complex roots problem
• Accelerated approximation of the complex roots and factors of a univariate polynomial

Cited in

(27)

• Algorithms for adaptive factorization of polynomials
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
• An adaptive subdivision method for root finding of univariate polynomials
• Faster numerical univariate polynomial root-finding by means of subdivision iterations
• Old and new nearly optimal polynomial root-finders
• Real polynomial root-finding by means of matrix and polynomial iterations
• Accelerated approximation of the complex roots and factors of a univariate polynomial
• Distance bounds of \(\varepsilon\)-points on hypersurfaces
• Parametrization of approximate algebraic surfaces by lines
• scientific article; zbMATH DE number 5356112 (Why is no real title available?)
• Efficient polynomial root-refiners: a survey and new record efficiency estimates
• Polynomial Root-Finding Algorithms and Branched Covers
• New Resultant Inequalities and Complex Polynomial Factorization
• scientific article; zbMATH DE number 1793930 (Why is no real title available?)
• Simple and nearly optimal polynomial root-finding by means of root radii approximation
• scientific article; zbMATH DE number 1859220 (Why is no real title available?)
• Discovering the roots: uniform closure results for algebraic classes under factoring
• Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
• Parametrization of approximate algebraic curves by lines
• Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues
• Rigid continuation paths II. structured polynomial systems
• Approximate parametrization of plane algebraic curves by linear systems of curves
• Root-Squaring for Root-Finding
• Root-finding by expansion with independent constraints
• A new fast root-finder for black box polynomials
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Nearly optimal refinement of real roots of a univariate polynomial

This page was built for publication: Univariate polynomials, nearly optimal algorithms for factorization and rootfinding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958942)