Unified convergence analysis for Picard iteration in \(n\)-dimensional vector spaces
From MaRDI portal
Publication:1742974
DOI10.1007/s10092-018-0251-xzbMath1386.65153OpenAlexW2792929347MaRDI QIDQ1742974
Publication date: 12 April 2018
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-018-0251-x
error estimatessemilocal convergenceNewton methodlocal convergencePicard iterationsuccessive approximations
Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Fixed-point and coincidence theorems (topological aspects) (54H25) Numerical computation of solutions to single equations (65H05) Numerical solutions to equations with nonlinear operators (65J15)
Related Items
A new family of Sakurai-Torii-Sugiura type iterative methods with high order of convergence, Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros, Finding polynomial roots by dynamical systems -- a case study, On the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zeros, On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros, Existence and uniqueness of solutions for the stochastic Volterra-Levin equation with variable delays, Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 a family of Weierstrass-type root-finding methods with accelerated convergence
- Iterative approximation of fixed points
- On the convergence of Halley's method for simultaneous computation of polynomial zeros
- Relationships between different types of initial conditions for simultaneous root finding methods
- On dominating sequence method in the point estimate and Smale's theorem
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
- Simultaneous point estimates for Newton's method
- A unified theory of cone metric spaces and its applications to the fixed point theory
- A convergence analysis of a fourth-order method for computing all zeros of a polynomial simultaneously
- A generalization of the Banach contraction principle with high order of convergence of successive approximations
- A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- Valued Fields
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
