Low-rank matrix approximation using the Lanczos bidiagonalization process with applications

SIAM Journal on Scientific Computing

Volumn 21, Issue 6, 2000, Pages 2257-2274

  Simon, Horst D ^a   Zha, Hongyuan ^b  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LANCZOS ALGORITHMS; LANCZOS BIDIAGONALIZATION PROCESS; LOW RANK APPROXIMATION; SINGULAR VALUE DECOMPOSITION; SPACE MATRICES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; IMAGE COMPRESSION; INFORMATION RETRIEVAL; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; VECTORS;

APPROXIMATION THEORY;

EID: 0034510473     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827597327309     Document Type: Article

References (24)

1. M. BERRY, Large scale singular value computations. Internat. J. Supercomputer Applications, 6 (1992), pp. 13-49.
2. Cornell SMART System, ftp://ftp.cs.cornell.edu/pub/smart.
3. J. CULLUM, R. A. WILLOUGHBY, AND M. LAKE, A Lanczos algorithm for computing singular values and vectors of large matrices, SIAM J. Sci. Statist. Comput., 4 (1983), pp. 197-215.
4. P. GELADI AND H. GRAHN, Multivariate Image Analysis, John Wiley, New York, 1996.
5. G. GOLUB AND W. KAHAN, Calculating the singular values and pseudo-inverse of a matrix, SIAM J. Numer. Anal., 2 (1965), pp. 205-224.
6. G. H. GOLUB, F. LUK, AND M. OVERTON, A block Lanczos method for computing the singular values and corresponding singular vectors of a matrix, ACM Trans. Math. Software, 7 (1981), pp. 149-169.
7. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, MD, 1989.
8. J. GRCAR, Analysis of the Lanczos Algorithm and of Approximation Problem in Richardson's Method, Ph.D. thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, 1981.
9. P. C. HANSEN, Truncated singular value decomposition solutions to discrete ill-posed problems with ill-determined numerical rank, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 503-518.
10. D. HARMAN, TREC-3 Conference Report, NIST Special Publication 500-225, 1995.
11. Matrix Market, http://math.nist.gov/MatrixMarket/.
12. MultiSpec, http://dynamo.ecn.purdue.edu/~biehl/MultiSpec/documentation.html.
13. A. O'TOOLE, H. ABDI, K. A. DEFPENBACHER, AND D. VALENTIN, Low-dimensional representation of faces in higher dimensions of the face space, J. Amer. Optical Soc., 10 (1993), pp. 405-411.
14. C. C. PAIGE, Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix, J. Inst. Math. Appl., 18 (1976), pp. 341-349.
15. C. C. PAIGE AND M. A. SAUNDERS, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software, 8 (1982), pp. 43-71.
16. B. N. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
17. A. PETLAND, R. W. PICARD, AND S. SCLAROFF, Photobook: Content-based manipulation of image databases, Internat. J. Comput. Vision, 18 (1996), pp. 233-254.
18. H. D. SIMON, The Lanczos Algorithm for Solving Symmetric Linear Systems, Ph.D. dissertation, Department of Mathematics, University of California, Berkeley, CA, 1982.
19. H. D. SIMON, Analysis for the symmetric Lanczos algorithm with reorthogonalization, Linear Algebra Appl., 61 (1984), pp. 101-131.
20. H. D. SIMON, The Lanczos algorithm with partial reorthogonalization, Math. Comp., 42 (1984), pp. 115-142.
21. H. D. SIMON AND H. ZHA, Low Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications, Technical report CSE-97-008, Department of Computer Science and Engineering, The Pennsylvania State University, State College, PA, 1997.
22. SVDPACK, http://www.netlib.org/svdpack/index.html.
23. N. E. TROJE AND T. VETTER, Representation of human faces, Technical report 41, Max-Planck-Institute für biologische Kybernetik, Tübingen, Germany, 1996.
24. M. TURK AND A. PENTLAND, Eigenfaces for recognition, J. Cognitive Neuroscience, 3 (1991), pp. 71-86.