Matrix Approximations and Subspace Fitting

The problem of fitting a least-squares linear subspace to a higher dimensional set of points is solved by the use of matrix approximation results, both when the subspace is required to pass through a given point, and when it is not so restricted. In the latter case the subspace is shown to pass through the centroid of the point set. It is noted that the principal axes of the set of points enter into the problem in a natural manner.