Nearly optimal preconditioned methods for Hermitian eigenproblems under limited memory. Part I: Seeking one eigenvalue

SIAM Journal on Scientific Computing

Volumn 29, Issue 2, 2007, Pages 481-514

  Stathopoulos, Andreas ^a  

^a Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

Author keywords

Conjugate gradient; Eigenvalues; Jacobi Davidson; Newton; Optimality; Preconditioning

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONJUGATE GRADIENT METHOD; JACOBIAN MATRICES; NEWTON-RAPHSON METHOD; ROBUSTNESS (CONTROL SYSTEMS);

CONJUGATE GRADIENT; JACOBI-DAVIDSON; OPTIMALITY; PRECONDITIONING;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 36148946969     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/050631574     Document Type: Article

References (75)

1. M. F. ADAMS, Evaluation of three unstructured multigrid methods on 3d finite element problems in solid mechanics, Internat. J. Numer. Methods Engrg., 55 (2002), pp. 519-534.
2. P. ARBENZ, U. L. HETMANIUK, R. B. LEHOUCQ, AND R. S. TUMINARO, A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods, Internat. J. Numer. Methods Engrg., 64 (2005), pp. 204-236.
3. 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.
4. 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.
5. L. BERGAMASCHI, G. GAMBOLATI, AND G. PINI, Asymptotic convergence of conjugate gradient methods for the partial symmetric eigenproblem, Numer. Linear Algebra Appl., 4 (1997), pp. 69-84.
6. J. BERNS-MUELLER, Inexact Inverse Iteration Using Galerkin Krylov Solvers, Ph.D. thesis, University of Bath, Bath, UK, 2003.
7. R. F. BOISVERT, R. Pozo, K. REMINGTON. R. BARRETT, AND 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.
8. W. W. BRADBURY AND R. FLETCHER, New iterative methods for solution of the eigenproblem, Numer. Math., 9 (1966), pp. 259-267.
9. M. CLINT AND A. JENNINGS, The evaluation of eigenvalues and eigenvectors of a real symmetric matrix by simultaneous iteration, Comput. J., 13 (1970), pp. 76-80.
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. T. DAVIS, University of Florida Sparse Matrix Collection, Technical report, University of Florida. NA Digest, vol. 92, no. 42, October 16, 1994, NA Digest, vol. 96, no. 28, July 23, 1996, and NA Digest, vol. 97, no. 23, June 7, 1997.
13. R. S. DEMBO, S. C EISENSTAT, AND T. STEIHAUG, Inexact Newton methods, SIAM J. Numer. Anal., 19 (1982), pp. 400-408.
14. E. G. D'YAKONOV, Iteration methods in eigenvalue problems, Math. Notes, 34 (1983), pp. 945-953.
15. A. EDELMAN, T. A. ARIAS, AND S. T. SMITH, The geometry of algorithms with orthogonality constraints, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 303-353.
16. T. EIROLA AND O. NEVANLINNA, Accelerating with rank-one updates, Linear Algebra Appl., 121 (1989), pp. 511-520.
17. 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.
18. R. W. FREUND AND N. M. NACHTIGAL, A new Krylov-Sub space Method for Symmetric Indefinite Linear Systems, Technical report, AT&T Bell Laboratories, Murray Hill, NJ, 1994.
19. R. W. FREUND AND N. M. NACHTIGAL, Software for simplified Lanczos and QMR algorithms, Appl. Numer. Math., 19 (1995), pp. 319-341.
20. G. GAMBOLATI, F. SARTORETTO, AND P. FLORIAN, An orthogonal accelerated deflation technique for large symmetric eigenproblems, Comput. Methods Appl. Mech. Engrg., 94 (1992), pp. 13-23.
21. M. GENSEBERGER AND G. L. G. SLEIJPEN, Alternative correction equations in the Jacobi-Davidson method, Numer. Linear Algebra Appl., 6 (1999), pp. 235-253.
22. R. GEUS, JDBSYM, http://people.web.psi.ch/geus/software. html.
23. R. GEUS, The Jacobi-Davidson Algorithm for Solving Large Sparse Symmetric Eigenvalue Problems with Application to the Design of Accelerator Cavities, Ph.D. thesis 14734, ETH, Zurich, Switzerland, 2002.
24. P. H. GILL, W. MURRAY, AND M. H. WRIGHT, Practical Optimization, Academic Press, New York, 1986.
25. G. H. GOLUB AND Q. YE, Inexact inverse iteration for generalized eigenvalue problems, BIT, 40 (2000), pp. 671-684.
26. G. H. GOLUB, Z. ZHANG, AND H. ZHA, Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations, Linear Algebra Appl., 309 (2000), pp. 289-306.
27. R. G. GRIMES. J. G. LEWIS, AND H. D. SIMON, A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 228-272.
28. U. HETMANIUK AND R. B. LEHOUCQ, Basis selection in LOBPCG, J. Comput. Phys., 28 (2006), pp. 324-332.
29. A. V. KNYAZEV, BLOPEX, http://www-math.cudenver.edu/ ~aknyazev/software/BLOPEX.
30. A. V. KNYAZEV, Convergence rate estimates for iterative methods for mesh symmetric eigenvalue problem, Soviet J. Numer. Anal. Math. Modeling, 2 (1987), pp. 371-396.
31. A. V. KNYAZEV, Preconditioned eigensolvers - an oxymoron?, Electron. Trans. Numer. Anal., 7 (1998), pp. 104-123.
32. A. V. KNYAZEV, Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method, SIAM J. Sci. Comput., 23 (2001), pp. 517-541.
33. A. V. KNYAZEV AND K. NEYMEYR, Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method, Electron. Trans. Numer. Anal., 15 (2003), pp. 38-55.
34. A. V. KNYAZEV AND K. NEYMEYR, A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems, Linear Algebra Appl., 358 (2003), pp. 95-114.
35. T. G. KOLDA, D. P. O'LEARY, AND L. NAZARETH, BFGS with update skipping and varying memory, SIAM J. Optim., 8 (1998), pp. 1060-1083.
36. Y.-L. LAI, K.-Y. LIN, AND W.-W. LIN, An inexact inverse iteration for large sparse eigenvalue problems, Numer. Linear Algebra. Appl., 4 (1997), pp. 425-437.
37. R. B. LEHOUCQ AND K. MEERBERGEN, Using generalized Cayley transformations within an inexact rational Krylov sequence method, SIAM J. Matrix Anal. Appl., 20 (1998), pp. 131-148.
38. R. B. LEHOUCQ, D. C. SORENSEN, AND C. YANG, ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, SIAM, Philadelphia, 1998.
39. B. LIU, Numerical Algorithms in Chemistry: Algebraic Methods, C. Moler and I. Shavitt, eds., Technical Report LBL-8158, Lawrence Berkeley Laboratory, 1978.
40. E. LUNDSTRÖM AND L. ELDÉN, Adaptive eigenvalue computations using Newton's method on the Grassmann manifold, SIAM J. Matrix Anal. Appl., 23 (2002), pp. 819-839.
41. K. MEERBERGEN, Robust Methods for the Calculation of Rightmost Eigenvalues of Nonsymmetric Problems, Ph.D. thesis, Department of Computer Science, K. U. Leuven, Heverlee, Belgium, 1996.
42. R. B. MORGAN, On restarting the Arnoldi method for large nonsymmetric eigenvalue problems, Math. Comput., 65 (1996), pp. 1213-1230.
43. R. B. MORGAN AND D. S. SCOTT, Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices, SIAM J. Sci. Comput., 7 (1986), pp. 817-825.
44. C. W. MURRAY, S. C. RACINE, AND E. R. DAVIDSON, Improved algorithms for the lowest eigenvalues and associated eigenvectors of large matrices, J. Comput. Phys., 103 (1992), pp. 382-389.
45. J. NOCEDAL AND S. J. WRIGHT, Numerical Optimization, Springer-Verlag, New York, 1999.
46. Y. NOTAY, Combination of Jacobi-Davidson and conjugate gradients for the partial symmetric eigenproblem, Numer. Linear Algebra Appl., 9 (2002), pp. 21-44.
47. Y. NOTAY, Is Jacobi-Davidson faster than Davidson?, SIAM J. Matrix Anal. Appl., 26 (2005), pp. 522-543.
48. J. OLSEN, P. JØRGENSEN, AND J. SIMONS, Passing the one-billion limit in full configuration-interaction (FCI) calculations, Chem. Phys. Lett., 169 (1990), pp. 463-472.
49. E. OVTCHINNIKOV, Convergence estimates for the generalized Davidson method for symmetric eigenvalue problems I: The preconditioning aspect, SIAM J. Numer. Anal., 41 (2003), pp. 258-271.
50. E. OVTCHINNIKOV, Convergence estimates for the generalized Davidson method for symmetric eigenvalue problems II: The subspace acceleration, SIAM J. Numer. Anal., 41 (2003) pp. 272-286.
51. C. C. PAIGE AND M. A. SAUNDERS, Solution of sparse indefinite systems of linear equations, SIAM J. Numer. Anal., 12 (1975), pp. 617-629.
52. B. N. PARLETT, The Symmetric Eigenvalue Problem, SIAM, Philadelphia, 1998.
53. A. RUHE AND T. WIBERG, The method of conjugate gradients used in inverse iteration, BIT, 12 (1972) pp. 543-554.
54. 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/.
55. Y. SAAD, Numerical Methods for Large Eigenvalue Problems, Manchester University Press, Manchester, UK, 1992.
56. Y. SAAD, Iterative Methods for Sparse Linear Systems, SIAM, Philadelphia, 2003.
57. A. SAMEH AND Z. TONG, The trace minimization method for the symmetric generalized eigen-value problem, J. Comput. Appl. Math., 123 (2000), pp. 155-175.
58. V. SIMONCINI AND L. ELDÉN, Inexact Rayleigh quotient-type methods for eigenvalue computations, BIT, 42 (2002), pp. 159-182.
59. 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.
60. 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.
61. G. L. G. SLEIJPEN AND FRED W. WUBS, Effective Preconditioning Techniques for Eigenvalue Problems, Technical Report 1117, Department of Mathematics, University of Utrecht, 1999.
62. P. SMIT AND M. H. C. PAARDEKOOPER, The effects of inexact solvers in algorithms for symmetric eigenvalue problems, Linear Algebra Appl., 287 (1999), pp. 337-357.
63. D. C. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
64. A. STATHOPOULOS, Some insights on restarting symmetric eigenvalue methods with Ritz and harmonic Ritz vectors, in Iterative Methods in Scientific Computation IV, IMACS, D. R. Kincaid and Anne C. Elster, eds., Rutgers University, New Brunswick, NJ, 1999, pp. 297-311.
65. A. STATHOPOULOS AND C. F. FISCHER, A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix, Comput. Phys. Commun., 79 (1994), pp. 268-290.
66. A. STATHOPOULOS AND J. R. MCCOMBS, Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory, Part II: Seeking Many Eigenvalues, Technical Report WM-CS-2006-02; submitted for publication.
67. A. STATHOPOULOS. S. ÖǦÜT, Y. SAAD, J. R. CHELIKOWSKY, AND H. KIM, Parallel methods and tools for predicting material properties, Comput. Sci. Engrg., 2 (2000), pp. 19-32.
68. A. STATHOPOULOS AND Y. SAAD, Restarting techniques for (Jacobi-)Davidson symmetric eigenvalue methods, Electron. Trans. Numer. Algebra, 7 (1998), pp. 163-181.
69. A. STATHOPOULOS, Y. SAAD, AND C. F. FISCHER, Robust preconditioning of large, sparse, symmetric eigenvalue problems, J. Comput. Appl. Math., 64 (1995), pp. 197-215.
70. 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.
71. D. B. SZYLD, Criteria for combining inverse and Rayleigh quotient iteration, SIAM J. Numer. Anal., 25 (1988), pp. 1369-1375.
72. H. A. VAN DER VORST, Iterative Krylov Methods for Large Linear Systems, Cambridge Monogr. Appl. Comput. Math. 13, Cambridge University Press, Cambridge, UK, 2003.
73. K. WU AND H. SIMON, Thick-restart Lanczos method for large symmetric eigenvalue problems, SIAM J. Matrix Anal. Appl., 22 (2000), pp. 602-616.
74. K. WU, Y. SAAD, AND A. STATHOPOULOS, Inexact newton preconditioning techniques for eigenvalue problems, Electron. Trans. Numer. Algebra, 7 (1998), pp. 202-214.
75. C. YANG, B. W. PEYTON, D. W. NOID, B. G. SUMPTER, AND R. E. TUZUN, Large-scale normal coordinate analysis for molecular structures, SIAM J. Sci. Comput., 23 (2001), pp. 563-582.