Convergence of the two-point Weierstrass root-finding method

DOI10.1007/S13160-014-0138-4MaRDI QIDQ403839zbMATH OpenOpenAlexFDO

Authors Petko D. Proinov, Milena D. Petkova

Publication date 29 August 2014

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13160-014-0138-4

zbMATH Keywords

error estimateslocal convergencepolynomial zerossemilocal convergencesimultaneous methodstwo--point Weierstrass method

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05) Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04)

Recommendations

• Convergence of the Weierstrass method for simultaneous approximation of polynomial zeros
• A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
• On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial
• Local and semilocal convergence of a family of multi-point Weierstrass-type root-finding methods
• New local convergence theorems for the inverse Weierstrass method for simultaneous approximation of polynomial zeros

Cites work

• scientific article; zbMATH DE number 996039 (Why is no real title available?)
• A biparametric family of inverse-free multipoint iterations
• Certain modifications of Newton's method for the approximate solution of algebraic equations
• New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
• On some families of multi-point iterative methods for solving nonlinear equations
• On some methods for the simultaneous determination of polynomial zeros
• On the convergence of multipoint iterations
• On the determination of the safe initial approximation for the Durand- Kerner algorithm
• Point estimation of root finding methods
• Relationships between different types of initial conditions for simultaneous root finding methods
• The simultaneous approximation of polynomial roots
• Two-point iterative methods for solving nonlinear equations
• Unified majorizing sequences for Traub-type multipoint iterative procedures
• Zero-finder methods derived from Obreshkov's techniques

Cited in

(15)

• A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
• Inverse numerical iterative technique for finding all roots of nonlinear equations with engineering applications
• Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
• scientific article; zbMATH DE number 621974 (Why is no real title available?)
• Relationships between different types of initial conditions for simultaneous root finding methods
• 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
• scientific article; zbMATH DE number 6451405 (Why is no real title available?)
• A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
• On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
• On the guaranteed convergence of new two-point root-finding methods for polynomial zeros
• Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros
• General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
• On the divergent properties of two-sided SOR Weierstrass method
• Convergence of the Weierstrass method for simultaneous approximation of polynomial zeros

This page was built for publication: Convergence of the two-point Weierstrass root-finding method

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