论文信息 - Quadratic interval refinement for real roots

Quadratic interval refinement for real roots

We present a new algorithm for refining a real interval containing a single real root: the new method combines the robustness of the classical Bisection algorithm with the speed of the Newton-Raphson method; that is, our method exhibits quadratic convergence when refining isolating intervals of simple roots of polynomials (and other well-behaved functions). We assume the use of arbitrary precision rational arithmetic. Unlike Newton-Raphson our method does not need to evaluate the derivative.

John Abbott | J. Abbott

[1] Ye Liang,et al. Real root refinements for univariate polynomial equations , 2012, ArXiv.

[2] Kurt Mehlhorn,et al. Computing Real Roots of Real Polynomials - An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration , 2013, ArXiv.

[3] Michael Sagraloff,et al. When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial , 2011, ISSAC.

[4] Michael Sagraloff,et al. Root Refinement for Real Polynomials , 2011, ArXiv.

[5] George E. Collins,et al. A hybrid method for high precision calculation of polynomial real roots , 1993, ISSAC '93.

[6] R. Baker Kearfott,et al. Introduction to Interval Analysis , 2009 .

[7] Michael Sagraloff,et al. Efficient real root approximation , 2011, ISSAC '11.

[8] P. Zimmermann,et al. Efficient isolation of polynomial's real roots , 2004 .