A highly efficient root-solver of very fast convergence
From MaRDI portal
Publication:2378767
DOI10.1016/j.amc.2008.08.002zbMath1157.65027OpenAlexW2085279439MaRDI QIDQ2378767
Publication date: 14 January 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2008.08.002
zeros of polynomialscomputational efficiencyacceleration of convergencesimultaneous methodsOstrowski's method
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) Polynomials, factorization in commutative rings (13P05)
Related Items
On comparison of annuli containing all the zeros of a polynomial ⋮ Bounds for the zeros of complex-coefficient polynomials ⋮ On region containing all the zeros of a polynomial ⋮ Annular bounds for the zeros of a polynomial ⋮ On Geometry of the Zeros of a Polynomial
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Numerical methods for roots of polynomials. Part I
- Iterative methods for simultaneous inclusion of polynomial zeros
- MPFR
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- A modified Newton method for polynomials
