Grassmann algorithms for low rank approximation of matrices with missing values

BIT Numerical Mathematics

Volumn 50, Issue 1, 2010, Pages 173-191

  Simonsson, Lennart ^a   Eldén, Lars ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Grassmann manifold; Least squares; Low rank approximation; Matrix; Missing values; Newton's method; Singular value decomposition

Indexed keywords

EID: 77349123227     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10543-010-0253-9     Document Type: Article

References (20)

1. Abadir, K., Magnus, J.: Matrix Algebra. Cambridge University Press, Cambridge (2005).
2. Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008).
3. Absil, P.-A., Ishteva, M., De Lathauwer, L., van Huffel, S.: A geometric Newton method for Oja's vector field. Neural Comput. 21(5), 1415-1433 (2009).
4. Bai, Z., Demmel, J., Dongarra, J., Ruhe, A., van der Vorst, H. (eds.): Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide. SIAM, Philadelphia (2000).
5. Deuflhard, P.: Newton Methods for Nonlinear Problems: Affine Invariance and Adaptive Algorithms. Springer, Berlin (2004).
6. do Carmo, M. P.: Riemannian Geometry. Birkhäuser, Boston (1992).
7. Eckart, G., Young, G.: The approximation of one matrix by another of lower rank. Psychometrica 1, 211-218 (1936).
8. Edelman, A., Arias, T., Smith, S. T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20, 303-353 (1999).
9. Geus, R.: The Jacobi-Davidson algorithm for solving large sparse symmetric eigenvalue problems with applications to the design of accelerator cavities. PhD Thesis, ETH Zurich (2002).
10. Golub, G. H., van Loan, C. F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996).
11. Grung, B., Manne, R.: Missing values in principal component analysis. Chemom. Intell. Lab. Syst. 42, 125-139 (1998).
12. Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference and Prediction. Springer, Berlin (2001).
13. Helmke, U., Moore, J. B.: Optimization and Dynamical Systems. Springer, London (1994).
14. Hochstenbach, M.: A Jacobi-Davidson type SVD method. SIAM J. Sci. Comput. 23, 606-628 (2001).
15. Horn, R., Johnson, C.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1991).
16. Lundström, E., Eldén, L.: Adaptive eigenvalue computations using Newton's method on the Grassmann manifold. SIAM J. Matrix Anal. Appl. 23, 819-839 (2002).
17. Manton, J. H.: Optimization algorithms exploiting unitary constraints. IEEE Trans. Signal Process. 50, 635-650 (2002).
18. Manton, J. H., Mahony, R., Hua, Y.: The geometry of weighted low-rank approximations. IEEE Trans. Signal Process. 51, 500-514 (2003).
19. Ruhe, A.: Numerical computation of principal components when several observations are missing, Tech. report, UMINF-48, Umeå (1974).
20. Simonsson, L.: Subspace computations via matrix decompositions and geometric optimization. PhD Thesis, Department of Mathematics, Linköping University (2006).