An optimal Steffensen-type family for solving nonlinear equations (Q555350): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5723445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Order of One-Point and Multipoint Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of two-step Steffensen type methods with fourth-order convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of Steffensen's method of fourth-order convergence and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative free two-point methods with and without memory for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variants of Steffensen-Secant method and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Steffensen's type method in Banach spaces with applications on boundary-value problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of optimal order nonlinear solvers using inverse interpolation / rank
 
Normal rank

Latest revision as of 08:34, 4 July 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
    0 references
    0 references
    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
    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
    0 references