The least squares problem and pseudo-inverses

Abstract

This paper presents a number of the most efficient mothods for computing the pseudo-inverse of an m × n matrix, developing them from a uniform standpoint. It shows that these are the natural extentions of the more common methods for inverting an n × n matrix.