文摘
An efficient algorithm, based on the factorization, for computing and inverses and the Moore¨CPenrose inverse of a given rational matrix , is developed. We consider matrix products and and corresponding factorizations in order to compute the generalized inverse of . By considering the matrix products and , where and are arbitrary rational matrices with appropriate dimensions and ranks, we characterize classes and . Some evaluation times for our algorithm are compared with corresponding times for several known algorithms for computing the Moore¨CPenrose inverse.