Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros

DOI10.1016/J.AMC.2014.03.092zbMath1334.65082OpenAlexW2040610859MaRDI QIDQ273377

Petko D. Proinov, Slav I. Cholakov

Publication date: 21 April 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2014.03.092

zbMATH Keywords

error estimatessemilocal convergencelocation of zerospolynomial zerossimultaneous methodsChebyshev-like method

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Related Items (18)

ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS ⋮ A note on determinantal representation of a Schröder-König-like simultaneous method for finding 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 ⋮ A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously ⋮ ON EFFICIENT FRACTIONAL CAPUTO-TYPE SIMULTANEOUS SCHEME FOR FINDING ALL ROOTS OF POLYNOMIAL EQUATIONS WITH BIOMEDICAL ENGINEERING APPLICATIONS ⋮ Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation 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 ⋮ On a family of Weierstrass-type root-finding methods with accelerated convergence ⋮ Unified convergence analysis for Picard iteration in \(n\)-dimensional vector spaces ⋮ Iterative approximation of fixed points of quasi-contraction mappings in cone metric spaces ⋮ On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros ⋮ On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros ⋮ General convergence theorems for iterative processes and applications to the Weierstrass root-finding method ⋮ On dynamics of iterative techniques for nonlinear equation with applications in engineering ⋮ On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously ⋮ A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the new fourth-order methods for the simultaneous approximation of polynomial zeros
• Numerical methods for roots of polynomials. Part I
• Point estimation of root finding methods
• General local convergence theory for a class of iterative processes and its applications to Newton's method
• A unified theory of cone metric spaces and its applications to the fixed point theory
• A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
• New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
• Semilocal convergence of two iterative methods for simultaneous computation of polynomial zeros
• A new semilocal convergence theorem for the Weierstrass method from data at one point
• On a modification of Chebyshev's method

This page was built for publication: Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros