Computational experience with sequential and parallel, preconditioned Jacobi-Davidson for large, sparse symmetric matrices

Journal of Computational Physics

Volumn 188, Issue 1, 2003, Pages 318-331

  Bergamaschi, Luca ^a   Pini, Giorgio ^a   Sartoretto, Flavio ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Eigenvalues; Jacobi Davidson method; Parallel algorithms; Sparse approximate inverses

Indexed keywords

INVERSE PROBLEMS; ITERATIVE METHODS; JACOBIAN MATRICES; NUMERICAL METHODS;

CORRECTION EQUATION; EIGEN-VALUE; JACOBI- DAVIDSON; JACOBI-DAVIDSON ALGORITHM; JACOBI-DAVIDSON METHODS; LARGE SPARSE MATRIX; PERFORMANCE; PRECONDITIONERS; SPARSE APPROXIMATE INVERSE; SPARSE SYMMETRIC MATRIXES;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 0038008333     PISSN: 00219991     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0021-9991(03)00190-6     Document Type: Article

References (39)

1. E.C. Anderson, Y. Saad, Solving sparse triangular systems on parallel computers, Int. J. High Speed Comput. 1 (1989) 73-96.
2. Z. Bai, J. Demmel, J. Dongarra, A. Rube, H. van der Vorst, Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, Philadelphia, PA, 2000.
3. K.J. Bathe, E. Wilson, Solution methods for eigenvalue problems in structural dynamics, Int. J. Numer. Methods Eng. 6 (1973) 213-226.
4. M. Benzi, C.D. Meyer, M. Tůma, A sparse approximate inverse preconditioner for the conjugate gradient method, SIAM J. Sci. Comput. 17 (1996) 1135-1149.
5. L. Bergamaschi, G. Gambolati, G. Pini, Asymptotic convergence of conjugate gradient methods for the partial symmetric eigenproblem, Numer. Linear Algebra Appl. 4 (1997) 69-84.
6. L. Bergamaschi, G. Gambolati, M. Putti, Iterative methods for the partial symmetric eigenproblem, in: Proceedings of the 2000 Copper Mountain Conference on Iterative Methods, April 3-7, 2000.
7. L. Bergamaschi, G. Pini, F. Sartoretto, Approximate inverse preconditioning in the parallel solution of sparse eigenproblems, Numer. Linear Algebra Appl. 7 (2000) 99-116.
8. L. Bergamaschi, G. Pini, F. Sartoretto, Parallel preconditioning of a sparse eigensolver, Parallel Comput. 27 (2001) 963-976.
9. L. Bergamaschi, M. Putti, Mixed finite elements and Newton-like linearization for the solution of Richard's equation, Int. J. Numer. Methods Eng. 45 (1999) 1025-1046.
10. L. Bergamaschi, M. Putti, Numerical comparison of iterative eigensolvers for large sparse symmetric matrices, Comp. Methods Appl. Mech. Eng. 191 (2002) 5233-5247.
11. 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).
12. E. Chow, A priori sparsity patterns for parallel sparse approximate inverse preconditioners, SIAM J. Sci. Comput. 21 (2000) 1804-1822.
13. E. Chow, Parallel implementation and practical use of sparse approximate inverse preconditioners with a priori sparsity patterns, Int. J. High Performance Comput. Appl. 15 (2001) 56-74.
14. T. Ericsson, A. Ruhe, The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems, Math. Comp. 35 (1980) 1251-1268.
15. R.W. Freund, A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Comput. 14 (1993) 470-482.
16. G. Gambolati, A. di Monaco, G. Galeati, F. Uliana, P. Mosca, C. Mascardi, New approaches and applications in subsurface flow modeling: 3-D finite element analysis of dewatering for an electro-nuclear plant, in: E. Custodio (Ed.), Groundwater Flow and Quality Modelling, D. Reidel Publishing Company, Dordrecht, 1988, pp. 717-759.
17. M. Genseberger, G. Sleijpen, H. Van der Vorst, Using domain decomposition in the Jacobi-Davidson method. Universiteit Utrecht, Preprint 1164, October 2000.
18. D. Hysom, A. Pothen, A scalable parallel algorithm for incomplete factor preconditioning, SIAM J. Sci. Comput. 22 (2001) 2194-2215.
19. M.T. Jones, P.E. Plassman, Solution of large, sparse systems of linear equations in massively parallel applications, in: Proceedings of Supercomputing'92, IEEE Computer Society Press, Silver Spring, MD, 1992, pp. 551-560.
20. M.T. Jones, P.E. Plassman, Scalable iterative solution of sparse linear systems, in: G.J. George, J.W.H. Liu (Eds.), Graph Theory and Sparse matrix Computation, IMA Volumes on Mathematics and Its Applications, vol. 56, Springer, Berlin, 1993, pp. 229-245.
21. A.V. Knyazev, A.L. Skorokhodov, The preconditioned gradient-type iterative methods in a subspace for partial generalized symmetric eigenvalue problem, SIAM J. Numer. Anal. 31 (1994) 1226-1239.
22. L.Yu. Kolotilina, A.Yu. Yeremin, Factorized sparse approximate inverse preconditioning I. Theory, SIAM J. Matrix Anal. Appl. 14 (1993) 45-58.
23. C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Standard 45 (1950) 255-282.
24. R.B. Lehoucq, D.C. Sorensen, Deflation techniques for an implicit restarted Arnoldi iteration, SIAM J. Matrix Anal. Appl. 17 (1996) 789-821.
25. M. Magolu Monga Made, H.A. van der Vorst, Parallel incomplete factorizations with pseudo-overlapped subdomains, Parallel Comput. 27 (2001) 989-1008.
26. 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.
27. J.A. Meijerink, H.A. van der Vorst, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp. 31 (1977) 148-162.
28. R.T. Mills, A. Stathopoulos, E. Smirni, Algorithmic modifications to the Jacobi-Davidson parallel eigensolver to dynamically balance external CPU and memory load, in: Proceedings of the International Conference on Supercomputing 2001, Sorrento, Italy, June 18-22, 2001, pp. 454-463.
29. Y. Notay, Combination of Jacobi-Davidson and conjugate gradients for the partial symmetric eigenproblem, Numer. Linear Algebra Appl. 9 (2002) 21-44.
30. C.C. Paige, Computational variants of the Lanczos method for the eigenproblem, J. Inst. Math. Appl. 10 (1972) 373-381.
31. B.N. Parlett, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
32. Y. Saad, Iterative Methods for Sparse Linear Systems, PWS Publishing Company, Boston, MA, 1996.
33. F. Sartoretto, G. Pini, G. Gambolati, Accelerated simultaneous iterations for large finite element eigenproblems, J. Comp. Phys. 81 (1989) 53-69.
34. G.L.G. Sleijpen, H.A. van der Vorst, A Jacobi-Davidson method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl. 17 (1996) 401-425.
35. G.L.G. Sleijpen, H.A. Van der Vorst, E. Meijerink, Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems, ETNA 7 (1998) 75-89.
36. A. Stathopoulos, Y. Saad, K. Wu, Dynamic thick restarting of the Davidson, and the implicitly restarted Arnoldi methods, SIAM J. Sci. Comput. 19 (1998) 227-245.
37. J. Van den Eshof, The convergence of Jacobi-Davidson iterations for Hermitian eigenproblems, Numer. Linear Algebra Appl. 9 (2002) 163-179.
38. H.A. van der Vorst, Bi-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 13 (1992) 631-644.
39. K. Wu, Y. Saad, A. Stathopoulos, Inexact Newton preconditioning techniques for large symmetric eigenvalue problems, Electron. Trans. Numer. Anal. 7 (1998) 202-214.