On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
type: Item
instance of: scholarly article
title: On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
zbMATH Open document ID: 1429.65100
author: Petko D. Proinov
author: Stoil I. Ivanov
author: M. S. Petković
published in: Applied Mathematics and Computation
publication date: 2019-11-26T00:00:00Z
Mathematics Subject Classification ID: 65H04
zbMATH DE Number: 7136875
zbMATH Keywords: polynomial zeros
zbMATH Keywords: iteration methods
zbMATH Keywords: simultaneous methods
zbMATH Keywords: local convergence
zbMATH Keywords: semilocal convergence
zbMATH Keywords: error estimates
describes a project that uses: Mulprec
MaRDI profile type: Publication
full work available at URL: j.amc.2018.12.041
OpenAlex ID: W2912940379
cites work: On Halley's Iteration Method
cites work: On optimal fourth-order iterative methods free from second derivative and their dynamics
cites work: Numerical Methods in Scientific Computing, Volume I
cites work: An extension of Gander's result for quadratic equations
cites work: Scientific Computing - An Introduction using Maple and MATLAB
cites work: Numerical properties of different root-finding algorithms obtained for approximating continuous Newton's method
cites work: Newton-type iterative methods for finding zeros having higher multiplicity
cites work: Numerical methods for roots of polynomials. II
cites work: Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
cites work: A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
cites work: Point estimation of root finding methods
cites work: General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
cites work: Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
cites work: On the convergence of Halley's method for simultaneous computation of polynomial zeros
cites work: Convergence of the two-point Weierstrass root-finding method
cites work: On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
cites work: On a family of Weierstrass-type root-finding methods with accelerated convergence
cites work: Relationships between different types of initial conditions for simultaneous root finding methods
cites work: Q3450423
cites work: Q4720691
cites work: A generalization of the Banach contraction principle with high order of convergence of successive approximations
cites work: General local convergence theory for a class of iterative processes and its applications to Newton's method
cites work: New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
cites work: A unified theory of cone metric spaces and its applications to the fixed point theory
cites work: Point estimation and some applications to iterative methods
cites work: On some improvements of square root iteration for polynomial complex zeros
cites work: Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
cites work: Q4342463
Wikidata QID: Q128468122
DOI: 10.1016/J.AMC.2018.12.041
description: scientific article; zbMATH DE number 7136875