Derivative free iterative methods with memory of arbitrary high convergence order (Q483280)

From MaRDI portal
Revision as of 10:42, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Derivative free iterative methods with memory of arbitrary high convergence order
scientific article

    Statements

    Derivative free iterative methods with memory of arbitrary high convergence order (English)
    0 references
    16 December 2014
    0 references
    One of the basic and classic problem in numerical analysis is the problem of finding the roots of single variable nonlinear equations. Methods of solving nonlinear equations which do not require the derivative of function are suggested and analysed in the paper. Several \(n\)-step derivative free iterative methods with memory of arbitrary high order are obtained. Numerical examples show that the proposed methods have an equal or superior performance, on smooth and nonsmooth equations, compared to classical iterative methods as Steffensen's and Newton's methods. The bibliography contains 16 sources.
    0 references
    optimal method
    0 references
    nonlinear equations
    0 references
    Kung-Traub's conjecture
    0 references
    comparison of methods
    0 references
    Steffensen's method
    0 references
    derivative free iterative methods
    0 references
    numerical examples
    0 references
    Newton's methods
    0 references

    Identifiers