The self-validated method for polynomial zeros of high efficiency
From MaRDI portal
Publication:1034672
DOI10.1016/j.cam.2009.09.016zbMath1204.65047MaRDI QIDQ1034672
Publication date: 6 November 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2009.09.016
convergence; zeros of polynomials; iterative methods; Newton method; computational efficiency; complex zeros; acceleration of convergence; circular interval arithmetic; inclusion methods; Ostrowski's corrections; self-validated method
65G20: Algorithms with automatic result verification
65H04: Numerical computation of roots of polynomial equations
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
- Numerical methods for roots of polynomials. Part I
- Parallel Laguerre iterations: The complex case
- Halley-like method with corrections for the inclusion of polynomial zeros
- Iterative methods for simultaneous inclusion of polynomial zeros
- Some improved inclusion methods for polynomial roots with Weierstrass' corrections
- A posteriori error bounds for the zeros of polynomials
- Computational efficiency of some combined methods for polynomial equations
- Circular arithmetic and the determination of polynomial zeros
- Zur iterativen Auflösung algebraischer Gleichungen
- MPFR
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
- On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
- Algorithm 786: multiple-precision complex arithmetic and functions
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- 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
