Lower bounds for the R-order of convergence of simultaneous inclusion methods for polynomial roots and related iteration methods

DOI10.1016/0377-0427(94)00080-KMaRDI QIDQ1900748zbMATH OpenOpenAlexFDO

Authors L. Y. Atanassova, Jürgen Herzberger

Publication date 23 October 1995

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-0427(94)00080-k

\(R\)-order of convergence inclusion methods iteration methods polynomial roots

Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Review text

There exists a huge number of iterative algorithms for approximating the roots of a given polynomial. The authors are discussing very general families of simultaneous inclusion methods, that is to say algorithms determining the roots of a given polynomial with respect to a given set. In order to compare these methods one can look at the so-called \(R\)- order, which describes the local speed of convergence and thereby provides an efficiency measure. The main result is an explicit lower bound for the \(R\)-order depending on the parameters of the given method.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Lower bounds for the \(R\)-order of convergence of simultaneous inclusion methods for polynomial roots and related iteration methods

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