Computing generalized inverses using LU factorization of matrix product

Details Computing generalized inverses using LU factorization of matrix product Computing generalized inverses using LU factorization of matrix product

2011-04-09

arxiv.org/abs/1104.1697v1

International Journal Of Computer Mathematics, Volume 85, Issue 12, 2008, Pages 1865 - 1878

Computer Science

Symbolic Computation

Scientific paper

10.1080/00207160701582077

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.

Affiliated with

Also associated with

No associations

Rating

Computing generalized inverses using LU factorization of matrix product does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing generalized inverses using LU factorization of matrix product, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing generalized inverses using LU factorization of matrix product will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-353316