On the Complexity of Reliable Root Approximation

DOI10.1007/978-3-642-04103-7_15MaRDI QIDQ3644097zbMATH OpenOpenAlexFDO

Authors Michael Kerber

Publication date 10 November 2009

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

Full work available at URL http://edoc.mpg.de/518273

Mathematics Subject Classification ID

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

Recommendations

• Efficient real root approximation
• Root refinement for real polynomials using quadratic interval refinement
• From approximate factorization to root isolation
• scientific article; zbMATH DE number 1253988
• Nearly optimal refinement of real roots of a univariate polynomial

Cites work

• Algorithms in real algebraic geometry
• Almost tight recursion tree bounds for the Descartes method
• Amortized bound for root isolation via Sturm sequences
• Complexity of real root isolation using continued fractions
• Fast and exact geometric analysis of real algebraic plane curves
• Fast multiplication of large numbers
• scientific article; zbMATH DE number 5764874 (Why is no real title available?)
• scientific article; zbMATH DE number 1157659 (Why is no real title available?)
• scientific article; zbMATH DE number 1446863 (Why is no real title available?)
• scientific article; zbMATH DE number 3316497 (Why is no real title available?)
• scientific article; zbMATH DE number 3388498 (Why is no real title available?)
• On the complexity of real solving bivariate systems

Cited in

(8)

• Root-neededness and approximations of neededness
• scientific article; zbMATH DE number 3880014 (Why is no real title available?)
• scientific article; zbMATH DE number 4199482 (Why is no real title available?)
• Root refinement for real polynomials using quadratic interval refinement
• Efficient real root approximation
• On the complexity of computing the logarithm and square root functions on a complex domain
• Nearly optimal refinement of real roots of a univariate polynomial
• An efficient method to compute the rate matrix for retrial queues with large number of servers

Describes a project that uses

Uses Software

• BRENT

This page was built for publication: On the Complexity of Reliable Root Approximation

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