Parallelization of divide-and-conquer eigenvector accumulation

Lecture Notes in Computer Science

Volumn 3648, Issue , 2005, Pages 847-856

  Gansterer, Wilfried N ^a   Zottl, Joachim ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; EIGENVALUES AND EIGENFUNCTIONS; TREES (MATHEMATICS);

EIGENSOLVERS; EIGENVALUE ACCUMULATION PROCESS; PARALLELIZATION; TREE-STRUCTURED COMPUTATION;

PARALLEL PROCESSING SYSTEMS;

EID: 27144549925     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549468_92     Document Type: Conference Paper

References (11)

1. Tisseur, F., Dongarra, J.: A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures. SIAM J. Sci. Comput. 20 (1999) 2223-2236
2. Gansterer, W.N., Ward, R.C., P.Muller, R., Goddard, III, W.A.: Computing approximate eigenpairs of symmetric block tridiagonal matrices. SIAM J. Sci. Comput. 25 (2003) 65-85
3. Fox, G., Otto, S., Hey, A.: Matrix algorithms on a hypercube i: Matrix multiplication. Parallel Computing 4 (1987) 17-31
4. Choi, J., Dongarra, J.J., Walker, D.: Pumma: Parallel universal matrix multiplication algorithms on distributed memory concurrent computers. Concurrency: Practice and Experience 6 (1994) 543-570
5. van de Geijn, R.A., Watts, J.: Summa: Scalable universal matrix multiplication algorithm. Concurrency: Practice and Experience 9 (1997) 255-274
6. Choi, J.: A fast scalable universal matrix multiplication algorithm on distributed-memory concurrent computers. In: Proceedings of the 11th International Parallel Processing Symposium, IEEE Press (1997) 310-314
7. Gu, M., Eisenstat, S.C.: A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem. SIAM J. Matrix Anal. Appl. 15 (1994) 1266-1276
8. Gu, M., Eisenstat, S.C.: A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. 16 (1995) 172-191
9. Gansterer, W.N., Ward, R.C., Muller, R.P.: An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems. ACM Trans. Math. Softw. 28 (2002) 45-58
10. Gansterer, W.N., Zottl, J.: Message passing vs. virtual shared memory - a performance comparison. In Juhász, Z., Kacsuk, P., Kranzlmüller, D., eds.: Distributed and Parallel Systems: Cluster and Grid Computing. Volume 777 of The Kluwer International Series in Engineering and Computer Science. Springer-Verlag (2005) 39-46
11. Blackford, L.S., Choi, J., Cleary, A., D'Azevedo, E., Demmel, J., Dhillon, I., Dongarra, J., Hammarling, S., Henry, G., Petitet, A., Stanley, K., Walker, D., Whaley, R.C.: ScaLAPACK Users' Guide. Society for Industrial and Applied Mathematics (1997)