A new algorithm for singular value decomposition and its parallelization

Parallel Computing

Volumn 35, Issue 6, 2009, Pages 331-344

  Konda, Taro ^a   Nakamura, Yoshimasa ^a,b  

^a KYOTO UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

Divide and Conquer; Eigenvalue decomposition; High performance computing; Singular value decomposition; Twisted factorization

Indexed keywords

BIDIAGONAL SVD; DIVIDE AND CONQUER; EIGENVALUE DECOMPOSITION; HIGH PERFORMANCE COMPUTING; PARALLELIZATION; SINGULAR VALUES; SINGULAR VECTORS; TWISTED FACTORIZATION; WORKING MEMORIES;

EIGENVALUES AND EIGENFUNCTIONS; FACTORIZATION; PARALLEL ALGORITHMS;

SINGULAR VALUE DECOMPOSITION;

EID: 67349215438     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2009.02.001     Document Type: Article

References (26)

1. Pratt W. Digital Image Processing (1991), John Wiley & Sons, New York
2. F. Jiang, R. Kannan, M. Littman, S. Vempala, Efficient Singular Value Decomposition Via Improved Document Sampling, Tech. Rep. CS-99-5, Department of Computer Science, Duke University, 1999.
3. Golub G., and Kahan W. Calculating the singular values and pseudo-inverse of a matrix. SIAM J. Numer. Anal. 2 2 (1965) 205-224
4. Demmel J. Applied Numerical Linear Algebra (1997), SIAM, Philadelphia
5. Dhillon I., and Parlett B. Orthogonal eigenvectors and relative gaps. SIAM J. Matrix Anal. Appl. 25 3 (2004) 858-899
6. Fernando K. On computing an eigenvector of a tridiagonal matrix. Part 1: basic results. SIAM J. Matrix Anal. Appl. 18 4 (1997) 1013-1034
7. Parlett B., and Dhillon I. Fernando's solution to Wilkinson's problem: an application of double factorization. Linear Algebra Appl. 267 (1997) 247-279
8. Iwasaki M., Sakano S., and Nakamura Y. Accurate twisted factorization of real symmetric tridiagonal matrices and its application to singular value decomposition. Trans. Jpn. Soc. Ind. Appl. Math. 15 3 (2005) 461-481
9. M. Takata, M. Iwasaki, K. Kimura, Y. Nakamura, An evaluation of singular value computation by the discrete Lotka-Volterra system, in: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, vol. 2, 2005, pp. 410-416.
10. Iwasaki M., and Nakamura Y. Accurate computation of singular values in terms of the shifted integrable schemes. Jpn. J. Ind. Appl. Math. 23 (2006) 239-259
11. T. Konda, M. Takata, M. Iwasaki, Y. Nakamura, A new singular value decomposition algorithm suited to parallelization and preliminary results, in: Proceedings of the IASTED International Conference on Advances in Computer Science and Technology, 2006, pp. 79-84.
12. Bientinesi P., Dhillon I., and Geijin R. A parallel eigensolver for dense symmetric matrices based on multiple relatively robust representations. SIAM J. Sci. Comput. 27 1 (2005) 43-66
13. Cuppen J. A divide and conquer method for the symmetric tridiagonal eigenproblem. Numer. Math. 36 (1981) 177-195
14. Gu M., and Eisenstat S. A stable and efficient algorithm for the rank-1 modification of the symmetric eigenproblem. SIAM J. Matrix Anal. Appl. 15 4 (1994) 1266-1276
15. Gu M., and Eisenstat S. A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. 16 1 (1995) 172-191
16. Jessup E., and Sorensen D. A parallel algorithm for computing the singular value decomposition of a matrix. SIAM J. Matrix Anal. Appl. 15 2 (1994) 530-548
17. Gu M., and Eisenstat S. A divide-and-conquer algorithm for the bidiagonal svd. SIAM J. Matrix Anal. Appl. 16 1 (1995) 79-92
18. M. Takata, T. Konda, K. Kimura, Y. Nakamura, Verification of dlvv transformation for singular vector computation with high accuracy, in: Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'06), 2006, pp. 881-887.
19. Y. Nakamura, M. Iwasaki, K. Kimura, M. Takata, Recent developments of the mdLVs algorithm for singular values and the I-SVD algorithm for singular value decomposition, Fast Algorithms in Computational Fluids: Theory and Applications, RIMS Kyokuroku, Kyoto University, vol. 1606, 2008, pp. 87-104.
20. Peters G., and Wilkinson J.H. The calculation of specified eigenvectors by inverse iteration, contribution II/18. Handbook for Automatic Computation vol. 2 (1971), Springer-Verlag, Berlin
21. Demmel J., and Kahan W. Accurate singular values of bidiagonal matrices. SIAM J. Sci. Statist. Computing 11 5 (1990) 873-912
22. Gropp W., Lusk E., and Skjellum A. Using MPI. second ed. (1999), The MIT Press, Cambridge
23. Katayama M., Kimura K., Takata M., Tsuboi H., Iwasaki M., and Nakamura Y. Improvement of computation of left singular vectors by the I-SVD algorithm for singular value decomposition. Trans. Jpn. Soc. Indt. Appl. Math. 18 3 (2008) 389-407
24. Anderson E., Bischof Z., Demmel J., Dongarra J., Croz J.D., Greenbaum A., Hammarling S., McKenney A., Ostrouchov S., and Sorensen D. LAPACK User's Guide. second ed. (1995), SIAM, Philadelphia
25. Blackford L., Choi J., Cleary A., et al. ScaLAPACK Users' Guide (1997), SIAM, Philadelphia
26. Tisseur F., and Dongarra J. A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architecutures. SIAM J. Sci. Comput. 20 6 (1999) 2223-2236