Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6395662
- Convergence of Chebyshev-like method for simultaneous approximation of multiple polynomial zeros
- Semilocal convergence of two iterative methods for simultaneous computation of polynomial zeros
- On the guaranteed convergence of Chebishev-like method for computing polynomial zeros
- On the convergence of Chebyshev's method for multiple polynomial zeros
- A new semilocal convergence theorem for the Weierstrass method for finding 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 semilocal convergence analysis of the inverse Weierstrass method for simultaneous computing of polynomial zeros
- Chebyshev-like root-finding methods with accelerated convergence
- A Globally Convergent Method for Simultaneously Finding Polynomial Roots
Cites work
- scientific article; zbMATH DE number 996039 (Why is no real title available?)
- scientific article; zbMATH DE number 4176359 (Why is no real title available?)
- scientific article; zbMATH DE number 1179336 (Why is no real title available?)
- scientific article; zbMATH DE number 1868929 (Why is no real title available?)
- scientific article; zbMATH DE number 6395662 (Why is no real title available?)
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
- A new semilocal convergence theorem for the Weierstrass method from data at one point
- A unified theory of cone metric spaces and its applications to the fixed point theory
- General local convergence theory for a class of iterative processes and its applications to Newton's method
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- Numerical methods for roots of polynomials. Part I
- On a modification of Chebyshev's method
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros
- Point estimation of root finding methods
- Semilocal convergence of two iterative methods for simultaneous computation of polynomial zeros
Cited in
(24)- A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
- 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 convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros
- scientific article; zbMATH DE number 6395662 (Why is no real title available?)
- 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 HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS
- A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros
- 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
- On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation
- Convergence of Chebyshev-like method for simultaneous approximation of multiple polynomial zeros
- Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
- On the convergence of Chebyshev's method for multiple polynomial zeros
- On dynamics of iterative techniques for nonlinear equation with applications in engineering
- Iterative approximation of fixed points of quasi-contraction mappings in cone metric spaces
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- On a family of Weierstrass-type root-finding methods with accelerated convergence
- ON EFFICIENT FRACTIONAL CAPUTO-TYPE SIMULTANEOUS SCHEME FOR FINDING ALL ROOTS OF POLYNOMIAL EQUATIONS WITH BIOMEDICAL ENGINEERING APPLICATIONS
- A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class
This page was built for publication: Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q273377)