Efficient \(n\)-point iterative methods with memory for solving nonlinear equations
From MaRDI portal
Publication:747735
DOI10.1007/s11075-014-9951-8zbMath1328.65117OpenAlexW2078532150MaRDI QIDQ747735
Publication date: 19 October 2015
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-014-9951-8
nonlinear equationscomputational efficiencyroot-finding methodsconvergence ordernumerical resultderivative-freemultipoint iterative methods
Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)
Related Items (15)
On modified two-step iterative method in the fractional sense: some applications in real world phenomena ⋮ A new accelerating technique applied to a variant of Cordero-Torregrosa method ⋮ An Ostrowski-type method with memory using a novel self-accelerating parameter ⋮ On general families of multipoint iterations by inverse interpolation and their applications ⋮ Ball convergence analysis of Jarratt-type sixth-order method and its applications in solving some chemical problems ⋮ Efficient four-parametric with-and-without-memory iterative methods possessing high efficiency indices ⋮ A multidimensional dynamical approach to iterative methods with memory ⋮ A super-fast tri-parametric iterative method with memory ⋮ An optimal biparametric multipoint family and its self-acceleration with memory for solving nonlinear equations ⋮ A dynamical comparison between iterative methods with memory: are the derivatives good for the memory? ⋮ Stability of King's family of iterative methods with memory ⋮ Dynamical techniques for analyzing iterative schemes with memory ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A family of Newton-type iterative methods using some special self-accelerating parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generalized multipoint root-solvers with memory
- 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
- Derivative free two-point methods with and without memory for solving nonlinear equations
- A new sixth-order scheme for nonlinear equations
- Some eighth-order root-finding three-step methods
- A family of three-point methods of optimal order for solving nonlinear equations
- Three-step iterative methods with eighth-order convergence for solving nonlinear equations
- A class of two-step Steffensen type methods with fourth-order convergence
- Iterative methods based on the signum function approach for solving nonlinear equations
- A family of Steffensen type methods with seventh-order convergence
- A new family of Newton-type iterative methods with and without memory for solving nonlinear equations
- On an efficient family of derivative free three-point methods for solving nonlinear equations
- On generalized biparametric multipoint root finding methods with memory
- Variants of Newton's method using fifth-order quadrature formulas
- On efficient two-parameter methods for solving nonlinear equations
- Optimal Steffensen-type methods with eighth order of convergence
- SOME NEWTON-TYPE ITERATIVE METHODS WITH AND WITHOUT MEMORY FOR SOLVING NONLINEAR EQUATIONS
- On a General Class of Multipoint Root-Finding Methods of High Computational Efficiency
- A new family of higher order methods for solving equations
- Optimal Order of One-Point and Multipoint Iteration
- A new family of modified Ostrowski's methods with accelerated eighth order convergence
This page was built for publication: Efficient \(n\)-point iterative methods with memory for solving nonlinear equations
