Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
From MaRDI portal
Publication:2191569
DOI10.1007/s00009-020-01545-zzbMath1442.65092OpenAlexW3035909623MaRDI QIDQ2191569
Milena D. Petkova, Petko D. Proinov
Publication date: 25 June 2020
Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00009-020-01545-z
error estimatesiterative methodssemilocal convergencelocal convergencepolynomial zerossimultaneous methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Unified majorizing sequences for Traub-type multipoint iterative procedures
- Convergence of the two-point Weierstrass root-finding method
- On a family of Weierstrass-type root-finding methods with accelerated convergence
- Numerical computation of polynomial zeros by means of Aberth's method
- Two-point iterative methods for solving nonlinear equations
- 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
- On the convergence of multipoint iterations
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- On some methods for the simultaneous determination of polynomial zeros
- Numerical methods for roots of polynomials. II
- 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
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- The fundamental theorem of algebra and complexity theory
- Solving a Polynomial Equation: Some History and Recent Progress
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- On Some Multipoint Methods Arrising from Optimal in the Sense of Kung-Traub Algorithms for Numerical Solution of Nonlinear Equations
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
This page was built for publication: Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods