The self-validated method for polynomial zeros of high efficiency
An improved iterative method of Newton type for the simultaneous approximation of all complex zeros of a polynomial having only single roots is proposed. If \(P(z)=\prod_{j=1}^{n}(z-\zeta_{j})\) and \(z_{1},\dots,z_{n}\) are distinct approximations to the zeros, the method reads \[ \widehat{z}_{i}=z_{i}-\frac{1}{\frac{1}{u(z_{i})}-\sum^{n}_{{j=1 j\neq i}}\frac{1}{z_{i}-z_{j}} }\qquad (i\in \mathbf{I}_{n}). \] Here \(\widehat{z}_{i}\) is a new approximation to the zero \(\zeta_{i}\) and \[ u(z)=(\sum_{j=1}^{n}\frac{1}{z-\zeta_{j}})^{-1}. \] This leads to the 4th order method \[ \widehat{z}_{i}=z_{i}-\frac{1}{\frac{1}{u(z_{i})}-\sum^{n}_{{j=1 j\neq i}}\frac{1}{z_{i}-z_{j}+u(z_{j})}} \qquad (i\in \mathbf{I}_{n}). \] If we start instead of \(u(z)\) from Ostrowski's correction \[ \psi(z)=u(z)\frac{P(z-u(z))-P(z)}{2} \] we get the 6th order iterative method: \[ \widehat{z}_{i}=z_{i}-\frac{1}{\frac{1}{u(z_{i})}-\sum^{n}_{{j=1 j\neq i}}\frac{1}{z_{i}-z_{j}+\psi(z_{j})}} \qquad (i\in \mathbf{I}_{n}). \] As before \(\mathbf{I}_{n}=\{1,2,\dots,n\}.\)
- scientific article; zbMATH DE number 5353990
- On an efficient simultaneous method for finding polynomial zeros
- scientific article; zbMATH DE number 714514
- Efficient methods for the inclusion of polynomial zeros
- scientific article; zbMATH DE number 440795
- On an efficient inclusion method for finding polynomial zeros
- scientific article; zbMATH DE number 714515
- scientific article; zbMATH DE number 3928210
- scientific article; zbMATH DE number 834504
- On the efficiency of some combined methods for polynomial complex zeros
- A modified Newton method for polynomials
- A posteriori error bounds for the zeros of polynomials
- Algorithm 786: multiple-precision complex arithmetic and functions
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- Circular arithmetic and the determination of polynomial zeros
- Computational efficiency of some combined methods for polynomial equations
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- Halley-like method with corrections for the inclusion of polynomial zeros
- scientific article; zbMATH DE number 3890621 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3780477 (Why is no real title available?)
- scientific article; zbMATH DE number 1206066 (Why is no real title available?)
- scientific article; zbMATH DE number 3352737 (Why is no real title available?)
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Iterative methods for simultaneous inclusion of polynomial zeros
- Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
- MPFR
- Numerical methods for roots of polynomials. Part I
- 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
- Parallel Laguerre iterations: The complex case
- Some improved inclusion methods for polynomial roots with Weierstrass' corrections
- Zur iterativen Auflösung algebraischer Gleichungen
- scientific article; zbMATH DE number 5353990 (Why is no real title available?)
- scientific article; zbMATH DE number 714514 (Why is no real title available?)
- Euler-like method for the simultaneous inclusion of polynomial zeros with Weierstrass' correction
- The improved Farmer--Loizou method for finding polynomial zeros
- New higher-order methods for the simultaneous inclusion of polynomial zeros
- Ostrowski-like method with corrections for the inclusion of polynomial zeros
This page was built for publication: The self-validated method for polynomial zeros of high efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034672)
