Error-free computation of a reflesive generalized inverse

The paper develops a method from which algorithms can be constructed to numerically compute an error-free reflexive generalized inverse of a matrix having rational entries. Multiple-modulus residue arithmetic is used to avoid error that is inherent in floating-point arithmetic. Some properties of finite fields of characteristic p, GF(p), are used to find nonsingular minors of the matrix over the field of rational numbers.