A new singular value decomposition algorithm suited to parallelization and preliminary results

Proceedings of the Seventh IASTED International Conference on Advances in Computer Science and Technology

Volumn , Issue , 2006, Pages 79-84

  Konda, Taro ^c   Takata, Masami ^c   Iwasaki, Masashi ^c   Nakamura, Yoshimasa ^a,b  

^a KYOTO UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^c NONE

Author keywords

High performance computing; Integrable system; Numerical algorithm; Numerical analysis; Parallelization; Singular value decomposition

Indexed keywords

HIGH PERFORMANCE COMPUTING; INTEGRABLE SYSTEMS; NUMERICAL ALGORITHMS; PARALLELIZATION; SINGULAR VALUE DECOMPOSITION;

COMPUTATIONAL METHODS; NUMERICAL METHODS; VECTORS;

PARALLEL ALGORITHMS;

EID: 33847213934     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. W. K. Pratt, Digital, image processing (Wiley-Interscience Publishing, 1978).
2. F. Jiang, R. Kalman, M. L. Littman, and S. Vempala, Efficient singular value decomposition via improved document sampling, Technical Report CS-99-5, Department of Computer Science, Duke University, 1999.
3. M. Iwasaki, S. Sakano, and Y.nakamura, Accurate twisted factorization of real symmetric tridiagonal matrices and its application to singular value decomposition (in Japanese), Trans. Japan. Soc. Indust. Appl. Math., 15(3), 2005, 461-481.
4. M. Iwasaki, Studies of Singular Value Decomposition in Terms of Integrable Systems, PhD thesis, Kyoto University, 2004.
5. M. Takata, M. Iwasaki, K. Kimura, and Y. Nakamura, An evaluation of singular value computation by the discrete lotka-volterra system, Proc. International Conf. on Parallel and Distributed Processing Techniques and Applications, Las Vegas, USA, 2005, 410-416.
6. E. Anderson, Z. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorensen, LAPACK User's Guide Second Edition (SIAM, 1995).
7. M. Iwasaki and Y. Nakamura, Accurate computation of singular values in terms of the shifted integrable scheme, submitted to Japan J. Indust. Appl. Math., 2005.
8. I.S. Dhillon and B.N. Parlett, Orthogonal eigenvectors and relative gaps, SIAM J. Matrix Anal. Appl., 25(3), 2004, 858-899.
9. K. V. Fernando, On computing an eigenvector of a tridiago-nal matrix, part 1: basic results, SIAM J. Matrix. Anal. Appl., 18(4), 1997, 1013-1034.
10. B.N. Parlett and I.S. Dhillon, Fernando's solution to wilkinson's problem: An application of double factorization, Lin. Alg. Appl., 267, 1997, 247-279.
11. K. V. Fernando and B. N. Parlett, Accurate singular values and differential qd algorithms, Numerische Mathematik, 67, 1994, 191-229.
12. B. Codenotti and M. Leoncini, Parallel Complexity of Linear System Solution (World Scientific, 1991).
13. B. N. Parlett, The new qd algorithms, Acta Numerica, 1995, 459-491.
14. R. Mathias, The instability of parallel prefix matrix multiplication, preprint, 1997.
15. T. Konda, M. Takata, M. Iwasaki, and Y. Nakamura, A parallelization of singular value computation algorithm by the lotka-volterra system (in Japanese), Technical report, IPSJ SIG HPC, 2004.
16. G. Golub and W. Kahan, Calculating the singular values and pseudo-inverse of a matrix, SIAM J. Numeri. Anal., 2(2), 1965, 205-224.
17. J. Demmel, Applied Numerical Linear Algebra (SIAM, 1997).
18. M. Iwasaki and Y. Nakamura, On the convergence of a solution of the discrete Lotka-Volterra system, Inverse Problems, 18(6), 2002, 1569-78.
19. P. Henrici, Applied and Computational Complex Analysis (Wiley-Interscience Publishing, 1988), volume 1.
20. C.R. Johnson, A gersgorin-type lower bound for the smallest singular value, Lin. Alg. Appl., 112, 1989, 1-7.
21. P. S. Pacheco, Parallel Programming with MPI (Morgan Kaufmann Publishers, 1997).
22. J. J. M. Cuppen, A divide and conquer method for the symmetric tridiagonal eigenproblem, Numerische Matheamtik, 36, 1997, 177-195.
23. M. Gu and S. C. Eisenstat, A stable and efficient algorithm for the rank-1 modification of the symmetric eigenproblem, SIAM J. Matrix Anal. Appl., 15(4), 1994, 1266-1276.
24. M. Gu and S. C. Eisenstat, A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem, SIAM J. Matrix Anal. Appl., 16(1), 1995, 172-191.
25. E. R. Jessup and D. C. Sorensen, A parallel algorithm for computing the singular value decomposition of a matrix, SIAM J. Matrix Anal. Appl., 15(2), 1994, 530-548.
26. M. Gu and S. C. Eisenstat, A divide-and-conquer algorithm for the bidiagonal svd, SIAM J. Matrix Anal. Appl., 16(1), 1995, 79-92.
27. R. C. Whaley, A. Petitet, and J. J. Dongarra, Automated empirical optimizations of software and the atlas project, Parallel Computiing, 27(1-2), 2001, 3-35.
28. W. Gropp, E. Lusk, and A. Skjellum, Using MPI Second Edition (The MIT Press, 1999).
29. L. S. Blackford, J. Choi, A. Cleary, E. D'Azevedo, J. Demmel, I. Dhillon, J. Dongarra, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, and R.C. Whaley, ScaLA-PACK Users' Guide (SIAM, 1997).