A new iterative method for finding approximate inverses of complex matrices

DOI10.1155/2014/563787zbMath1474.65077OpenAlexW2126326770WikidataQ59039461 ScholiaQ59039461MaRDI QIDQ1724392

Stanford Shateyi, Asghar Kerayechian, Mostafa Kafaei Razavi, Morteza Gachpazan

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/563787

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items

GIBS: a general and efficient iterative method for computing the approximate inverse and Moore–Penrose inverse of sparse matrices based on the Schultz iterative method with applications ⋮ A new spectral element method for numerical solution of partial differential equations on annular-type regions ⋮ A general class of arbitrary order iterative methods for computing generalized inverses

Uses Software

• Mathematica

Cites Work

• 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
• Iterative inversion of structured matrices
• Chebyshev-type methods and preconditioning techniques
• A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
• On the extension of Householder's method for weighted Moore-Penrose inverse
• Generalized inverses. Theory and applications.
• Preconditioning techniques for large linear systems: A survey
• A family of iterative methods for computing Moore-Penrose inverse of a matrix
• An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
• A fast convergent iterative solver for approximate inverse of matrices