On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
From MaRDI portal
Publication:4831432
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; zbMATH DE number 5307160
- On an efficient simultaneous method for finding polynomial zeros
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
Cites work
- scientific article; zbMATH DE number 1313043 (Why is no real title available?)
- A bibliography on roots of polynomials
- A family of simultaneous zero-finding methods
- A modified Newton method for polynomials
- A parallel algorithm for simple roots of polynomials
- A posteriori error bounds for the zeros of polynomials
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- An iteration formula for the simultaneous determination of the zeros of a polynomial
- Finding the roots of a polynomial on an MIMD multicomputer
- Iterative methods for simultaneous inclusion of polynomial zeros
- On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials
- On some methods for the simultaneous determination of polynomial zeros
- On the determination of the safe initial approximation for the Durand- Kerner algorithm
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- Safe convergence of simultaneous methods for polynomial zeros
- Simultaneous inclusion of the zeros of a polynomial
- Some simultaneous iterations for finding all zeros of a polynomial with high order convergence
- The fundamental theorem of algebra and complexity theory
- The theory of Smale's point estimation and its applications
Cited in
(11)- On fourth order simultaneously zero-finding method for multiple roots of complex polynomial equations
- 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
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros
- A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
- 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
- On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots
- scientific article; zbMATH DE number 5307160 (Why is no real title available?)
- On the fourth order zero-finding methods for polynomials
- On an efficient simultaneous method for finding polynomial zeros
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)
