New eighth-order derivative-free methods for solving nonlinear equations (Q456514): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3960030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4752897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new family of eighth-order iterative methods for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new family of modified Ostrowski's methods with accelerated eighth order convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new eighth-order iterative method for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steffensen type methods for solving non-linear 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: Selection of good algorithms from a family of algorithms for polynomial derivative evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Order of One-Point and Multipoint Iteration / rank
 
Normal rank

Latest revision as of 19:08, 5 July 2024

scientific article
Language Label Description Also known as
English
New eighth-order derivative-free methods for solving nonlinear equations
scientific article

    Statements

    New eighth-order derivative-free methods for solving nonlinear equations (English)
    0 references
    0 references
    16 October 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 of \(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
    0 references
    0 references
    0 references