Thresholds of the inner steps in multi-step Newton method
Summary: We investigate the efficiency of multi-step Newton method (the classical Newton method in which the first derivative is re-evaluated periodically after \(m\) steps) for solving nonlinear equations, \(F(x) = 0\), \(F:D \subseteq \mathbb R^n \rightarrow \mathbb R^n\). We highlight the following property of multi-step Newton method with respect to some other Newton-type method: for a given \(n\), there exist thresholds of \(m\), that is an interval \((m_i, m_s)\), such that for \(m\) inside of this interval, the efficiency index of multi-step Newton method is better than that of other Newton-type method. We also search for optimal values of \(m\).
- Multi-step nonlinear ABS methods and their efficiency analysis
- On the local and semilocal convergence of a parameterized multi-step Newton method
- scientific article; zbMATH DE number 1888512
- An improvement to double-step Newton method and its multi-step version for solving system of nonlinear equations and its applications
- Improvements of the efficiency of some three-step iterative like-Newton methods
- An optimization of Chebyshev's method
- Frozen Jacobian iterative method for solving systems of nonlinear equations application to nonlinear IVPs and BVPs
- scientific article; zbMATH DE number 3875911 (Why is no real title available?)
- scientific article; zbMATH DE number 3740677 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Semilocal convergence by using recurrence relations for a fifth-order method in Banach spaces
- Semilocal convergence of a sixth-order Jarratt method in Banach spaces
- Some Fourth Order Multipoint Iterative Methods for Solving Equations
This page was built for publication: Thresholds of the inner steps in multi-step Newton method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1657024)
