A general three-step class of optimal iterations for nonlinear equations
Summary: Many of the engineering problems are reduced to solve a nonlinear equation numerically, and as a result, an especial attention to suggest efficient and accurate root solvers is given in literature. Inspired and motivated by the research going on in this area, this paper establishes an efficient general class of root solvers, where per computing step, three evaluations of the function and one evaluation of the first-order derivative are used to achieve the optimal order of convergence eight. The without-memory methods from the developed class possess the optimal efficiency index 1.682. In order to show the applicability and validity of the class, some numerical examples are discussed.
- scientific article; zbMATH DE number 5354887
- On the development and extensions of some classes of optimal three-point iterations for solving nonlinear equations
- Three-step iterative methods for nonlinear equations
- A note on some three-step iterative methods for nonlinear equations
- An efficient three-step iterative method for non-linear equations
- A note on three-step iterative method for nonlinear equations
- A class of iterative methods with third-order convergence to solve nonlinear equations
- Three-step iterative methods for solving nonlinear equations
- A new three-step iterative method for solving nonlinear equations
- One class of third-order iteration methods for solving nonlinear equations
- A new family of modified Ostrowski's methods with accelerated eighth order convergence
- A novel computational technique for finding simple roots of nonlinear equations
- Accurate fourteenth-order methods for solving nonlinear equations
- An improvement of Ostrowski's and King's techniques with optimal convergence order eight
- scientific article; zbMATH DE number 5896483 (Why is no real title available?)
- scientific article; zbMATH DE number 863531 (Why is no real title available?)
- Numerical stability test of neutral delay differential equations
- Optimal Order of One-Point and Multipoint Iteration
- Some families of two-step simultaneous methods for determining zeros of nonlinear equations
- Some new iterative methods for nonlinear equations
- A globally convergent variant of mid-point method for finding the matrix sign
- Some modifications of King's family with optimal eighth order of convergence
- Some iterative methods free from derivatives and their basins of attraction for nonlinear equations
- Two optimal general classes of iterative methods with eighth-order
- New iterative methods for finding matrix sign function: derivation and application
- Some matrix iterations for computing matrix sign function
- Optimal Steffensen-type methods with eighth order of convergence
- A class of three-step derivative-free root solvers with optimal convergence order
- Optimized Steffensen-type methods with eighth-order convergence and high efficiency index
- A new optimal eighth-order Ostrowski-type family of iterative methods for solving nonlinear equations
- Numerical solution of nonlinear equations by an optimal eighth-order class of iterative methods
- Novel computational iterative methods with optimal order for nonlinear equations
This page was built for publication: A general three-step class of optimal iterations for nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q410403)
