Parallel Arnoldi eigensolvers with enhanced scalability via global communications rearrangement

Parallel Computing

Volumn 33, Issue 7-8, 2007, Pages 521-540

  Hernandez, V ^a   Roman, J E ^a   Tomas, A ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Arnoldi eigensolvers; Distributed memory programming; Iterative Gram Schmidt orthogonalization

Indexed keywords

GLOBAL COMMUNICATIONS; NONSYMMETRIC MATRIX; ORTHOGONALIZATION; PARALLEL ARNOLDI EIGENSOLVERS;

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS; MATRIX ALGEBRA; PROGRAM PROCESSORS; VECTORS;

PARALLEL PROCESSING SYSTEMS;

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

References (35)

1. Arnoldi W.E. The principle of minimized iterations in the solution of the matrix eigenvalue problem. Quart. Appl. Math. 9 (1951) 17-29
2. Saad Y. Variations of Arnoldi's method for computing eigenelements of large unsymmetric matrices. Linear Algebra Appl. 34 (1980) 269-295
3. Saad Y. Numerical solution of large nonsymmetric eigenvalue problems. Comput. Phys. Commun. 53 (1989) 71-90
4. Lanczos C. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Stand. 45 (1950) 255-282
5. Parlett B.N., Taylor D.R., and Liu Z.A. A look-ahead Lánczos algorithm for unsymmetric matrices. Math. Comp. 44 169 (1985) 105-124
6. Day D. An efficient implementation of the nonsymmetric Lanczos algorithm. SIAM J. Matrix Anal. Appl. 18 3 (1997) 566-589
7. Morgan R.B. On restarting the Arnoldi method for large nonsymmetric eigenvalue problems. Math. Comp. 65 (1996) 1213-1230
8. Hernandez V., Roman J.E., and Vidal V. SLEPc: a scalable and flexible toolkit for the solution of eigenvalue problems. ACM Trans. Math. Software 31 3 (2005) 351-362
9. V. Hernandez, J.E. Roman, A. Tomas, V. Vidal, SLEPc users manual, Tech. Rep. DSIC-II/24/02 - Revision 2.3.1, D. Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, available from: http://www.grycap.upv.es/slepc, 2006.
10. S. Balay, K. Buschelman, W. Gropp, D. Kaushik, M. Knepley, L.C. McInnes, B. Smith, H. Zhang, PETSc users manual, Tech. Rep. ANL-95/11 - Revision 2.3.1, Argonne National Laboratory, 2006.
11. Canning A., Wang L.W., Williamson A., and Zunger A. Parallel empirical pseudopotential electronic structure calculations for million atom systems. J. Comput. Phys. 160 1 (2000) 29-41
12. Bai Z., Hu D., and Reichel L. A Newton basis GMRES implementation. IMA J. Numer. Anal. 14 (1994) 563-581
13. Sidje R.B. Alternatives for parallel Krylov subspace basis computation. Numer. Linear Algebra Appl. 4 4 (1997) 305-331
14. de Sturler E., and van der Vorst H.A. Reducing the effect of global communication in GMRES(m) and CG on parallel distributed memory computers. App. Numer. Math. 18 4 (1995) 441-459
15. Erhel J. A parallel GMRES version for general sparse matrices. Electron. Trans. Numer. Anal. 3 (1995) 160-176
16. Stathopoulos A., and Wu K. A block orthogonalization procedure with constant synchronization requirements. SIAM J. Sci. Comput. 23 6 (2002) 2165-2182
17. Li G. A block variant of the GMRES method on massively parallel processors. Parallel Comput. 23 8 (1997) 1005-1019
18. Walker H.F. Implementation of the GMRES method using Householder transformations. SIAM J. Sci. Statist. Comput. 9 (1988) 152-163
19. Frank J., and Vuik C. Parallel implementation of a multiblock method with approximate subdomain solution. App. Numer. Math. 30 4 (1999) 403-423
20. V. Hernandez, J.E. Roman, A. Tomas, V. Vidal, Orthogonalization routines in SLEPc, Tech. Rep. STR-1, available from: http://www.grycap.upv.es/slepc/documentation/reports/str1.pdf, 2006.
21. Braconnier T., Langlois P., and Rioual J.C. The influence of orthogonality on the Arnoldi method. Linear Algebra Appl. 309 1-3 (2000) 307-323
22. Daniel J.W., Gragg W.B., Kaufman L., and Stewart G.W. Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comp. 30 136 (1976) 772-795
23. Hoffmann W. Iterative algorithms for Gram-Schmidt orthogonalization. Computing 41 4 (1989) 335-348
24. Björck Å. Numerical Methods for Least Squares Problems (1996), Society for Industrial and Applied Mathematics, Philadelphia
25. Reichel L., and Gragg W.B. FORTRAN subroutines for updating the QR decomposition. ACM Trans. Math. Software 16 (1990) 369-377
26. Frayssé V., Giraud L., Gratton S., and Langou J. Algorithm 842: a set of GMRES routines for real and complex arithmetics on high performance computers. ACM Trans. Math. Software 31 2 (2005) 228-238
27. Saad Y. Krylov subspace methods on supercomputers. SIAM J. Sci. Statist. Comput. 10 6 (1989) 1200-1232
28. Meurant G. Multitasking the conjugate gradient method on the CRAY X-MP/48. Parallel Comput. 5 3 (1987) 267-280
29. Kim S.K., and Chronopoulos A.T. An efficient parallel algorithm for extreme eigenvalues of sparse nonsymmetric matrices. Int. J. Supercomp. Appl. 6 1 (1992) 98-111
30. V. Hernandez, J.E. Roman, A. Tomas, A parallel variant of the Gram-Schmidt process with reorthogonalization, in: G.R. Joubert, W.E. Nagel, F.J. Peters, O.G. Plata, P. Tirado, E.L. Zapata (Eds.), Proceedings of the International Conference on Parallel Computing (ParCo 2005), vol. 33, Central Institute for Applied Mathematics, Jülich, Germany, 2006, pp. 221-228.
31. Duff I.S., Grimes R.G., and Lewis J.G. Sparse matrix test problems. ACM Trans. Math. Software 15 1 (1989) 1-14
32. Z. Bai, D. Day, J. Demmel, J. Dongarra, A test matrix collection for non-Hermitian eigenvalue problems (release 1.0), Technical Report CS-97-355, Department of Computer Science, University of Tennessee, Knoxville, TN, USA, available from: http://math.nist.gov/MatrixMarket, 1997.
33. T. Davis, University of Florida Sparse Matrix Collection, NA Digest, available from: http://www.cise.ufl.edu/research/sparse/matrices, 1992.
34. V. Hernandez, J.E. Roman, A. Tomas, Evaluation of several variants of explicitly restarted Lanczos eigensolvers and their parallel implementations, in: High Performance Computing for Computational Science - VECPAR 2006, LNCS vol. 4395, 2007, pp. 403-416.
35. Nour-Omid B., Parlett B.N., Ericsson T., and Jensen P.S. How to implement the spectral transformation. Math. Comp. 48 178 (1987) 663-673