On the complexity of convergence for high order iterative methods
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1424590
- On the convergence of higher-order orthogonal iteration
- On the complexity of a unified convergence analysis for iterative methods
- On the convergence of certain iterative methods
- scientific article; zbMATH DE number 3888817
- scientific article; zbMATH DE number 3159019
- A unifying semi-local analysis for iterative algorithms of high convergence order
- scientific article; zbMATH DE number 512549
- High order family of multivariate iterative methods: convergence and stability
- scientific article; zbMATH DE number 1779902
Cites work
- A contemporary study of iterative methods. Convergence, dynamics and applications
- A modified Chebyshev's iterative method with at least sixth order of convergence
- A study of the local convergence of a fifth order iterative method
- An adaptive version of a fourth-order iterative method for quadratic equations
- An improvement of the region of accessibility of Chebyshev’s method from Newton’s method
- Ball convergence of a sixth-order Newton-like method based on means under weak conditions
- Computational theory of iterative methods.
- Convergence and Applications of Newton-type Iterations
- scientific article; zbMATH DE number 3760758 (Why is no real title available?)
- scientific article; zbMATH DE number 1234625 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Iterative methods and their dynamics with applications: a contemporary study
- Modification of the Kantorovich assumptions for semilocal convergence of the Chebyshev method
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- New Kantorovich-Type Conditions for Halley's Method
- On a family of high-order iterative methods under Kantorovich conditions and some applications
- On iterative methods with accelerated convergence for solving systems of nonlinear equations
- On the complexity of extending the convergence ball of Wang's method for finding a zero of a derivative
- On the complexity of extending the convergence region for Traub's method
- Real dynamics for damped Newton's method applied to cubic polynomials
- The convergence of a Halley-Chebysheff-type method under Newton- Kantorovich hypotheses
- The theory and applications of iteration methods
- Weaker convergence criteria for Traub's method
Cited in
(8)- Rate of convergence of higher-order methods
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
- Improved local analysis for a certain class of iterative methods with cubic convergence
- On a family of high-order iterative methods under Kantorovich conditions and some applications
- On the convergence of higher-order orthogonal iteration
- Generalized convergence conditions for the local and semilocal analyses of higher order Newton-type iterations
- An improvement of the Newton method for solving symmetric algebraic Riccati equations
- High-efficiency parametric iterative schemes for solving nonlinear equations with and without memory
This page was built for publication: On the complexity of convergence for high order iterative methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2171944)