Abstract
A descent procedure is proposed for the search of low-dimensional subspaces of a high-dimensional space that satisfy an optimality criterion. Specifically, the procedure is applied to finding the subspace spanned by the first m singular components of an n-dimensional dataset. The procedure minimizes the associated cost function through a series of orthogonal transformations, each represented economically as the exponential of a skew-symmetric matrix drawn from a low-dimensional space.
Original language | English (US) |
---|---|
Pages (from-to) | 162-175 |
Number of pages | 14 |
Journal | Journal of Computational Physics |
Volume | 267 |
DOIs | |
State | Published - Jun 15 2014 |
Keywords
- Principal component analysis
ASJC Scopus subject areas
- Numerical Analysis
- Modeling and Simulation
- Physics and Astronomy (miscellaneous)
- General Physics and Astronomy
- Computer Science Applications
- Computational Mathematics
- Applied Mathematics