An optimal Steffensen-type family for solving nonlinear equations (Q555350): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 07:58, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An optimal Steffensen-type family for solving nonlinear equations |
scientific article |
Statements
An optimal Steffensen-type family for solving nonlinear equations (English)
0 references
22 July 2011
0 references
The paper is devoted to the numerical solution of nonlinear equations \(f(x) = 0\). The authors use Newton's iteration for the direct Newtonian interpolation of the function to construct optimal Steffensen-type methods of second-, fourth- and eighth-order, which use only two, three and four evaluations of the function, respectively. Moreover, they deduce the corresponding error equations and asymptotic convergence constants. The proposed general optimal Steffensen-type family only uses \(n\) evaluations of \(f\) to achieve the optimal \(2^{n-1}\)th order of convergence for solving the simple root of nonlinear functions, and the authors compare this family with Newton's method, Steffensen's method, Ren-Wu-Bi's method, Kung-Traub's method and Neta-Petković's method for solving nonlinear equations in numerical examples.
0 references
nonlinear equation
0 references
iterative method
0 references
Newton's method
0 references
Steffensen's method
0 references
derivative free method
0 references
optimal convergence
0 references
comparison of methods
0 references
asymptotic convergence constants
0 references
Ren-Wu-Bi's method
0 references
Kung-Traub's method
0 references
Neta-Petković's method
0 references
numerical examples
0 references