Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A novel family of weighted-Newton optimal eighth order methods with dynamics - MaRDI portal

A novel family of weighted-Newton optimal eighth order methods with dynamics (Q725379)

From MaRDI portal





scientific article; zbMATH DE number 6912254
Language Label Description Also known as
English
A novel family of weighted-Newton optimal eighth order methods with dynamics
scientific article; zbMATH DE number 6912254

    Statements

    A novel family of weighted-Newton optimal eighth order methods with dynamics (English)
    0 references
    0 references
    0 references
    0 references
    1 August 2018
    0 references
    The article is devoted to the classical problem of constructing efficient and higher-order of convergence iterative algorithms for solving nonlinear equations. In this area of numerical analysis, several iterative families are known, with order of convergence \(\tau=8\) and optimal in the sense of the Kung-Traub conjecture. The authors construct a new three-stage method, the so-called weighted-Newton method with order of convergence \(\tau=2^3\) and efficiency index \(EI=2^{\frac{3}{4}}\). The new algorithm requires only three function calculations and one derivative calculation at a point, that is, it is optimal in the sense of Kung-Traub considerations. The authors analyze the basins of attraction of the method on the some basic polynomials.
    0 references
    nonlinear equations
    0 references
    eighth-order convergence
    0 references
    weight function technique
    0 references
    computational efficiency
    0 references
    Kung-Traub conjecture
    0 references
    basins of attraction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers