Wolfram Library Archive

Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings

Computing generalized inverses using LU factorization of matrix product

Predrag S. Stanimirovi´c
Milan B. Tasi´c
Organization: University of Nis
Department: Faculty of Sciences and Mathematics
Journal / Anthology

International Journal of Computer Mathematics
Year: 2008
Volume: 85
Issue: 2
Page range: 1865-1878

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, corresponding to the Moore–Penrose inverse, are compared with corresponding results obtained by several known methods for computing the Moore–Penrose inverse.


cholesky factorizations, generalized inverses, Moore–Penrose inverse, MATHEMATICA, DELPHI