New eighth-order iterative methods for solving nonlinear equations
From MaRDI portal
Publication:972772
DOI10.1016/j.cam.2010.03.002zbMath1190.65081MaRDI QIDQ972772
Publication date: 21 May 2010
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.2010.03.002
numerical examples; iterative methods; nonlinear equations; convergence order; efficiency index; weight function methods
65H05: Numerical computation of solutions to single equations
65Y20: Complexity and performance of numerical algorithms
Related Items
Unnamed Item, An Optimal Eighth-Order Scheme for Multiple Zeros of Univariate Functions, On the new family of optimal eighth order methods developed by Lotfi et al., A family of three-point methods of Ostrowski's type for solving nonlinear equations, A class of three-step derivative-free root solvers with optimal convergence order, Interpolatory multipoint methods with memory for solving nonlinear equations, Three-point methods with and without memory for solving nonlinear equations, Numerical solution of nonlinear equations by an optimal eighth-order class of iterative methods, Multipoint methods for solving nonlinear equations: a survey, Comparative study of eighth-order methods for finding simple roots of nonlinear equations, A family of optimal three-point methods for solving nonlinear equations using two parametric functions, Regarding the accuracy of optimal eighth-order methods, On the similarity of some three-point methods for solving nonlinear equations, Third order derivative free SPH iterative method for solving nonlinear systems, Increasing the convergence order of an iterative method for nonlinear systems, Necessary and sufficient conditions for the convergence of two- and three-point Newton-type iterations, Optimal eighth order convergent iteration scheme based on Lagrange interpolation, Efficient four-parametric with-and-without-memory iterative methods possessing high efficiency indices, Generating function method for constructing new iterations, Multistep high-order methods for nonlinear equations using Padé-like approximants, A modified Brent's method for finding zeros of functions, Computing simple roots by an optimal sixteenth-order class, On an efficient family of derivative free three-point methods for solving nonlinear equations, A new class of three-point methods with optimal convergence order eight and its dynamics, Families of optimal derivative-free two- and three-point iterative methods for solving nonlinear equations, An optimal three-point eighth-order iterative method without memory for solving nonlinear equations with its dynamics, Optimal Steffensen-type methods with eighth order of convergence, A NEW APPROACH FOR CONVERGENCE ACCELERATION OF ITERATIVE METHODS IN STRUCTURAL ANALYSIS, Optimal Newton–Secant like methods without memory for solving nonlinear equations with its dynamics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A family of three-point methods of optimal order for solving nonlinear equations
- Some sixth-order variants of Ostrowski root-finding methods
- Three-step iterative methods with eighth-order convergence for solving nonlinear equations
- Two new families of sixth-order methods for solving nonlinear equations
- A new family of eighth-order iterative methods for solving nonlinear equations
- Some variants of Ostrowski's method with seventh-order convergence
- A non-iterative method for solving non-linear equations
- Sigmoid-like functions and root finding methods
- On a General Class of Multipoint Root-Finding Methods of High Computational Efficiency
- Optimal Order of One-Point and Multipoint Iteration
- A variant of Newton's method with accelerated third-order convergence
