JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices

Computer Physics Communications

Volumn 177, Issue 12, 2007, Pages 951-964

  Bollhöfer, Matthias ^a   Notay, Yvan ^b  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Discrete energy states; Eigenvalue computation; Jacobi Davidson; Numerical software; Preconditioning; Sparse matrices

Indexed keywords

CODES (SYMBOLS); COMPUTER SOFTWARE; CONVERGENCE OF NUMERICAL METHODS; MATRIX ALGEBRA;

DISCRETE ENERGY STATES; EIGENVALUE COMPUTATION; NUMERICAL SOFTWARE; SPARSE MATRICES;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 35648982937     PISSN: 00104655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cpc.2007.08.004     Document Type: Article

References (70)

1. Sleijpen G., and van der Vorst H.A. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17 (1996) 401-425
2. Sleijpen G., and van der Vorst H.A. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM Rev. 42 (2000) 267-293
3. Bergamaschi L., Pini G., and Sartoretto F. Computational experience with sequential and parallel, preconditioned Jacobi-Davidson for large, sparse symmetric matrices. J. Computational Physics 188 (2003) 318-331
4. Booten A., Fokkema D., Sleijpen G., and van der Vorst H.A. Jacobi-Davidson methods for generalized MHD-eigenvalue problems. Z. Angew. Math. Mech. 76 (1996) 131-134
5. Cooke S.J., and Levush B. Eigenmode solution of 2-d and 3-d electromagnetic cavities containing absorbing materials using the Jacobi-Davidson algorithm. J. Computational Physics 157 (2000) 350-370
6. Cooke S., Shtokhamer R., Mondelli A., and Levush B. A finite integration method for conformal, structured-grid, electromagnetic simulation. J. Computational Physics 215 (2006) 321-347
7. Hwang T.-M., Lin W.-W., Wang W.-C., and Wang W. Numerical simulation of three dimensional pyramid quantum dot. J. Computational Physics 196 (2004) 208-232
8. Liu C., and Lee J.-F. Jacobi-Davidson algorithm and its application to modeling RF/microwave detection circuits. Comp. Meth. Appl. Mech. Engng. 169 (1999) 359-375
9. Mitin A.V. New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem. J. Computational Physics 161 (2000) 653-667
10. van Dorsselaer J.L.M. Computing eigenvalues occurring in continuation methods with the Jacobi-Davidson QZ method. J. Computational Physics 138 (1997) 714-733
11. Voss H. Iterative projection methods for computing relevant energy states of a quantum dot. J. Computational Physics 217 (2006) 824-833
12. Wang W., Hwang T.-M., Lin W.-W., and Liu J.-L. Numerical methods for semiconductor heterostructures with band nonparabolicity. J. Computational Physics 190 (2003) 141-158
13. Yang C., Peyton B.W., Noid D.W., Sumpter B.G., and Tuzun R.E. Large-scale normal coordinate analysis for molecular structures. SIAM J. Sci. Comput. 23 (2001) 563-582
14. Notay Y. Combination of Jacobi-Davidson and conjugate gradients for the partial symmetric eigenproblem. Numer. Lin. Alg. Appl. 9 (2002) 21-44
15. Notay Y. Convergence analysis of inexact Rayleigh quotient iteration. SIAM J. Matrix Anal. Appl. 24 (2003) 627-644
16. Notay Y. JDCG, JDRPCG and JDRPCG_GEP codes. available via. http://homepages.ulb.ac.be/~ynotay/
17. Sleijpen G. JDQR and JDQZ codes. available via. http://www.math.uu.nl/people/sleijpen
18. Stathopoulos A. PRIMME: PReconditioned Iterative MultiMethod Eigensolver. available via. http://www.cs.wm.edu/~andreas/software/
19. Geus R. Jdbsym version 0.14. http://www.inf.ethz.ch/personal/geus/software.html
20. Lanczos C. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Standards 45 (1950) 255-282
21. Davidson E.R. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. J. Computational Physics 17 (1975) 87-94
22. Stathopoulos A., Saad Y., and Fischer C.F. Robust preconditioning of large, sparse, symmetric eigenvalue problems. J. Comput. Appl. Math. 64 (1995) 197-215
23. Notay Y. Is Jacobi-Davidson faster than Davidson?. SIAM J. Matrix Anal. Appl. 26 (2005) 522-543
24. Saad Y. Iterative Methods for Sparse Linear Systems. second ed. (2003), SIAM, Philadelphia, PA
25. van der Vorst H.A. Iterative Krylov Methods for Large Linear systems (2003), Cambridge University Press, Cambridge
26. Stewart G.W. Matrix Algorithms, vol. II (2001), SIAM, Philadelphia, PA
27. Fokkema D., Sleijpen G., and van der Vorst H.A. Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils. SIAM J. Sci. Comput. 20 (1999) 94-125
28. Benzi M. Preconditioning techniques for large linear systems: A survey. J. Computational Physics 182 (2002) 418-477
29. Morgan R.B., and Scott D.S. Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems. SIAM J. Sci. Comput. 14 (1993) 585-593
30. Morgan R.B., and Scott D.S. Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices. SIAM J. Sci. Statist. Comput. 7 (1986) 817-825
31. Murray C.W., Racine S.C., and Davidson E.R. Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices. J. Computational Physics 103 (1992) 382-389
32. A. Stathopoulos, Nearly optimal preconditioned methods for Hermitian eigenproblems under limited memory. Part I: Seeking one eigenvalue, preprint, Department of Computer Science, College of William & Mary, Williamsburg, USA, 2005
33. Stathopoulos A., and Saad Y. Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue methods. Electronic Trans. Numer. Anal. 7 (1998) 163-181
34. Bergamaschi L., Gambolati G., and Pini G. Asymptotic convergence of conjugate gradient methods for the partial symmetric eigenproblem. Numer. Lin. Alg. Appl. 4 (1997) 69-84
35. Knyazev A.V. Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method. SIAM J. Sci. Comput. 23 (2001) 517-541
36. Hetmaniuk U., and Lehoucq R. Basis selection in lobpcg. J. Computational Physics 218 (2006) 324-332
37. Morgan R.B. Preconditioning eigenvalues and some comparison of solvers. J. Comput. Appl. Math. 123 (2000) 101-115
38. In: Bai Z., Demmel J., Dongarra J., Ruhe A., and van der Vorst H.A. (Eds). Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide (2000), SIAM, Philadelphia, PA
39. Parlett B.N. The Symmetric Eigenvalue Problem (1998), SIAM, Philadelphia, PA corrected reprint of the 1980 original
40. van der Vorst H.A. Computational methods for large eigenvalue problems. Handbook of Numerical Analysis, vol. VIII (2002), North-Holland, Amsterdam 3-179
41. Hestenes M.R., and Stiefel E. Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Standards 49 (1952) 409-436
42. Freund R.W., and Nachtigal N.M. Software for simplified Lanczos and QMR algorithms. Appl. Numer. Math. 19 (1995) 319-341
43. Hochstenbach M.E., and Notay Y. Controling inner iterations in the Jacobi-Davidson method. Tech. Rep. GANMN 06-03, Université Libre de Bruxelles, Brussels, Belgium (2006). http://homepages.ulb.ac.be/~ynotay
44. Sleijpen G., van der Vorst H.A., and Meijerink E. Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems. Electronic Trans. Numer. Anal. 7 (1998) 75-89
45. Notay Y. Inner iterations in eigenvalue solvers. Tech. Rep. GANMN 05-01, Université Libre de Bruxelles, Brussels, Belgium (2005). http://homepages.ulb.ac.be/~ynotay
46. Bollhöfer M., and Saad Y. Multilevel preconditioners constructed from inverse-based ILUs. SIAM J. Sci. Comput. 27 5 (2006) 1627-1650
47. Amestoy P., Davis T.A., and Duff I.S. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17 4 (1996) 886-905
48. Duff I.S., and Koster J. The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J. Matrix Anal. Appl. 20 (1999) 889-901
49. Benzi M., Haws J.C., and Tůma M. Preconditioning highly indefinite and nonsymmetric matrices. SIAM J. Sci. Comput. 22 4 (2000) 1333-1353
50. Duff I.S., and Pralet S. Strategies for scaling and pivoting for sparse symmetric indefinite problems. SIAM J. Matrix Anal. Appl. 27 2 (2005) 313-340
51. Schenk O., and Gärtner K. On fast factorization pivoting methods for sparse symmetric indefinite systems. Elect. Trans. Numer. Anal. 23 (2006) 158-179
52. Schenk O., and Gärtner K. On fast factorization pivoting methods for sparse symmetric indefinite systems. Electr. Trans. Numer. Anal. 23 (2006) 158-179
53. Hagemann M., and Schenk O. Weighted matchings for preconditioning symmetric indefinite linear systems. SIAM J. Sci. Comput. 28 2 (2006) 403-420
54. Schenk O., Bollhöfer M., and Römer R.A. On large scale diagonalization techniques for the Anderson model of localization. SIAM J. Sci. Comput. 28 3 (2006) 963-983
55. Saad Y. ILUM: a parallel multi-elimination ILU preconditioner for general sparse matrices. SIAM J. Sci. Comput. 17 (1996) 830-847
56. Manteuffel T.A. An incomplete factorization technique for positive definite linear systems. Math. Comp. 34 (1980) 473-497
57. Saad Y. Numerical Methods for Large Eigenvalue Problems (1992), Halstead Press, New York
58. Higham N.J. Accuracy and Stability of Numerical Algorithms (1996), SIAM, Philadelphia, PA
59. Mathias R. Quadratic residual bounds for the Hermitian eigenvalue problem. SIAM J. Matrix Anal. Appl. 19 (1998) 541-550
60. Trottenberg U., Oosterlee C.W., and Schüller A. Multigrid (2001), Academic Press, London
61. Lehoucq R.B., Sorensen D.C., and Yang C. ARPACK: software package based on implicitly restarted Arnoldi methods. available via. http://www.caam.rice.edu/software/ARPACK/
62. Lehoucq R.B., Sorensen D.C., and Yang C. ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods (1998), SIAM, Philadelphia, PA
63. Schenk O., and Gärtner K. Solving unsymmetric sparse systems of linear equations with PARDISO. J. Future Gen. Comput. Syst. 20 3 (2004) 475-487
64. Bollhöfer M., Saad Y., and Schenk O. ILUPACK-preconditioning software package, vol. 2.1 (January 2006). http://www.math.tu-berlin.de/ilupack/
65. Knyazev A. BLOPEX: Block Locally Optimal Preconditioned Eigenvalue Xolvers. available via. www-math.cudenver.edu/~aknyazev/software/BLOPEX/
66. Baye D., Hesse M., and Vincke M. The unexplained accuracy of the Lagrange-mesh method. Phys. Rev. E 65 (2002) 0267011-8
67. Hesse M., and Baye D. Lagrange-mesh calculations of three-body atoms and molecules. At. Mol. Opt. Phys. 32 (1999) 5605-5617
68. Stathopoulos A., and Fischer C.F. A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix. Comput. Phys. Comm. 79 (1994) 268-290
69. Anderson P. Absence of diffusion in certain random lattices. Phys. Rev. 109 (1958) 1492-1505
70. Saad Y. Iterative Methods for Sparse Linear Systems. second ed. (2003), SIAM Publications