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

DOI10.1016/J.CAM.2014.01.024zbMATH Open1334.65084OpenAlexW1978268479MaRDI QIDQ457775FDOQ457775

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

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

zbMATH Keywords

iterative methodnonlinear equationefficiency indexoptimal orderdivided differencederivative-free scheme

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cites Work

• Title not available (Why is that?)
• Variants of Newton's method using fifth-order quadrature formulas
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal Order of One-Point and Multipoint Iteration
• A Family of Fourth Order Methods for Nonlinear Equations
• Complex analytic dynamics on the Riemann sphere
• 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
• A new family of modified Ostrowski's methods with accelerated eighth order convergence
• Eighth-order methods with high efficiency index for solving nonlinear equations

Cited In (17)

• Solving nonlinear problems by Ostrowski-Chun type parametric families
• Determination of multiple roots of nonlinear equations and applications
• A simple algorithm for high order Newton iteration formulae and some new variants
• On a general transformation of multipoint root-solvers
• Preserving the order of convergence: low-complexity Jacobian-free iterative schemes for solving nonlinear systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Editorial: Recent trends on computational and mathematical methods in science and engineering (CMMSE)
• New mono- and biaccelerator iterative methods with memory for nonlinear equations
• Two-point generalized Hermite interpolation: double-weight function and functional recursion methods for solving nonlinear equations
• On the Construction of Fast Steffensen-Type Iterative Methods for Nonlinear Equations
• On general families of multipoint iterations by inverse interpolation and their applications
• Derivative free iterative methods with memory having higher R-order of convergence
• On the complexity of extending the convergence region for Traub's method
• A new higher-order optimal derivative free scheme for multiple roots
• On a two-step optimal Steffensen-type method: relaxed local and semi-local convergence analysis and dynamical stability
• Efficient four-parametric with-and-without-memory iterative methods possessing high efficiency indices

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)