Computing generalized inverses using LU factorization of matrix product

Authors:
Predrag S. Stanimirovic;Milan B. Tasic
Affiliations:
Department of Mathematics, Faculty of Science, University of Nis, Nis, Serbia;Department of Mathematics, Faculty of Science, University of Nis, Nis, Serbia
Venue:
International Journal of Computer Mathematics
Year:
2008

Citing 7
Cited 2

Report on test matrices for generalized inverses

Computing
Generalised matrix inversion and rank computation by successive matrix powering

Parallel Computing
The computation and application of the generalized inverse via Maple

Journal of Symbolic Computation
The Mathematica book (4th edition)

The Mathematica book (4th edition)
Successive matrix squaring algorithm for computing the Drazin inverse

Applied Mathematics and Computation
A finite algorithm for the Drazin inverse of a polynomial matrix

Applied Mathematics and Computation
Straight monotonic embedding of data sets in Euclidean spaces

Neural Networks

Generalized matrix inversion is not harder than matrix multiplication

Journal of Computational and Applied Mathematics
A novel iterative method for computing generalized inverse

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm for computing {2, 3}, {2, 4}, {1, 2, 3}, {1, 2, 4} -inverses and the Moore-Penrose inverse of a given rational matrix A is established. Classes A{2, 3}s and A{2, 4}s are characterized in terms of matrix products (R*A)†R* and T*(AT*)†, where R and T are rational matrices with appropriate dimensions and corresponding rank. The proposed algorithm is based on these general representations and the Cholesky factorization of symmetric positive matrices. The algorithm is implemented in programming languages MATHEMATICA and DELPHI, and illustrated via examples. Numerical results of the algorithm, corres-ponding to the Moore-Penrose inverse, are compared with corresponding results obtained by several known methods for computing the Moore-Penrose inverse.