A case for a biorthogonal Jacobi-Davidson method: Restarting and correction equation

SIAM Journal on Matrix Analysis and Applications

Volumn 24, Issue 1, 2003, Pages 238-259

  Stathopoulos, Andreas ^a  

^a The College of William and Mary   (United States)

Author keywords

BCG; Eigenvalues; Jacobi Davidson; Lanczos; Preconditioning; Three term recurrence

Indexed keywords

EID: 0037286858     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479800373371     Document Type: Article

References (46)

1. O. AXELSSON, Iterative Solution Methods, Cambridge University Press: New York, 1994.
2. J. BAGLAMA, D. CALVETTI, G. H. GOLUB, AND L. REICHEL, Adaptively preconditioned GMRES algorithms, SIAM J. Sci. Comput., 20 (1998), pp. 243-269.
3. Z. BAI, D. DAY, J. DEMMEL, AND J. DONGARRA, A Test Matrix Collection for Non-Hermitian Eigenvalue Problems, Technical report, Department of Mathematics, University of Kentucky, Lexington, KY, 1996.
4. Z. BAI, D. DAY, AND Q. YE, ABLE: An adaptive block Lanczos method for non-Hermitian eigenvalue problems, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 1060-1082.
5. Z. BAI, J. DEMMEL, J. DONGARRA, A. RUHE, AND H. VAN DER VORST, EDS., Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, Philadelphia, 2000.
6. R. BARRETT, M. W. BERRY, T. F. CHAN, J. DEMMEL, J. DONATO, J. DONGARRA, V. EIJKHOUT, R. POZO, C. ROMINE, AND H. VAN DER VORST, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia, 1994.
7. C. BEATTIE, Harmonic Ritz and Lehmann bounds, Electron. Trans. Numer. Anal., 7 (1998), pp. 18-39.
8. R. F. BOISVERT, R. POZO, K. REMINGTON, R. BARRETT, AND J. J. DONGARRA, The Matrix Market: A web resource for test matrix collections, in Quality of Numerical Software, Assessment and Enhancement, R. F. Boisvert, ed., Chapman & Hall, London, 1997, pp. 125-137.
9. A. CHAPMAN AND Y. SAAD, Deflated and augmented Krylov subspace techniques, Numer. Linear Algebra Appl., 4 (1997), pp. 43-66.
10. M. CROUZEIX, B. PHILIPPE, AND M. SADKANE, The Davidson method, SIAM J. Sci. Comput., 15 (1994), pp. 62-76.
11. 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.
12. F. DE STURLER, Truncation strategies for optimal Krylov subspace methods, SIAM J. Numer. Anal., 36 (1999), pp. 864-889.
13. M. EIERMANN AND O. G. ERNST, The geometry of Krylov subspace methods, Acta Numer., 10 (2001), pp. 251-312.
14. R. FLETCHER, Conjugate gradient methods for indefinite systems, in Numerical Analysis (Dundee, 1975), Lecture Notes in Math. 506, G. A. Watson, ed., Springer, Berlin, 1976, pp. 73-89.
15. D. R. FOKKEMA, G. L. G. SLEIJPEN, AND H. A. VAN DER VORST, Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils, SIAM J. Sci. Comput., 20 (1998), pp. 94-125.
16. D. R. FOKKEMA, Subspace Methods for Linear, Nonlinear and Eigen Problems, Ph.D. thesis, Utrecht University, Utrecht, The Netherlands, 1996.
17. R. W. FREUND, Quasi-kernel polynomials and their use in non-Hermitian matrix iterations, J. Comput. Appl. Math., 43 (1992), pp. 135-158.
18. R. W. FREUND, M. H. GUTKNECHT, AND N. M. NACHTIGAL, An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices, SIAM J. Sci. Comput., 14 (1993), pp. 137-158.
19. M. GENSEBERGER AND G. L. G. SLEIJPEN, Alternative Correction Equations in the Jacobi-Davidson Method, Technical Report 1073, Department of Mathematics, University of Utrecht, Utrecht, The Netherlands, 1999.
20. M. E. HOCHSTENBACH AND G. L. G. SLEIJPEN, Two-sided and alternating Jacobi-Davidson, Linear Algebra Appl., to appear.
21. A. V. KNYAZEV, A preconditioned conjugate gradient method for eigenvalue problems and its implementation in a subspace, in Numerical Treatment of Eigenvalue Problems, Internat. Ser. Numer. Math. 96, Birkhäuser, Basel, 1991, pp. 143-154.
22. C. LANCZOS, An iterative method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Nur. Stand., 45 (1950), pp. 255-282.
23. C. LANCZOS, Solution of systems of linear equations by minimized iterations, J. Res. Nat. Nur. Stand., 49 (1952), pp. 33-53.
24. R. B. MORGAN, A restarted GMRES method augmented with eigenvectors, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 1154-1171.
25. R. B. MORGAN, On restarting the Arnoldi method for large nonsymmetric eigenvalue problems, Math. Comp., 65 (1996), pp. 1213-1230.
26. R. B. MORGAN AND D. S. SCOTT, Generalizations of Davidson's method for computing eigen-values of sparse symmetric matrices, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 817-825.
27. C. W. MURRAY, S. C. RACINE, AND E. R. DAVlDSON, Improved algorithms for the lowest eigenvalues and associated eigenvectors of large matrices, J. Comput. Phys., 103 (1992), pp. 382-389.
28. C. C. PAIGE, B. N. PARLETT, AND H. A. VAN DER VORST, Approximate solutions and eigenvalue bounds from Krylov spaces, Numer. Linear Algebra Appl., 2 (1995), pp. 115-133.
29. B. N. PARLETT, Reduction to tridiagonal form and minimal realizations, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 567-593.
30. B. N. PARLETT, D. R. TAYLOR, AND Z. A. LIU, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comput., 33 (1985), pp. 680-687.
31. B. N. PARLETT, The Symmetric Eigenvalue Problem, SIAM, Philadelphia, 1998.
32. Y. SAAD, SPARSKIT: A Basic Toolkit for Sparse Matrix Computations, Technical Report 90-20, Research Institute for Advanced Computer Science, NASA Ames Research Center, Moffet Field, CA, 1990. Software currently available at ftp://ftp.cs.umn.edu/dept/sparse/.
33. Y. SAAD, Numerical Methods for Large Eigenvalue Problems, Manchester University Press, Manchester, 1992.
34. Y. SAAD, A flexible inner-outer preconditioned GMRES algorithm, SIAM J. Sci. Comput., 14 (1993), pp. 461-469.
35. Y. SAAD, Iterative Methods for Sparse Linear Systems, PWS Publishing, Boston, MA, 1996.
36. G. DE SAMBLANX AND A. BULTHEEL, Nested Lanczos: Implicitly restarting an unsymmetric Lanczos algorithm, Numer. Algorithms, 18 (1998), pp. 31-50.
37. G. L. G. SLEIJPEN, A. G. L. BOOTEN, D. R. FOKKEMA, AND H. A. VAN DER VORST, Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems, BIT, 36 (1996), pp. 595-633.
38. 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.
39. G. L. G. SLEIJPEN AND F. W. WUBS, Effective Preconditioning Techniques for Eigenvalue Problems, Technical Report 1117, Department of Mathematics, University of Utrecht, Utrecht, The Netherlands, 1999.
40. D. C. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
41. A. STATHOPOULOS, Some insights on restarting symmetric eigenvalue methods with Ritz and harmonic Ritz vectors, in Iterative Methods in Scientific Computation IV, D. R. Kincaid and A. C. Elster, eds., IMACS, New Brunswick, NJ, 1999, pp. 297-311.
42. A. STATHOPOULOS AND Y. SAAD, Restarting techniques for (Jacobi-)Davidson symmetric eigen-value methods, Electron. Trans. Numer. Algorithms, 7 (1998), pp. 163-181.
43. A. STATHOPOULOS, Y. SAAD, AND K. WU, Dynamic thick restarting of the Davidson, and the implicitly restarted Arnoldi methods, SIAM J. Sci. Comput., 19 (1998), pp. 227-245.
44. J. H. VAN LENTHE AND P. PULAY, A space-saving modification of Davidson's eigenvector algorithm, J. Comput. Chem., 11 (1990), pp. 1164-1168.
45. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, UK, 1965.
46. K. Wu, Y. SAAD, AND A. STATHOPOULOS, Inexact Newton preconditioning techniques for eigen-value problems, Electron. Trans. Numer. Algorithms, 7 (1998), pp. 202-214.