Analysis of a class of continuous-time algorithms for principal component analysis and subspace tracking
From MaRDI portal
Publication:4505179
DOI10.1109/81.751309zbMath0952.94001OpenAlexW2163896430MaRDI QIDQ4505179
Jeroen Dehaene, Joos Vandewalle, Marc Moonen
Publication date: 26 September 2000
Published in: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/81.751309
singular value decompositionprincipal component analysisdiscrete-time algorithmcontinuous-time subspace tracking algorithms
Related Items (4)
Accuracy of the Kogbetliantz method for scaled diagonally dominant triangular matrices ⋮ On high relative accuracy of the Kogbetliantz method ⋮ A Geometric Newton Method for Oja's Vector Field ⋮ The Extrinsic Geometry of Dynamical Systems Tracking Nonlinear Matrix Projections
This page was built for publication: Analysis of a class of continuous-time algorithms for principal component analysis and subspace tracking