Constructing two-step iterative methods with and without memory
From MaRDI portal
Recommendations
- Efficient two-step derivative-free iterative methods with memory and their dynamics
- An efficient Steffensen-like iterative method with memory
- Extending the applicability of iterative methods free of derivatives by means of memory
- Some optimal iterative methods and their with memory variants
- Some efficient two-point iterative methods with memory for solving nonlinear equations
- Efficient iterative methods with and without memory possessing high efficiency indices
- Stability and applicability of iterative methods with memory
- Memory in the iterative processes for nonlinear problems
- Several two-point with memory iterative methods for solving nonlinear equations
- scientific article; zbMATH DE number 5051710
Cites work
- A fast convergent iterative solver for approximate inverse of matrices
- A note on the ``constructing of nonstationary methods for solving nonlinear equations with raised speed of convergence
- An accelerated iterative method for computing weighted Moore-Penrose inverse
- An iterative method for computing the approximate inverse of a square matrix and the Moore-Penrose inverse of a non-square matrix
- Editorial. Iterative methods for nonlinear equations or systems and their applications 2014
- scientific article; zbMATH DE number 5971429 (Why is no real title available?)
- scientific article; zbMATH DE number 3009276 (Why is no real title available?)
- scientific article; zbMATH DE number 2206803 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Mathematica®: A Problem-Centered Approach
- On finding robust approximate inverses for large sparse matrices
- On generalized multipoint root-solvers with memory
- On some multipoint methods arising from optimal in the sense of Kung-Traub algorithms
- On the computation of weighted Moore-Penrose inverse using a high-order matrix method
- Optimal Order of One-Point and Multipoint Iteration
Cited in
(15)- On developing a stable and quadratic convergent method for solving absolute value equation
- Efficient four-parametric with-and-without-memory iterative methods possessing high efficiency indices
- Constructing a high-order globally convergent iterative method for calculating the matrix sign function
- Construction of fourth-order optimal families of iterative methods and their dynamics
- A quartically convergent Jarratt-type method for nonlinear system of equations
- On some iterative methods with memory and high efficiency index for solving nonlinear equations
- Widening basins of attraction of optimal iterative methods
- Construction of tri-parametric derivative free fourth order with and without memory iterative method
- Some optimal iterative methods and their with memory variants
- Construction of iterative adaptive methods with memory with 100\% improvement of convergence order
- Design of iterative methods with memory for solving nonlinear systems
- An efficient family of two-step with-memory methods with convergence order 6 and their dynamics
- Introducing memory to a family of multi-step multidimensional iterative methods with weight function
- Novel computational iterative methods with optimal order for nonlinear equations
- Derivative free iterative methods with memory having higher R-order of convergence
This page was built for publication: Constructing two-step iterative methods with and without memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2354433)
