Back to Search
Start Over
On the convergence of high-order Gargantini–Farmer–Loizou type iterative methods for simultaneous approximation of polynomial zeros.
- Source :
-
Applied Mathematics & Computation . Nov2019, Vol. 361, p202-214. 13p. - Publication Year :
- 2019
-
Abstract
- In 1984, Kyurkchiev et al. constructed an infinite sequence of iterative methods for simultaneous approximation of polynomial zeros (with known multiplicity). The first member of this sequence of iterative methods is the famous root-finding method derived independently by Farmer and Loizou (1977) and Gargantini (1978). For every given positive integer N , the N th method of this family has the order of convergence 2 N + 1. In this paper, we prove two new local convergence results for this family of iterative methods. The first one improves the result of Kyurkchiev et al. (1984). We end the paper with a comparison of the computational efficiency, the convergence behavior and the computational order convergence of different methods of the family. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 361
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 137373323
- Full Text :
- https://doi.org/10.1016/j.amc.2019.05.026