Relationships between different types of initial conditions for simultaneous root finding methods

DOI10.1016/J.AML.2015.08.016zbMATH Open1330.65070arXiv1506.01043OpenAlexW2963212354MaRDI QIDQ901005FDOQ901005

Petko D. Proinov

Publication date: 23 December 2015

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Abstract: The construction of initial conditions of an iterative method is one of the most important problems in solving nonlinear equations. In this paper, we obtain relationships between different types of initial conditions that guarantee the convergence of iterative methods for simultaneous finding all zeros of a polynomial. In particular, we show that any local convergence theorem for a simultaneous method can be converted into a convergence theorem with computationally verifiable initial conditions which is of practical importance. Thus, we propose a new approach for obtaining semilocal convergence results for simultaneous methods via local convergence results.

Full work available at URL: https://arxiv.org/abs/1506.01043

zbMATH Keywords

iterative methodslocal convergencepolynomial zerossemilocal convergencesimultaneous methodsinitial conditions

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
• Point estimation of root finding methods
• General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
• Convergence of the two-point Weierstrass root-finding method
• On the convergence of Halley's method for simultaneous computation of polynomial zeros
• Weierstrass formula and zero-finding methods
• On the determination of the safe initial approximation for the Durand- Kerner algorithm
• Simultaneous inclusion of the zeros of a polynomial
• Point estimation of simultaneous methods for solving polynomial equations: A survey

Cited In (18)

• A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
• Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
• On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
• Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
• On the local convergence of Ehrlich method for numerical computation of polynomial zeros
• On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros
• Computer visualization and dynamic study of new families of root-solvers
• Unified convergence analysis for Picard iteration in \(n\)-dimensional vector spaces
• On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros
• Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
• On initial conditions for the convergence of simultaneous root finding methods
• A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence
• A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
• A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
• On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
• Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros
• Convergence of the two-point Weierstrass root-finding method
• On a family of Weierstrass-type root-finding methods with accelerated convergence

This page was built for publication: Relationships between different types of initial conditions for simultaneous root finding methods

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