Matrix-free Krylov iteration for implicit convolution of numerically low-rank data
- 1 December 2016
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 308, 98-116
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Angles between subspaces and their tangentsJournal of Numerical Mathematics, 2013
- Lanczos Vectors versus Singular Vectors for Effective Dimension ReductionIEEE Transactions on Knowledge and Data Engineering, 2008
- A Krylov Subspace Method for Information RetrievalSIAM Journal on Matrix Analysis and Applications, 2004
- PROPER ORTHOGONAL DECOMPOSITION AND ITS APPLICATIONS—PART I: THEORYJournal of Sound and Vibration, 2002
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with ApplicationsSIAM Journal on Scientific Computing, 2000
- Subspace-based signal analysis using singular value decompositionProceedings of the IEEE, 1993
- Eigenfaces for RecognitionJournal of Cognitive Neuroscience, 1991
- Indexing by latent semantic analysisJournal of the American Society for Information Science, 1990
- On the Rates of Convergence of the Lanczos and the Block-Lanczos MethodsSIAM Journal on Numerical Analysis, 1980
- Calculating the Singular Values and Pseudo-Inverse of a MatrixJournal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, 1965