Efficient iterative methods with and without memory possessing high efficiency indices
Summary: Two families of derivative-free methods without memory for approximating a simple zero of a nonlinear equation are presented. The proposed schemes have an accelerator parameter with the property that it can increase the convergence rate without any new functional evaluations. In this way, we construct a method with memory that increases considerably efficiency index from \(8^{1 / 4} \approx 1.681\) to \(1 2^{1 / 4} \approx 1.861\). Numerical examples and comparison with the existing methods are included to confirm theoretical results and high computational efficiency.
- Efficient four-parametric with-and-without-memory iterative methods possessing high efficiency indices
- Efficient two-step derivative-free iterative methods with memory and their dynamics
- Efficient \(n\)-point iterative methods with memory for solving nonlinear equations
- Some efficient two-point iterative methods with memory for solving nonlinear equations
- On some efficient derivative-free iterative methods with memory for solving systems of nonlinear equations
- An optimal family of fast 16th-order derivative-free multipoint simple-root finders for nonlinear equations
- An optimal Steffensen-type family for solving nonlinear equations
- Approximating the matrix sign function using a novel iterative method
- scientific article; zbMATH DE number 3827201 (Why is no real title available?)
- scientific article; zbMATH DE number 3537168 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Multipoint iterative methods for finding all the simple zeros in an interval
- On some multipoint methods arising from optimal in the sense of Kung-Traub algorithms
- Optimal Order of One-Point and Multipoint Iteration
- Some high-order iterative methods for finding all the real zeros
- Some matrix iterations for computing matrix sign function
- Two optimal eighth-order derivative-free classes of iterative methods
- A generalized Steffensen's method for matrix sign function
- Several iterative methods with memory using self-accelerators
- Efficient four-parametric with-and-without-memory iterative methods possessing high efficiency indices
- Two bi-accelerator improved with memory schemes for solving nonlinear equations
- On some iterative methods with memory and high efficiency index for solving nonlinear equations
- Constructing two-step iterative methods with and without memory
- Some new bi-accelerator two-point methods for solving nonlinear equations
- A variant of Steffensen-King's type family with accelerated sixth-order convergence and high efficiency index: dynamic study and approach
- Construction of iterative adaptive methods with memory with 100\% improvement of convergence order
- To the question of efficiency of iterative methods
- A general family of derivative free with and without memory root finding methods
This page was built for publication: Efficient iterative methods with and without memory possessing high efficiency indices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321541)
