Some efficient derivative free methods with memory for solving nonlinear equations
From MaRDI portal
Publication:2445222
DOI10.1016/j.amc.2012.06.062zbMath1302.65133OpenAlexW2051620048MaRDI QIDQ2445222
Rangan Kumar Guha, Janak Raj Sharma, Puneet Kumar Gupta
Publication date: 14 April 2014
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.06.062
nonlinear equationscomputational efficiencyacceleration of convergence\(R\)-order of convergencemultipoint iterative methodsderivative free methodsmethods with memory
Related Items (18)
An efficient derivative free family of fourth order methods for solving systems of nonlinear equations ⋮ Solving nonlinear equations by a derivative-free form of the King's family with memory ⋮ An efficient class of multipoint root-solvers with and without memory for nonlinear equations ⋮ A new accelerating technique applied to a variant of Cordero-Torregrosa method ⋮ An Ostrowski-type method with memory using a novel self-accelerating parameter ⋮ A new family of adaptive methods with memory for solving nonlinear equations ⋮ Developing a new family of Newton-Secant method with memory based on a weight function ⋮ On the construction of some tri-parametric iterative methods with memory ⋮ New mono- and biaccelerator iterative methods with memory for nonlinear equations ⋮ Derivative free iterative methods with memory of arbitrary high convergence order ⋮ 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 ⋮ On some iterative methods with memory and high efficiency index for solving nonlinear equations ⋮ An efficient family of Traub-Steffensen-type methods for solving systems of nonlinear equations ⋮ A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations ⋮ Families of optimal derivative-free two- and three-point iterative methods for solving nonlinear equations ⋮ Creating a new two-step recursive memory method with eight-order based on Kung and Traub’s method ⋮ A family of Newton-type iterative methods using some special self-accelerating parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generalized multipoint root-solvers with memory
- Three-point methods with and without memory for solving nonlinear equations
- Remarks on “On a General Class of Multipoint Root-Finding Methods of High Computational Efficiency”
- Optimal Order of One-Point and Multipoint Iteration
- A family of two-point methods with memory for solving nonlinear equations
This page was built for publication: Some efficient derivative free methods with memory for solving nonlinear equations
