On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously

DOI10.1186/S13660-015-0855-5MaRDI QIDQ262691zbMATH OpenOpenAlexWikidataFDO

Authors Petko D. Proinov, Maria T. Vasileva

Publication date 30 March 2016

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1508.03359

zbMATH Keywords

accelerated convergenceEhrlich methoderror estimateslocal convergencepolynomial zerossemilocal convergencesimultaneous methods

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Abstract: We study a family of high order Ehrlich-type methods for approximating all zeros of a polynomial simultaneously. Let us denote by $T^{(1)}$ the famous Ehrlich method (1967). Starting from $T^{(1)}$, Kjurkchiev and Andreev (1987) have introduced recursively a sequence $(T^{(N)}{)}_{N=1}^{i}nfty$ of iterative methods for simultaneous finding polynomial zeros. For given $Nge1$, the Ehrlich-type method $T^{(N)}$ has the order of convergence $2N+1$. In this paper, we establish two new local convergence theorems as well as a semilocal convergence theorem (under computationally verifiable initial conditions and with a posteriori error estimate) for the Ehrlich-type methods $T^{(N)}$. Our first local convergence theorem generalizes a result of Proinov (2015) and improves the result of Kjurkchiev and Andreev (1987). The second local convergence theorem generalizes another recent result of Proinov (2015), but only in the case of maximum-norm. Our semilocal convergence theorem is the first result in this direction.

Recommendations

• On the local convergence of Ehrlich method for numerical computation of polynomial zeros
• scientific article; zbMATH DE number 4016047
• A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
• Semilocal convergence of two iterative methods for simultaneous computation of polynomial zeros
• On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros

Cites work

• A high order iteration formula for the simultaneous inclusion of polynomial zeros
• A modified Newton method for polynomials
• A posteriori error bound methods for the inclusion of polynomial zeros
• A unified theory of cone metric spaces and its applications to the fixed point theory
• Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
• Convergence conditions of some methods for the simultaneous computation of polynomial zero
• General local convergence theory for a class of iterative processes and its applications to Newton's method
• scientific article; zbMATH DE number 4016047 (Why is no real title available?)
• scientific article; zbMATH DE number 996039 (Why is no real title available?)
• scientific article; zbMATH DE number 3839233 (Why is no real title available?)
• scientific article; zbMATH DE number 3872574 (Why is no real title available?)
• scientific article; zbMATH DE number 1024452 (Why is no real title available?)
• scientific article; zbMATH DE number 1179336 (Why is no real title available?)
• scientific article; zbMATH DE number 3795285 (Why is no real title available?)
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
• Numerical methods for roots of polynomials. Part I
• On the convergence of a family of Weierstrass-type root-finding methods
• On the local convergence of Ehrlich method for numerical computation of polynomial zeros
• Point estimation of root finding methods
• Relationships between different types of initial conditions for simultaneous root finding methods
• Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
• Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros

Cited in

(22)

• The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros
• On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
• A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
• Unified convergence analysis for Picard iteration in n-dimensional vector spaces
• On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
• On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation
• Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation
• Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
• On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros
• A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
• A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
• Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
• scientific article; zbMATH DE number 4016047 (Why is no real title available?)
• On the local convergence of Ehrlich method for numerical computation of polynomial zeros
• Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros
• On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
• On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros
• A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence
• An iterative scheme to obtain multiple solutions simultaneously
• On a family of Weierstrass-type root-finding methods with accelerated convergence
• On dynamics of iterative techniques for nonlinear equation with applications in engineering
• Relationships between different types of initial conditions for simultaneous root finding methods

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously

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