Root-refining for a polynomial equation

DOI10.1007/978-3-642-32973-9_24MaRDI QIDQ2915006zbMATH OpenOpenAlexFDO

Authors Victor Y. Pan

Publication date 21 September 2012

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32973-9_24

zbMATH Keywords

efficiencypolynomial factorizationroot-refining

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Recommendations

• Efficient polynomial root-refiners: a survey and new record efficiency estimates
• Accelerated approximation of the complex roots of a univariate polynomial
• Newton's method in practice. II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees
• Nearly optimal refinement of real roots of a univariate polynomial
• Simple and nearly optimal polynomial root-finding by means of root radii approximation

Cited in

(5)

• Polynomial roots: The ultimate answer?
• How to refine polynomial functions
• Efficient polynomial root-refiners: a survey and new record efficiency estimates
• Root refinement for real polynomials using quadratic interval refinement
• scientific article; zbMATH DE number 2217817 (Why is no real title available?)

This page was built for publication: Root-refining for a polynomial equation

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