The improved Farmer--Loizou method for finding polynomial zeros

DOI10.1080/00207160.2011.641538zbMATH Open1255.65091OpenAlexW2020743259MaRDI QIDQ4903554FDOQ4903554

Lidija Z. Rančić, M. R. Milošević, M. S. Petković

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

zbMATH Keywords

iterative methodspolynomial zerossimultaneous methodsconvergence conditionsconvergence order

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of roots of polynomial equations (65H04)

Cites Work

• Point estimation of root finding methods
• Chebyshev-like root-finding methods with accelerated convergence
• A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
• On some improvements of square root iteration for polynomial complex zeros
• Some modifications of the parallel Halley iteration method and their convergence

Cited In (1)

• On an efficient simultaneous method for finding polynomial zeros

   Recommendations

• On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros 👍 👎
• On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros 👍 👎
• On an efficient simultaneous method for finding polynomial zeros 👍 👎
• A note on the improved derivative free root-solvers 👍 👎
• The self-validated method for polynomial zeros of high efficiency 👍 👎

This page was built for publication: The improved Farmer--Loizou method for finding polynomial zeros

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903554)