Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems

Applied Mathematics and Computation

Volumn 175, Issue 2, 2006, Pages 1694-1715

  Bergamaschi, Luca ^a   Martínez, Ángeles ^a   Pini, Giorgio ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; GRADIENT METHODS; INVERSE PROBLEMS; MATRIX ALGEBRA; OPTIMIZATION; PARALLEL ALGORITHMS;

CONJUGATE GRADIENT OPTIMIZATION; DISCRETIZATIONS; RAYLEIGH QUOTIENT; SPARSE EIGENPROBLEMS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 33645869837     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2005.09.015     Document Type: Article

References (28)

1. Anderson E., Bai Z., Bischof C., Demmel J., Dongarra J., Du Croz J., Greenbaum A., Hammarling S., Kenney A.M., Ostrouchov S., and Sorensen D. LAPACK User's Guide (1992), SIAM, Philadelphia
2. Arbenz P., Hetmaniuk U., Lehoucq R.B., and Tuminaro R. A comparison of eigensolvers for large-scale 3d modal analysis using AMG-preconditioners iterative methods. Internat. J. Numer. Meth. Engrg. 64 2 (2005) 204-236
3. Benzi M., Meyer C.D., and Tůma M. A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM J. Sci. Comput. 17 5 (1996) 1135-1149
4. Benzi M., and Tůma M. A comparative study of sparse approximate inverse preconditioners. Appl. Numer. Math. 30 (1999) 305-340
5. Bergamaschi L., Gambolati G., and Pini G. Asymptotic convergence of conjugate gradient methods for the partial symmetric eigenproblem. Numer. Linear Alg. Appl. 4 2 (1997) 69-84
6. Bergamaschi L., Martínez A., and Pini G. Parallel solution of sparse eigenproblems by simultaneous Rayleigh quotient optimization with FSAI preconditioning. In: Joubert G.R., and Nagel W. (Eds). Parallel Computing. Software Technology, Algorithms, Architectures & Applications (2004), Elsevier, North-Holland 275-282
7. Bergamaschi L., Pini G., and Sartoretto F. Approximate inverse preconditioning in the parallel solution of sparse eigenproblems. Numer. Linear Alg. Appl. 7 3 (2000) 99-116
8. Bergamaschi L., Pini G., and Sartoretto F. Computational experience with sequential and parallel preconditioned Jacobi Davidson for large sparse symmetric matrices. J. Comput. Phys. 188 1 (2003) 318-331
9. Bergamaschi L., and Putti M. Numerical comparison of iterative eigensolvers for large sparse symmetric matrices. Comp. Meth. Appl. Mech. Engrg. 191 45 (2002) 5233-5247
10. L. Bergamaschi, M. Putti, Efficient parallelization of preconditioned conjugate gradient schemes for matrices arising from discretizations of diffusion equations, in: Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, March, 1999 (CD-ROM).
11. Gambolati G. On time integration of groundwater flow equations by spectral methods. Water Resour. Res. 29 4 (1993) 1257-1267
12. Gopalakrishnan R., and Parulkar G.M. Efficient user-space protocol implementations with QoS guarantees using real-time upcalls. IEEE/ACM Trans. Networking 6 4 (1998) 374-388
13. Grote M.J., and Huckle T. Parallel preconditioning with sparse approximate inverses. SIAM J. Sci. Comput. 18 3 (1997) 838-853
14. Hysom D., and Pothen A. A scalable parallel algorithm for incomplete factor preconditioning. SIAM J. Sci. Stat. Comput. 22 6 (2001) 2194-2215
15. Kaporin I.E. New convergence results and preconditioning strategies for the conjugate gradient method. Numer. Linear Alg. Appl. 1 (1994) 179-210
16. Knyazev A.V., and Skorokhodov A.L. The preconditioned gradient-type iterative methods in a subspace for partial generalized symmetric eigenvalue problem. SIAM J. Numer. Anal. 31 4 (1994) 1226-1239
17. Kolotilina L.Yu., Nikishin A.A., and Yeremin A.Yu. Factorized sparse approximate inverse preconditionings. IV. Simple approaches to rising efficiency. Numer. Linear Alg. Appl. 6 (1999) 515-531
18. Kolotilina L.Yu., and Yeremin A.Yu. Factorized sparse approximate inverse preconditionings. I. Theory. SIAM J. Matrix Anal. Appl. 14 (1993) 45-58
19. Lehoucq R.B., and Sorensen D.C. Deflation techniques for an implicit restarted Arnoldi iteration. SIAM J. Matrix Anal. Appl. 17 4 (1996) 789-821
20. K.J. Maschhoff, D.C. Sorensen, A portable implementation of ARPACK for distributed memory parallel architectures, in: Proceedings of the Copper Mountain Conference on Iterative Methods, vol. 1, April 9-13 1996.
21. monga Made M., and van der Vorst H.A. Parallel incomplete factorizations with pseudo-overlapped subdomains. Parallel Comput. 27 8 (2001) 989-1008
22. Notay Y. Combination of Jacobi-Davidson and conjugate gradients for the partial symmetric eigenproblem. Numer. Linear Algebra Appl. 9 1 (2002) 21-44
23. Paige C.C. Computational variants of the Lanczos method for the eigenproblem. J. Inst. Math. Appl. 10 (1972) 373-381
24. Pini G. A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y/MP. Parallel Comput. 17 (1991) 553-562
25. Saad Y. Variations of Arnoldi's method for computing eigenelements of large unsymmetric matrices. Linear Algebra Appl. 34 (1980) 269-295
26. Y. Saad, S. Kuznetsov, G.-C. Lo, A. Malevsky, A. Chapman. PSPARSLIB: a portable library of parallel sparse iterative solvers, in: Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing (Minneapolis, MN, 1997), (electronic), Philadelphia, PA, 1997, SIAM.
27. Sartoretto F., Pini G., and Gambolati G. Accelerated simultaneous iterations for large finite element eigenproblems. J. Comput. Phys. 81 (1989) 53-69
28. Sleijpen G.L.G., and van der Vorst H.A. A Jacobi-Davidson method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17 2 (1996) 401-425