A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
From MaRDI portal
(Redirected from Publication:1733448)
Abstract: In this paper, we establish a general semilocal convergence theorem (with computationally verifiable initial conditions and error estimates) for iterative methods for simultaneous approximation of polynomial zeros. As application of this theorem, we provide new semilocal convergence results for Ehrlich's and Dochev-Byrnev's root-finding methods. These results improve the results of Petkovi'c, Herceg and Ili'c [Numer. Algorithms 17 (1998) 313--331] and Proinov [C.~R. Acad. Bulg. Sci. 59 (2006) 705--712]. We also prove that Dochev-Byrnev's method (1964) is identical to Pre{v s}i'c-Tanabe's method (1972).
Recommendations
- Semilocal convergence of two iterative methods for simultaneous computation of polynomial zeros
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
- Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros
- On semilocal convergence analysis of the inverse Weierstrass method for simultaneous computing of polynomial zeros
- A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
- New local convergence theorems for the inverse Weierstrass method for simultaneous approximation of polynomial zeros
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
- On Euler-like methods for the simultaneous approximation of polynomial zeros
Cites work
- A modified Newton method for polynomials
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
- A unified theory of cone metric spaces and its applications to the fixed point theory
- Börsch-supan-like methods: point estimation and parallel implementation
- Certain modifications of Newton's method for the approximate solution of algebraic equations
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- scientific article; zbMATH DE number 996039 (Why is no real title available?)
- scientific article; zbMATH DE number 3492087 (Why is no real title available?)
- scientific article; zbMATH DE number 1313043 (Why is no real title available?)
- scientific article; zbMATH DE number 1124031 (Why is no real title available?)
- scientific article; zbMATH DE number 1471160 (Why is no real title available?)
- scientific article; zbMATH DE number 3999148 (Why is no real title available?)
- scientific article; zbMATH DE number 1868868 (Why is no real title available?)
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- On initial conditions for the convergence of simultaneous root finding methods
- On some iterative algorithms for polynomial factorization
- On some methods for the simultaneous determination of polynomial zeros
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- Relationships between different types of initial conditions for simultaneous root finding methods
- Residuenabschätzung für Polynom-Nullstellen mittels Lagrange-Interpolation
- Safe convergence of simultaneous methods for polynomial zeros
- Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
- Semilocal convergence of two iterative methods for simultaneous computation of polynomial zeros
Cited in
(13)- On the convergence of Schröder's method for the simultaneous computation of polynomial zeros of unknown multiplicity
- 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
- Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
- Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros
- Convergence of Newton, Halley and Chebyshev iterative methods as methods for simultaneous determination of multiple polynomial zeros
- scientific article; zbMATH DE number 4041167 (Why is no real title available?)
- On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros
- Semilocal convergence of two iterative methods for simultaneous computation of polynomial zeros
- On dynamics of iterative techniques for nonlinear equation with applications in engineering
This page was built for publication: A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733448)
