On the local convergence of Ehrlich method for numerical computation of polynomial zeros
From MaRDI portal
Publication:331804
DOI10.1007/s10092-015-0155-yzbMath1406.65033OpenAlexW1755235811MaRDI QIDQ331804
Publication date: 27 October 2016
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-015-0155-y
Related Items
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, 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, 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, Simultaneous roots for vectorial problems, Unified convergence analysis for Picard iteration in \(n\)-dimensional vector spaces, 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, On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
Uses Software
Cites Work
- Numerical computation of polynomial zeros by means of Aberth's method
- 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
- On the convergence order of a modified method for simultaneous finding polynomial zeros
- Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
- Convergence conditions of some methods for the simultaneous computation of polynomial zero
- Numerical methods for roots of polynomials. II
- 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
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
