A fast computational algorithm for computing outer pseudo-inverses with numerical experiments

DOI10.1016/j.cam.2022.114128zbMath1485.65043OpenAlexW4210600441MaRDI QIDQ2668042

Akbar Shirilord, Mehdi Dehghan

Publication date: 3 March 2022

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2022.114128

zbMATH Keywords

convergence analysisiterative algorithmefficiency indexouter pseudo-inverses

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Hyper-power methods for the computation of outer inverses
• Finding generalized inverses by a fast and efficient numerical method
• On hyperpower family of iterations for computing outer inverses possessing high efficiencies
• On semi-convergence of Hermitian and skew-Hermitian splitting methods for singular linear systems
• Analytical and numerical aspects of certain nonlinear evolution equations. II. Numerical, nonlinear Schrödinger equation
• A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix
• Representation and approximate for generalized inverse \(A_{T,S}^{(2)}\): revisited
• Computational algorithms for computing the inverse of a square matrix, quasi-inverse of a non-square matrix and block matrices
• Numerical experiments with two approximate inverse preconditioners
• Iterative methods for the Drazin inverse of a matrix with a complex spectrum.
• Perturbation identities for regularized Tikhonov inverses and weighted pseudo- inverses
• Perturbation bounds for constrained and weighted least squares problems
• An improved computationally efficient method for finding the Drazin inverse
• An efficient computation of generalized inverse of a matrix
• Generalized inverses. Theory and applications.
• A class of numerical algorithms for computing outer inverses
• An improved Newton iteration for the weighted Moore-Penrose inverse
• Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices
• Regularized Computation of Approximate Pseudoinverse of Large Matrices Using Low-Rank Tensor Train Decompositions
• A new iterative method for computing the Drazin inverse
• An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
• An efficient quadratically convergent iterative method to find the Moore–Penrose inverse
• Generalized Inverses of Linear Transformations
• An Iterative Method for Computing the Generalized Inverse of an Arbitrary Matrix
• On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
• A geometrical approach on generalized inverses by Neumann-type series

This page was built for publication: A fast computational algorithm for computing outer pseudo-inverses with numerical experiments