Computing generalized inverses using LU factorization of matrix product

From MaRDI portal
Publication:3545676

DOI10.1080/00207160701582077zbMATH Open1158.65029arXiv1104.1697OpenAlexW1766302165MaRDI QIDQ3545676FDOQ3545676

Predrag S. Stanimirović, Milan B. Tasić

Publication date: 11 December 2008

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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


Full work available at URL: https://arxiv.org/abs/1104.1697





Cites Work


Cited In (19)

Uses Software


   Recommendations





This page was built for publication: Computing generalized inverses using LU factorization of matrix product

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545676)