Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\)

DOI10.1007/s13398-019-00696-3zbMath1436.65045OpenAlexW2947234605MaRDI QIDQ2331707

Predrag S. Stanimirović, Vasilios N. Katsikis, Ashim Kumar

Publication date: 30 October 2019

Published in: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13398-019-00696-3

zbMATH Keywords

computational complexityMoore-Penrose inverseorder of convergencehyperpower methodgeneralized outer inverse

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09)

Related Items (3)

Exploiting higher computational efficiency index for computing outer generalized inverses ⋮ A general class of arbitrary order iterative methods for computing generalized inverses ⋮ Generalization of the Moore-Penrose inverse

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computation of weighted Moore-Penrose inverse using a high-order matrix method
• Hyper-power methods for the computation of outer inverses
• On hyperpower family of iterations for computing outer inverses possessing high efficiencies
• An efficient matrix iteration for computing weighted Moore-Penrose inverse
• Projection matrices, generalized inverse matrices, and singular value decomposition.
• 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
• The \(\{\) 2\(\}\)-inverse with applications in statistics
• The block independence in the generalized inverse \(A_{T,S}(2)\) for some ordered matrices and applications
• Generalized inverses. Theory and applications.
• A family of iterative methods for computing Moore-Penrose inverse of a matrix
• A class of numerical algorithms for computing outer inverses
• A class of Kung-Traub-type iterative algorithms for matrix inversion
• A high-order iterate method for computing \(A_{T, S}^{(2)}\)
• Rank equalities related to the generalized inverse \(A^{(2)}_{T,S}\) with applications
• Successive matrix squaring algorithm for computing outer inverses
• Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices
• On finding robust approximate inverses for large sparse matrices
• An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
• Stability of Methods for Matrix Inversion
• Optimal iterative schemes for computing the Moore-Penrose matrix inverse
• Accuracy and Stability of Numerical Algorithms
• On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
• The Mathematica GuideBook for Numerics
• A geometrical approach on generalized inverses by Neumann-type series

This page was built for publication: Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\)