Numerical aspects of computing the Moore-Penrose inverse of full column rank matrices
The authors present a comparison of certain direct algorithms for computing the Moore-Penrose inverse, for matrices of full column rank, from the point of view of numerical stability. Their theoretical analysis is combined with reliable numerical experiments on Pascal and random matrices.
scientific article; zbMATH DE number 6062475
scientific article