Abstract
Proof is given for a theorem stated but not proved by Eckart and Young in 1936, which has assumed considerable importance in the theory of lower-rank approximations to matrices, particularly in factor analysis.
Keywords
Rank (graph theory)MathematicsCalculus (dental)Mathematical economicsCombinatoricsOrthodonticsMedicine
Affiliated Institutions
Related Publications
The Approximation of One Matrix by Another of Lower Rank
The mathematical problem of approximating one matrix by another of lower rank is closely related to the fundamental postulate of factor-theory. When formulated as a least-square...
Efficient MATLAB Computations with Sparse and Factored Tensors
In this paper, the term tensor refers simply to a multidimensional or N-way array, and we consider how specially structured tensors allow for efficient storage and computation. ...
Decoding by Linear Programming
This paper considers a natural error correcting problem with real valued input/output. We wish to recover an input vector f/spl isin/R/sup n/ from corrupted measurements y=Af+e....
Tensor Decompositions and Applications
This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or N-way array. Decompositions...
Publication Info
- Year
- 1963
- Type
- article
- Volume
- 28
- Issue
- 3
- Pages
- 259-263
- Citations
- 105
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
105
OpenAlex
Cite This
Richard M. Johnson
(1963).
On a Theorem Stated by Eckart and Young.
Psychometrika
, 28
(3)
, 259-263.
https://doi.org/10.1007/bf02289573
Identifiers
- DOI
- 10.1007/bf02289573