Improvements of the efficiency of some three-step iterative like-Newton methods (Q2642289): Difference between revisions
From MaRDI portal
Revision as of 12:48, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Improvements of the efficiency of some three-step iterative like-Newton methods |
scientific article |
Statements
Improvements of the efficiency of some three-step iterative like-Newton methods (English)
0 references
20 August 2007
0 references
To solve iteratively a nonlinear equation, the classical Newton method can be improved from the viewpoint of convergence order and efficiency. This can be made by an additional evaluation of the function appearing in the left hand side of the equation, an additional evaluation of the first derivative, or by changing the points of evaluation. The author discusses some new three-step iterative methods obtained from a two-step variant of Newton's method, where the last evaluation of the derivative is replaced by a linear combination of evaluations of the functions previously computed. The new iterative methods are of third and fourth order of convergence and it seems that they work better than the known variants of Newton's method in terms of order and of computational efficiency for multi-precision arithmetic. Numerical experiments and comparisons are performed for seven concrete equations.
0 references
Newton's method
0 references
three-step iterative methods
0 references
order of convergence
0 references
computational efficiency
0 references
numerical experiments
0 references