Solving nonlinear equations by a derivative-free form of the King's family with memory

DOI10.1007/s10092-015-0144-1zbMath1347.65098arXiv1410.5867OpenAlexW2107890560MaRDI QIDQ295363

Stefan Siegmund, Mehdi Salimi, Somayeh Sharifi

Publication date: 13 June 2016

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.5867

zbMATH Keywords

convergence accelerationnonlinear equationsKing's methodKung-Traub's conjecturemethod with memorymulti-point methodnumerical comparisonR-order of convergence

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (16)

Derivative free iterative methods with memory having higher R-order of convergence ⋮ Optimal Newton–Secant like methods without memory for solving nonlinear equations with its dynamics ⋮ New modification of Maheshwari's method with optimal eighth order convergence for solving nonlinear equations ⋮ An optimal three-point eighth-order iterative method without memory for solving nonlinear equations with its dynamics ⋮ A new family of adaptive methods with memory for solving nonlinear equations ⋮ Computing multiple zeros by using a parameter in Newton-secant method ⋮ Developing a new family of Newton-Secant method with memory based on a weight function ⋮ On general families of multipoint iterations by inverse interpolation and their applications ⋮ An efficient family of two-step with-memory methods with convergence order 6 and their dynamics ⋮ A general class of one-parametric with memory method for solving nonlinear equations ⋮ Higher-order derivative-free families of Chebyshev-Halley type methods with or without memory for solving nonlinear equations ⋮ Efficient derivative-free variants of Hansen-Patrick's family with memory for solving nonlinear equations ⋮ A multi-point iterative method for solving nonlinear equations with optimal order of convergence ⋮ Review of some iterative methods for solving nonlinear equations with multiple zeros ⋮ Families of optimal derivative-free two- and three-point iterative methods for solving nonlinear equations ⋮ A family of Newton-type iterative methods using some special self-accelerating parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New modification of Maheshwari's method with optimal eighth order convergence for solving nonlinear equations
• Interpolatory multipoint methods with memory for solving nonlinear equations
• Three-point methods with and without memory for solving nonlinear equations
• An optimal Steffensen-type family for solving nonlinear equations
• A new optimal eighth-order family of iterative methods for the solution of nonlinear equations
• A new class of three-point methods with optimal convergence order eight and its dynamics
• Three-step iterative methods with optimal eighth-order convergence
• Some efficient derivative free methods with memory for solving nonlinear equations
• Optimal Newton–Secant like methods without memory for solving nonlinear equations with its dynamics
• Mathematica®: A Problem-Centered Approach
• On a family of multipoint methods for non-linear equations
• 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
• A variant of Newton's method with accelerated third-order convergence

This page was built for publication: Solving nonlinear equations by a derivative-free form of the King's family with memory