On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
From MaRDI portal
Publication:262691
DOI10.1186/s13660-015-0855-5zbMath1332.65065arXiv1508.03359OpenAlexW2163015871WikidataQ59428131 ScholiaQ59428131MaRDI QIDQ262691
Maria T. Vasileva, Petko D. Proinov
Publication date: 30 March 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.03359
error estimatessemilocal convergencelocal convergencepolynomial zerosaccelerated convergenceEhrlich methodsimultaneous methods
Related Items
Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple 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, A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence, 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, Relationships between different types of initial conditions for simultaneous root finding methods, On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity, An iterative scheme to obtain multiple solutions simultaneously, 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, 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, On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros, On dynamics of iterative techniques for nonlinear equation with applications in engineering, A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
Uses Software
Cites Work
- Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros
- A high order iteration formula for the simultaneous inclusion 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
- General local convergence theory for a class of iterative processes and its applications to Newton's method
- Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
- Convergence conditions of some methods for the simultaneous computation of polynomial zero
- A unified theory of cone metric spaces and its applications to the fixed point theory
- A posteriori error bound methods for the inclusion of polynomial zeros
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- A modified Newton method for polynomials
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
