Constructing two-step iterative methods with and without memory
From MaRDI portal
Publication:2354433
DOI10.1134/S0965542515020189zbMath1318.65027OpenAlexW2048329410MaRDI QIDQ2354433
Fazlollah Soleymani, Katayoun Mahdiani, Taher Lotfi, Parisa Bakhtiari
Publication date: 13 July 2015
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542515020189
iterative methodsnonlinear equationcomputational efficiencynumerical comparison\(R\)-orderwithout memoryoptimal convergence orderwith memory
Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)
Related Items (7)
On developing a stable and quadratic convergent method for solving absolute value equation ⋮ Widening basins of attraction of optimal iterative methods ⋮ An efficient family of two-step with-memory methods with convergence order 6 and their dynamics ⋮ Constructing a high-order globally convergent iterative method for calculating the matrix sign function ⋮ Unnamed Item ⋮ Construction of fourth-order optimal families of iterative methods and their dynamics ⋮ A quartically convergent Jarratt-type method for nonlinear system of equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An iterative method for computing the approximate inverse of a square matrix and the Moore-Penrose inverse of a non-square matrix
- On the computation of weighted Moore-Penrose inverse using a high-order matrix method
- On generalized multipoint root-solvers with memory
- An accelerated iterative method for computing weighted Moore-Penrose inverse
- Editorial. Iterative methods for nonlinear equations or systems and their applications 2014
- On finding robust approximate inverses for large sparse matrices
- Mathematica®: A Problem-Centered Approach
- Optimal Order of One-Point and Multipoint Iteration
- A fast convergent iterative solver for approximate inverse of matrices
- On Some Multipoint Methods Arrising from Optimal in the Sense of Kung-Traub Algorithms for Numerical Solution of Nonlinear Equations
This page was built for publication: Constructing two-step iterative methods with and without memory