Hostname: page-component-745bb68f8f-lrblm Total loading time: 0 Render date: 2025-01-08T11:09:51.675Z Has data issue: false hasContentIssue false

Matrix Approximations and Subspace Fitting

Published online by Cambridge University Press:  01 January 2025

Gale Young*
Affiliation:
University of Chicago*

Abstract

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.

Type
Original Paper
Copyright
Copyright © 1937 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

*

The author is indebted to Prof. Carl Eckart of the Department of Physics, University of Chicago, for much helpful comment and suggestion. To him are due the example of the last section and various other items throughout.

References

Eckart, Car.and Young, Gal.The Approximation of One Matrix by Another of Lower Rank. Psychometrika, 1936, 1, 211218.CrossRefGoogle Scholar
Thurstone, L. L.The Vectors of Mind. Chicago: University of Chicago Press. 1935, 4950.Google Scholar
Thurstone, L. L.The Vectors of Mind. Chaper 4.Google Scholar