Low-rank approximations with sparse factors II: Penalized methods with discrete Newton-like iterations

SIAM Journal on Matrix Analysis and Applications

Volumn 25, Issue 4, 2004, Pages 901-920

  Zhang, Zhenyue ^a   Zha, Hongyuan ^b   Simon, Horst ^c  

^a ZHEJIANG UNIVERSITY   (China)

^b The Pennsylvania State University   (United States)

^c LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

Low rank matrix approximation; Perturbation analysis; Singular value decomposition; Sparse factorization

Indexed keywords

EID: 8344290401     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479801394477     Document Type: Article

References (7)

1. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
2. T. G. KOLDA AND D. P. O'LEARY, A semidiscrete matrix decomposition for latent semantic indexing in information retrieval, ACM Trans. Inform. Systems, 16 (1998), pp. 322-346.
3. T. G. KOLDA AND D. P. O'LEARY, Algorithm 805: Computation and uses of the semidiscrete matrix decomposition, ACM Trans. Math. Software, 26 (2000), pp. 416-437.
4. D. P. O'LEARY AND S. PELEG, Digital image compression by outer product expansion, IEEE Trans. Commun., 31 (1983), pp. 441-444.
5. H. D. SIMON AND H. ZHA, Low-rank matrix approximation using the Lanczos bidiagonalization process with applications, SIAM J. Sci. Comput., 21 (2000), pp. 2257-2274.
6. G. W. STEWART, Four algorithms for the efficient computation of truncated pivoted QR approximation to a sparse matrix, Numer. Math., 83 (1999), pp. 313-323.
7. Z. ZHANG, H. ZHA, AND H. SIMON, Low-rank approximations with sparse factors I: Basic algorithms and error analysis, SIAM J. Matrix Anal. Appl., 23 (2002). pp. 706-727.