Multi-step nonlinear ABS methods and their efficiency analysis
From MaRDI portal
The multi-step principle developed 20 years ago for Newton's method and most of its discretized versions is applied to nonlinear ABS methods. In the multi-step methods each major iteration step consists of \(m+1\) minor iterations where the derivative information is fixed and only function values are to be computed. The method is shown to converge locally with O-order \(m+2\), and for given dimension n the optimal step number m which minimizes an asymptotic measure of complexity is determined.
Recommendations
Cites work
- A class of direct methods for linear systems
- Ableitungsfreie Verfahren mit höherer Konvergenzgeschwindigkeit
- scientific article; zbMATH DE number 3750180 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Solving nonlinear simultaneous equations with a generalization of Brent's method
- Some Efficient Algorithms for Solving Systems of Nonlinear Equations
- The local convergence of ABS methods for nonlinear algebraic equations
Cited in
(6)- A note on the condition for convergence of nonlinear ABS method
- Convergence analysis of the nonlinear block scaled ABS methods
- Thresholds of the inner steps in multi-step Newton method
- scientific article; zbMATH DE number 1102599 (Why is no real title available?)
- A bibliography of the ABS methods
- Restart row update ABS methods for solving systems of nonlinear equations
This page was built for publication: Multi-step nonlinear ABS methods and their efficiency analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805160)