Algorithm for forming derivative-free optimal methods

DOI10.1007/s11075-013-9715-xzbMath1304.65143OpenAlexW1966536904MaRDI QIDQ457040

Trond Steihaug, Sanjay K. Khattri

Publication date: 26 September 2014

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-013-9715-x

zbMATH Keywords

convergencenumerical examplenonlinear equationNewton methodderivative free iterative method

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items

Some new bi-accelerator two-point methods for solving nonlinear equations ⋮ An optimal and efficient general eighth-order derivative free scheme for simple roots ⋮ Widening basins of attraction of optimal iterative methods ⋮ Two general higher-order derivative free iterative techniques having optimal convergence order ⋮ Damped Traub's method: convergence and stability ⋮ A new class of optimal four-point methods with convergence order 16 for solving nonlinear equations ⋮ A general class of one-parametric with memory method for solving nonlinear equations ⋮ A general class of optimal eighth-order derivative free methods for nonlinear equations ⋮ Some real-life applications of a newly constructed derivative free iterative scheme ⋮ Families of optimal derivative-free two- and three-point iterative methods for solving nonlinear equations

Uses Software

• ARPREC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improvement of Ostrowski's and King's techniques with optimal convergence order eight
• Eighth-order iterative methods without derivatives for solving nonlinear equations
• Three-point methods with and without memory for solving nonlinear equations
• A class of Steffensen type methods with optimal order of convergence
• An optimal Steffensen-type family for solving nonlinear equations
• Derivative free two-point methods with and without memory for solving nonlinear equations
• Sixth order derivative free family of iterative methods
• A fourth-order derivative-free algorithm for nonlinear equations
• Derivative free algorithm for solving nonlinear equations
• Optimal eighth order iterative methods
• On new computational local orders of convergence
• A two-step Steffensen's method under modified convergence conditions
• A composite fourth-order iterative method for solving nonlinear equations
• Three-step iterative methods with eighth-order convergence for solving nonlinear equations
• A class of quasi-Newton generalized Steffensen methods on Banach spaces
• Generating optimal derivative free iterative methods for nonlinear equations by using polynomial interpolation
• Computational theory of iterative methods.
• Some fourth-order iterative methods for solving nonlinear equations
• Convergence and numerical analysis of a family of two-step Steffensen's methods
• Constructing third-order derivative-free iterative methods
• On a General Class of Multipoint Root-Finding Methods of High Computational Efficiency
• Evaluating Derivatives
• Optimal Order of One-Point and Multipoint Iteration
• Some Fourth Order Multipoint Iterative Methods for Solving Equations
• A Family of Fourth Order Methods for Nonlinear Equations