On a family of Weierstrass-type root-finding methods with accelerated convergence

DOI10.1016/j.amc.2015.10.048zbMath1410.65142arXiv1508.04767OpenAlexW2205265587MaRDI QIDQ668566

Maria T. Vasileva, Petko D. Proinov

Publication date: 19 March 2019

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

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

zbMATH Keywords

error estimatessemilocal convergencelocal convergenceaccelerated convergenceWeierstrass methodsimultaneous methods

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Numerical computation of roots of polynomial equations (65H04)

Related Items (12)

ON INVERSE ITERATION PROCESS FOR FINDING ALL ROOTS OF NONLINEAR EQUATIONS WITH APPLICATIONS ⋮ Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros ⋮ On highly efficient derivative-free family of numerical methods for solving polynomial equation simultaneously ⋮ Iterative schemes for finding all roots simultaneously of nonlinear equations ⋮ A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously ⋮ Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods ⋮ 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 ⋮ Simultaneous roots for vectorial problems ⋮ Inverse numerical iterative technique for finding all roots of nonlinear equations with engineering applications ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
• Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
• Numerical methods for roots of polynomials. Part I
• Relationships between different types of initial conditions for simultaneous root finding methods
• Point estimation of root finding methods
• The globalization of Durand-Kerner algorithm
• On some simultaneous methods based on Weierstrass' correction
• A unified theory of cone metric spaces and its applications to the fixed point theory
• An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
• On a Method of Weierstraß for the Simultaneous Calculation of the Roots of a Polynomial
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• The simultaneous approximation of polynomial roots
• General convergence theorems for iterative processes and applications to the Weierstrass root-finding method

This page was built for publication: On a family of Weierstrass-type root-finding methods with accelerated convergence