Eighth-order iterative methods without derivatives for solving nonlinear equations (Q420242): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q58689999 / 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: Optimal Order of One-Point and Multipoint Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steffensen type methods for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sixth order derivative free family of iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of Newton's method with accelerated third-order convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative-free optimal iterative methods / rank
 
Normal rank

Latest revision as of 06:44, 5 July 2024

scientific article
Language Label Description Also known as
English
Eighth-order iterative methods without derivatives for solving nonlinear equations
scientific article

    Statements

    Eighth-order iterative methods without derivatives for solving nonlinear equations (English)
    0 references
    21 May 2012
    0 references
    Summary: A new family of eighth-order derivative-free methods for solving nonlinear equations is presented. It is proved that these methods have the convergence order of eight. These new methods are derivative-free and only use four evaluations of the function per iteration. In fact, we have obtained the optimal order of convergence which supports the Kung and Traub conjecture. Kung and Traub conjectured that the multipoint iteration methods, without memory based on \(n\) evaluations, could achieve optimal convergence order \(2^{n-1}\). Thus, we present new derivative-free methods which agree with Kung and Traub conjecture for \(n = 4\). Numerical comparisons are made to demonstrate the performance of the methods presented.
    0 references
    0 references

    Identifiers