On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
DOI10.1080/00207160310001650107zbMATH Open1072.65070OpenAlexW2108507664MaRDI QIDQ4831432FDOQ4831432
Authors: Snežana Ilić, Lidija Z. Rančić 
Publication date: 29 December 2004
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160310001650107
Recommendations
- On Euler-like methods for the simultaneous approximation of polynomial zeros
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros
- scientific article; zbMATH DE number 1694911
- The convergence of Euler-like method for the simultaneous inclusion of polynomial zeros
- Some higher-order methods for the simultaneous approximation of multiple polynomial zeros
- On some methods for the simultaneous determination of polynomial zeros
- scientific article
- On an efficient simultaneous method for finding polynomial zeros
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)
Cites Work
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- A modified Newton method for polynomials
- Iterative methods for simultaneous inclusion of polynomial zeros
- A bibliography on roots of polynomials
- The fundamental theorem of algebra and complexity theory
- The theory of Smale's point estimation and its applications
- On some methods for the simultaneous determination of polynomial zeros
- Title not available (Why is that?)
- An iteration formula for the simultaneous determination of the zeros of a polynomial
- A posteriori error bounds for the zeros of polynomials
- On the determination of the safe initial approximation for the Durand- Kerner algorithm
- Finding the roots of a polynomial on an MIMD multicomputer
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- Safe convergence of simultaneous methods for polynomial zeros
- Some simultaneous iterations for finding all zeros of a polynomial with high order convergence
- On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
- A family of simultaneous zero-finding methods
- Simultaneous inclusion of the zeros of a polynomial
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- A parallel algorithm for simple roots of polynomials
Cited In (5)
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
- A highly efficient root-solver of very fast convergence
- Title not available (Why is that?)
- On the fourth order zero-finding methods for polynomials
This page was built for publication: On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4831432)
