On the Complexity of Reliable Root Approximation

DOI10.1007/978-3-642-04103-7_15zbMath1260.65045OpenAlexW1507596250MaRDI QIDQ3644097

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

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

Related Items (3)

Nearly optimal refinement of real roots of a univariate polynomial ⋮ Root refinement for real polynomials using quadratic interval refinement ⋮ An efficient method to compute the rate matrix for retrial queues with large number of servers

Uses Software

• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of real root isolation using continued fractions
• Fast multiplication of large numbers
• Almost tight recursion tree bounds for the Descartes method
• Algorithms in real algebraic geometry

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