Nearly optimal preconditioned methods for hermitian eigenproblems under limited memory. Part II: Seeking many eigenvalues

SIAM Journal on Scientific Computing

Volumn 29, Issue 5, 2007, Pages 2162-2188

  Stathopoulos, Andreas ^a   McCombs, James R ^a  

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

Author keywords

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

Indexed keywords

ARPACK; CONJUGATE GRADIENT; EIGEN-VALUE; EIGENPAIRS; JACOBI- DAVIDSON; NEWTON; OPTIMAL METHODS; OPTIMALITY; PRECONDITIONING; TYPE METHODS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 42949127077     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/060661910     Document Type: Conference Paper

References (61)

1. P.-A. ABSIL, C. G. BAKER, AND K. A. GALLIVAN, A truncated-CG style method for symmetric generalized eigenvalue problems, J. Comput. Appl. Math., 189 (2006), pp. 274-285.
2. P.-A. ABSIL, R. MAHONY, R. SEPULCHREC, AND P. VAN DOOREN, A Grassmann-Rayleigh quotient iteration for computing invariant subspaces, SIAM Rev., 44 (2002), pp. 57-73.
3. 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.
4. P. ARBENZ, R. GEUS, AND S. ADAM, Solving Maxwell eigenvalue problems for accelerating cavities, Phys. Rev. S T Accel. Beams, 4 (2001), 022001.
5. P. ARBENZ, U. L. HETMANIUK, R. B. LEHOUCQ, AND R. S. TUMINARO, A comparison of eigensolvers for large-scale 3FD modal analysis using AMG'preconditioned iterative methods, Internat. J. Numer. Methods Engrg., 64 (2005), pp. 204-236.
6. Z. BAI, J. DEMMEL, J. DONGARRA, A. RUHE, AND H. van der VVVORST, eds., Templates for the Solvtion of Algebraic Eigenvalue Problems: A Practical Guide, Software Environ. Tools 11, SIAM, Philadelphia, 2000.
7. T. F. CHAN AND W. L. WAN, Analysis of projection methods for solving linear systems with multiple right-hand sides, SIAM J. Sci. Comput., 18 (1997), pp. 1698-1721.
8. J. CULLUM AND W. E. DONATH, A block Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace of large, sparse, symmetric matrices, in Proceedings of the 1974 IEEE Conference on Decision and Control, IEEE Control Systems Society, Piscataway, N J, 1974, pp. 505-509.
9. J. CULLUM AND R. A. WILLOUGHBY, Lánczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. 2, Programs, Progress in Scientific Computing 4, Birkhäuser Boston, Boston, 1985.
10. 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.
11. T. DAVIS, University of Florida Sparse Matrix Collection, Technical report, University of Florida, Gainesville, FL. 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.
12. R. S. DEMBO, S. C. EISENSTAT, AND T. STEIHAUG, Inexact Newton methods, SIAM J. Numer. Anal., 19 (1982), pp. 400-408.
13. E. G. D'YAKONOV, Iteration methods in eigenvalue problems, Math. Notes, 34 (1983), pp. 945-953.
14. A. EDELMAN. T. A. ARIAS, AND S. T. SMITH, The geometry of algorithms with orthogonality constraints, SIAM J. Matrix Anal. Appl., 20 (1998), pp. 303-353.
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. 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.
17. R. GEUS, JDBSYM, http://people.web.psi.ch/geus/software. html.
18. P. H. GILL, W. MURRAY, AND M. H. WRIGHT, Practical Optimization, Academic Press, New York, 1986.
19. G. H. GOLUB AND R. UNDERWOOD, The block Lanczos method for computing eigenvalues, in Mathematical Software III, J. R. Rice, ed., Academic Press, New York, 1977, pp. 361-377.
20. G. H. GOLUB AND Q. Ye, Inexact inverse iteration for generalized eigenvalue problems, BIT, 40 (2000), pp. 671-684.
21. 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.
22. M. H. GUTKNECHT, Block Krylov Space Solvers: A Survey, http://www.sam.math.ethz.ch/~mhg/talks/bkss.pdf.
23. M. H. GUTKNECHT, Block Krylov space methods for linear systems with multiple right-hand sides: An introduction, in Modern Mathematical Models, Methods and Algorithms for Real World Systems, Anamaya Publishers, New Delhi, India, 2006.
24. M. E. HOCHSTENBACH AND Y. NOTAY, Controlling Inner Iterations in the Jacobi-Davidson Method, CASA report 07-01, Department of Mathematics, TU Eindhoven, Eindhoven, The Netherlands, 2007. Submitted.
25. Z. Jia, A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems, Linear Algebra Appl., 270 (1998), pp. 171-189.
26. M. E. KILMER AND E. de STURLER, Recycling subspace information for diffuse optical tomography, SIAM J. Sci. Comput., 27 (2006), pp. 2140-2166.
27. A. V. KNYAZEV, BLOPEX, http://www-math.cudenver.edu/ ~aknyazev/software/BLOPEX.
28. A. V. KNYAZEV, Convergence rate estimates for iteratime methods for symmetric eigenvalue problems and its implementation in a subspace, in Eigenwertaufgaben in Natur- und Ingenieurwissenschaften und ihre numerische Behandlung (Oberwolfach, 1990), Internat. Ser. Numer. Math. 96, Birkhauser, Basel, 1991, pp. 143-154.
29. A. V. KNYAZEV, Preconditioned eigensolvers-an oxymoron?, Electron. Trans. Numer. Anal., 7 (1998), pp. 104-123.
30. A. V. KNYAZEV, Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method, SIAM J. Sci. Comput., 23 (2001), pp. 517-541.
31. 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.
32. R. B. LEHOUCQ, Implicitly restarted Arnoldi methods and subspace iteration, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 551-562.
33. R. B. LEHOUCQ, D. C. SORENSEN, AND C. YANG, ARPACK Users' Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, Software Environ. Tools 6, SIAM, Philadelphia, 1998.
34. J. R. MCCOMBS AND A. STATHOPOULOS, PRIMME: PReconditioned Iterative Multimethod Eigensolver, http://www.cs.wm.edu/ ~andreas/software/.
35. R. B. MORGAN, Computing interior eigenvalues of large matrices, Linear Algebra Appl., 154 (1991), pp. 289-309.
36. R. B. MORGAN, On restarting the Arnoldi method for large nonsymmetric eigenvalue problems, Math. Comput., 65 (1996), pp. 1213-1230.
37. R. B. MORGAN AND D. S. SCOTT, Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices, SIAM J. Sci. Stat. Comput., 7 (1986), pp. 817-825.
38. R. B. MORGAN AND D. S. SCOTT, Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems, SIAM J. Sci. Comput., 14 (1993), pp. 585-593.
39. 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.
40. J. NOCEDAL AND S. J. WRIGHT, Numerical Optimization, Springer-Verlag, New York, 1999.
41. Y. NOTAY, Combination of Jacobi-Davidson and conjugate gradients for the partial symmetric eigenproblem, Numer. Linear Algebra Appl., 9 (2002), pp. 21-44.
42. Y. NOTAY, Is Jacobi-Davidson faster than Davidson?, SIAM J. Matrix Anal. Appl., 26 (2005), pp. 522-543.
43. J. OLSEN, P. JØRGENSEN, AND J. SIMONS, Passing the one-billion limit in full configurationinteraction (FCI) calculations, Chem. Phys. Lett., 169 (1990), pp. 463-472.
44. C. C. PAIGE. B. N. PARLETT, AND VAN DER VORST, Approximate solutions and eigenvalue bounds from Krylov spaces, Numer. Linear Algebra Appl., 2 (1995), pp. 115-133.
45. B. N. PARLETT, The Symmetric Eigenvalue Problem, Classics Appl. Math. 20, SIAM, Philadelphia, 1997.
46. A. RUHE AND T. WIBERG, The method of conjugate gradients used in inverse iteration, BIT, 12 (1972), pp. 543-554.
47. 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/.
48. A. SAMEH AND Z. TONG, The trace minimization method for the symmetric generalized eigenvalue problem, J. Comput. Appl. Math., 123 (2000), pp. 155-175.
49. V. SIMONCINI AND L. ELDEN, Inexact Rayleigh quotient-type methods for eigenvalue computations, BIT, 42 (2002), pp. 159-182.
50. V. SIMONCINI AND E. GALLOPOULOS, An iterative method for nonsymmetric systems with multiple right-hand sides, SIAM J. Sci. Comput., 16 (1995), pp. 917-933.
51. 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.
52. 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. Special issue celebrating the 60th birthday of Ludwig Eisner.
53. D. C. SORENSEN, Implicit application of polynomial filters in a K-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
54. A. STATHOPOULOS AND Y. SAAD, Restarting techniques for (Jacobi-)Davidson symmetric eigenvalue methods, Electr. Trans. Numer. Anal., 7 (1998), pp. 163-181.
55. 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.
56. 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.
57. A. STATHOPOULOS, Nearly optimal preconditioned methods for Hermitian eigenproblems under limited memory. Part I: Seeking one eigenvalue, SIAM J. Sci. Comput., 29 (2007), pp. 481-514.
58. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, England, 1965.
59. K. WU AND H. SIMON, Thick-restart Lanczos method for large symmetric eigenvalue problems, SIAM J. Matrix Anal. Appl., 22 (2000), pp. 602-616.
60. Y. ZHOU. Y. SAAD, M. L. TIAGO, AND J. R. CHELIKOWSKY, Self-consistent-field calculations using Chebyshev-filtered subspace iteration, J. Comput. Phys., 219 (2006), pp. 172-184.
61. Y. ZHOU, Studies on Jacobi-Davidson, Rayleigh quotient iteration, inverse iteration generalized Davidson and Newton updates, Numer. Linear Algebra Appl., 13 (2006), pp. 621-642.