The improved Farmer–Loizou method for finding polynomial zeros
From MaRDI portal
Publication:4903554
DOI10.1080/00207160.2011.641538zbMath1255.65091MaRDI QIDQ4903554
Miodrag S. Petković, Lidija Z. Rančić, Mimica R. Milošević
Publication date: 22 January 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2011.641538
iterative methods; polynomial zeros; convergence order; simultaneous methods; convergence conditions
65F10: Iterative numerical methods for linear systems
65H04: Numerical computation of roots of polynomial equations
Related Items
Cites Work
- On some improvements of square root iteration for polynomial complex zeros
- Point estimation of root finding methods
- Some modifications of the parallel Halley iteration method and their convergence
- Chebyshev-like root-finding methods with accelerated convergence
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial