Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems

Electronic Transactions on Numerical Analysis

Volumn 7, Issue , 1998, Pages 75-89

  Sleijpen, Gerard L G ^a   Van Der Vorst, Henk A ^a   Meijerink, Ellen ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Generalized eigenproblems; Harmonic Ritz values; Jacobi Davidson; Linear eigenproblems; Preconditioning

Indexed keywords

EID: 0001917562     PISSN: 10689613     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. E. R. DAVIDSON, The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real symmetric matrices, J. Comput. Phys., 17 (1975), pp. 87-94.
2. R. S. DEMBO, S. C. EISENSTAT AND T. STEIHAUG, Inexact Newton methods, SIAM J. Numer. Anal., 19 (1982), pp. 400-408.
3. D. R. FOKKEMA, G. L. G. SLEIJPEN AND H. A. VAN DER VORST, Jacobi-Davidson style QR and QZ algorithms for the partial reduction of matrix pencils, SIAM J. Sci. Comput., 20 (1998), pp. 94-125.
4. G. GOLUB AND C. VAN LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, 1996.
5. I. GUSTAFSSON, A Class of First Order Factorization Methods, BIT, 18 (1978), pp. 142-156.
6. C. G. J. JACOBI, Ueber ein leichtes Verfahren, die in der Theorie der Säcularstörungen vorkommenden Gleichungen numerisch aufzulösen, Journal für die reine und angewandte Mathematik, (1846), pp. 51-94.
7. R. B. MORGAN, Computing interior eigenvalues of large matrices, Linear Algebra Appl., 154/156 (1991), pp. 289-309.
8. J. OLSEN, P. JØRGENSEN, AND J. SIMONS, Passing the one-billion limit in full configuration-interaction (FCI) calculations, Chemical Physics Letters, 169 (1990), pp. 463-472.
9. C. C. PAIGE, B. N. PARLETT, AND H. A. VAN DER VORST, Approximate solutions and eigenvalue bounds from Krylov subspaces, Num. Lin. Algebra Appl., 2 (1995), pp. 115-133.
10. C. C. PAIGE AND M. A. SAUNDERS, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal., 12 (1975), pp. 617-629.
11. A. RUHE, Rational Krylov algorithms for nonsymmetric eigenvalue problems II. Matrix Pairs, Lin. Algebra Appl., 197/198 (1994), pp. 283-295.
12. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
13. G. L. G. SLEIJPEN AND D. R. FOKKEMA, BiCGstab(ℓ) for linear equations involving matrices with complex spectrum, Electron. Trans. Numer. Anal., 1 (1993), pp. 11-32.
14. G. L. G. SLEIJPEN AND H. A. VAN DER VORST, A Jacobi-Davidson iteration method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 401-425.
15. _, The Jacobi-Davidson method for eigenvalue problems and its relation to accelerated inexact Newton schemes, in Iterative Methods in Linear Algebra, II, S. D. Margenov and P. S. Vassilevski, eds., IMACS Ann. Comput. Appl. Math. 3, Baltzer, Basel, 1996, pp. 377-389.
16. G. L. G. SLEIJPEN, J. G. L. BOOTEN, D. R. FOKKEMA, AND H. A. VAN DER VORST, Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems, BIT, 36:3 (1996), pp. 595-633.
17. H. A. VAN DER VORST AND G. L. G. SLEIJPEN, The effect of incomplete decomposition preconditioning on the convergence of Conjugate Gradients, in Incomplete Decompositions (ILU) - Algorithms, Theory, and Applications, W. Hackbusch and G. Wittum, eds., Vieweg, Braunschweig, 1993, pp. 179-187.
18. H. A. VAN DER VORST, Preconditioning by Incomplete Decompositions, Ph.D. thesis, Utrecht University, Utrecht, The Netherlands, 1982.
19. _, Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 631-644.
20. K. WU, Y. SAAD, AND A. STATHOPOULOS, Inexact Newton preconditioning techniques, Electron. Trans. Numer. Anal., 7 (1998), pp. 166-184.