Some optimal iterative methods and their with memory variants
From MaRDI portal
The paper concerns some optimal iterative methods for solving nonlinear equations. Based on some existing works, the author constructs a new method, which needs only 4 function evaluations per step and achieves the optimal 8th-order accuracy. This result is also proved rigorously. Furthermore, by carefully choosing the free parameter in the method, the author obtains a new method with memory and obtains a much better convergence rate, namely, order 10. Numerical results are presented to confirm the theoretical results.
Recommendations
- Constructing two-step iterative methods with and without memory
- Efficient \(n\)-point iterative methods with memory for solving nonlinear equations
- Novel computational iterative methods with optimal order for nonlinear equations
- Efficient four-parametric with-and-without-memory iterative methods possessing high efficiency indices
- An efficient class of multipoint root-solvers with and without memory for nonlinear equations
Cites work
- A variant of Steffensen's method of fourth-order convergence and its applications
- Computing simple roots by an optimal sixteenth-order class
- Construction of optimal derivative-free techniques without memory
- Construction of optimal order nonlinear solvers using inverse interpolation
- Fifth-order iterative method for finding multiple roots of nonlinear equations
- scientific article; zbMATH DE number 3009276 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Iterative methods based on the signum function approach for solving nonlinear equations
- Mathematica in action. Problem solving through visualization and computation. With CD-ROM.
- Novel computational iterative methods with optimal order for nonlinear equations
- Optimal Order of One-Point and Multipoint Iteration
- Optimal Steffensen-type methods with eighth order of convergence
- Steffensen type methods for solving nonlinear equations
- The Mathematica GuideBook for Numerics
- Two new classes of optimal Jarratt-type fourth-order methods
- Two optimal eighth-order derivative-free classes of iterative methods
- Variants of Steffensen-Secant method and applications
Cited in
(29)- Several two-point with memory iterative methods for solving nonlinear equations
- Several iterative methods with memory using self-accelerators
- Efficient four-parametric with-and-without-memory iterative methods possessing high efficiency indices
- New mono- and biaccelerator iterative methods with memory for nonlinear equations
- Dynamical techniques for analyzing iterative schemes with memory
- Family of multipoint with memory iterative schemes for solving nonlinear equations
- An improved optimal eighth-order iterative scheme with its dynamical behaviour
- On some iterative methods with memory and high efficiency index for solving nonlinear equations
- Constructing two-step iterative methods with and without memory
- Widening basins of attraction of optimal iterative methods
- A new family of adaptive methods with memory for solving nonlinear equations
- Potra-Pták iterative method with memory
- On the optimal choice of parameters in two-point iterative methods for solving nonlinear equations
- An efficient Steffensen-like iterative method with memory
- An efficient class of multipoint root-solvers with and without memory for nonlinear equations
- Optimal Newton-secant like methods without memory for solving nonlinear equations with its dynamics
- Optimal Iterative Methods for Nonlinear Equations
- On a numerical technique for finding multiple zeros and its dynamic
- A general class of one-parametric with memory method for solving nonlinear equations
- A dynamical comparison between iterative methods with memory: are the derivatives good for the memory?
- Improved bi-accelerator derivative free with memory family for solving nonlinear equations
- scientific article; zbMATH DE number 6176035 (Why is no real title available?)
- A two-step method adaptive with memory with eighth-order for solving nonlinear equations and its dynamic
- An efficient family of two-step with-memory methods with convergence order 6 and their dynamics
- Efficient family of three-step with-memory methods and their dynamics
- Novel computational iterative methods with optimal order for nonlinear equations
- On new computational local orders of convergence
- An efficient single-step bi-parametric Newton-type method with memory having \(R\)-order \(1 + \sqrt{3}\)
- On the construction of some tri-parametric iterative methods with memory
This page was built for publication: Some optimal iterative methods and their with memory variants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q392252)
