Low-complexity root-finding iteration functions with no derivatives of any order of convergence
From MaRDI portal
(Redirected from Publication:457775)
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
(22)- A novel optimal fourth-order iteration scheme for solving nonlinear problems in applied sciences
- Solving nonlinear problems by Ostrowski-Chun type parametric families
- Determination of multiple roots of nonlinear equations and applications
- On a general transformation of multipoint root-solvers
- A simple algorithm for high order Newton iteration formulae and some new variants
- Dynamics and fractal dimension of Steffensen-type methods
- 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
- Extending the convergence region of m-step iterative procedures
- Editorial: Recent trends on computational and mathematical methods in science and engineering (CMMSE)
- New mono- and biaccelerator iterative methods with memory for nonlinear equations
- Complex dynamics of derivative-free methods for nonlinear equations
- Two-point generalized Hermite interpolation: double-weight function and functional recursion methods for solving nonlinear equations
- Derivative free iterative methods with memory having higher R-order of convergence
- On general families of multipoint iterations by inverse interpolation and their applications
- A general family of derivative free with and without memory root finding methods
- Using majorizing sequences for the semi-local convergence of a high-order and multipoint iterative method along with stability analysis
- 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
- Basins of attraction for various Steffensen-type methods
- 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)
