On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots

G. Alefeld, Jürgen Herzberger

SIAM Journal on Numerical Analysis · 1974 · 93 citations · 4 references

Concepts

Abstract

This note gives an analysis of the order of convergence of some modified Newton methods. The modifications we are concerned with are well-known methods—a total-step method and a single-step methods—for refining all roots of an nth-degree polynomial simultaneously. It is shown that for the single-step method the R-order of convergence, used by Ortega and Rheinboldt in [6], is at least $2 + \sigma _n > 3$, where $\sigma _n > 1$ is the unique positive root of the polynomial $p_n (\sigma ) = \sigma ^n - \sigma - 2$.

References

4