On the convergence of high-order Gargantini–Farmer–Loizou type iterative methods for simultaneous approximation of polynomial zeros

Petko D. Proinov and Maria T. Vasileva

Applied Mathematics and Computation, 2019, vol. 361, issue C, 202-214

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 Nth method of this family has the order of convergence 2N+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.

Keywords: Iterative methods; Gargantini–Farmer–Loizou method; Multiple polynomial zeros; Accelerated convergence; Local convergence; Error estimates (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319304199
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:361:y:2019:i:c:p:202-214

DOI: 10.1016/j.amc.2019.05.026

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().