On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros

DOI10.22436/jnsa.011.09.03zbMath1438.65101OpenAlexW2809578611WikidataQ129627598 ScholiaQ129627598MaRDI QIDQ5225442

Publication date: 22 July 2019

Published in: Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.22436/jnsa.011.09.03

zbMATH Keywords

error estimates iterative methods local convergence Ehrlich method simultaneous methods Gargantini-Farmer-Loizou method multiple polynomial zeros

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04)

Related Items (2)

A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence ⋮ On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
On the local convergence of Ehrlich method for numerical computation of polynomial zeros
A note on some improvements of the simultaneous methods for determination of polynomial zeros
On the convergence order of a modified method for simultaneous finding polynomial zeros
Complexity analysis of a process for simultaneously obtaining all zeros of polynomials
Convergence conditions of some methods for the simultaneous computation of polynomial zero
A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
Unified convergence analysis for Picard iteration in \(n\)-dimensional vector spaces
A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
An algorithm for the total, or partial, factorization of a polynomial
Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
Some higher-order methods for the simultaneous approximation of multiple polynomial zeros
A modified Newton method for polynomials
Valued Fields
General convergence theorems for iterative processes and applications to the Weierstrass root-finding method

This page was built for publication: On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros