Low-complexity root-finding iteration functions with no derivatives of any order of convergence

DOI10.1016/J.CAM.2014.01.024MaRDI QIDQ457775zbMATHOpenAlexFDO

Authors Alicia Cordero, Juan Ramón Torregrosa Sánchez

Publication date 29 September 2014

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2014.01.024

zbMATH Keywords

iterative methodnonlinear equationefficiency indexoptimal orderdivided differencederivative-free scheme

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Recommendations

• A family of high order derivative-free iterative methods for solving root-finding problems
• Derivative free iterative methods with memory of arbitrary high convergence order
• Some Steffensen-type iterative schemes for the approximate solution of nonlinear equations
• Solving nonlinear equations by a new derivative free iterative method
• Complex dynamics of derivative-free methods for nonlinear equations

Cites work

• scientific article; zbMATH DE number 3352737 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• A Family of Fourth Order Methods for Nonlinear Equations
• A new family of modified Ostrowski's methods with accelerated eighth order convergence
• Complex analytic dynamics on the Riemann sphere
• Eighth-order methods with high efficiency index for solving nonlinear equations
• Improved King's methods with optimal order of convergence based on rational approximations
• On an efficient family of derivative free three-point methods for solving nonlinear equations
• Optimal Order of One-Point and Multipoint Iteration
• Variants of Newton's method using fifth-order quadrature formulas

Cited in

(20)

• Two-point generalized Hermite interpolation: double-weight function and functional recursion methods for solving nonlinear equations
• On a two-step optimal Steffensen-type method: relaxed local and semi-local convergence analysis and dynamical stability
• A general family of derivative free with and without memory root finding methods
• Derivative free iterative methods with memory having higher R-order of convergence
• Dynamics and fractal dimension of Steffensen-type methods
• Solving nonlinear problems by Ostrowski-Chun type parametric families
• Basins of attraction for various Steffensen-type methods
• Determination of multiple roots of nonlinear equations and applications
• A simple algorithm for high order Newton iteration formulae and some new variants
• On the complexity of extending the convergence region for Traub's method
• Complex dynamics of derivative-free methods for nonlinear equations
• Efficient four-parametric with-and-without-memory iterative methods possessing high efficiency indices
• New mono- and biaccelerator iterative methods with memory for nonlinear equations
• Preserving the order of convergence: low-complexity Jacobian-free iterative schemes for solving nonlinear systems
• On the construction of fast Steffensen-type iterative methods for nonlinear equations
• On general families of multipoint iterations by inverse interpolation and their applications
• On a general transformation of multipoint root-solvers
• Using majorizing sequences for the semi-local convergence of a high-order and multipoint iterative method along with stability analysis
• Editorial: Recent trends on computational and mathematical methods in science and engineering (CMMSE)
• A new higher-order optimal derivative free scheme for multiple roots

This page was built for publication: Low-complexity root-finding iteration functions with no derivatives of any order of convergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457775)