A geometric theory for preconditioned inverse iteration III: A short and sharp convergence estimate for generalized eigenvalue problems

Linear Algebra and Its Applications

Volumn 358, Issue 1-3, 2003, Pages 95-114

  Knyazev, Andrew V ^a   Neymeyr, Klaus ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Conjugate gradient; Davidson; Eigenvector; Gradient; Iterative method; Matrix free; Preconditioned eigensolver; Preconditioning; Rayleigh; Ritz; Steepest descent; Symmetric generalized eigenvalue problem

Indexed keywords

EID: 32044463478     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(01)00461-X     Document Type: Conference Paper

References (47)

1. Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst Templates for the Solution of Algebraic Eigenvalue Problems 2000 SIAM Philadelphia, PA
2. A. Basermann Parallel block ILUT/ILDLT preconditioning for sparse eigenproblems and sparse linear systems Numer. Linear Algebra Appl. 7 7-8 2000 635 648 Preconditioning techniques for large sparse matrix problems in industrial applications, Minneapolis, MN, 1999
3. L. Bergamaschi, G. Pini, and F. Sartoretto Approximate inverse preconditioning in the parallel solution of sparse eigenproblems Numer. Linear Algebra Appl. 7 3 2000 99 116
4. W. Bradbury, and R. Fletcher New iterative methods for solution of the eigenproblem Numer. Math. 9 1966 259 267
5. J. Bramble, J. Pasciak, and A. Knyazev A subspace preconditioning algorithm for eigenvector/eigenvalue computation Adv. Comput. Math. 6 1996 159 189
6. D.C. Dobson An efficient method for band structure calculations in 2D photonic crystals J. Comput. Phys. 149 2 1999 363 376
7. D.C. Dobson, J. Gopalakrishnan, and J.E. Pasciak An efficient method for band structure calculations in 3D photonic crystals J. Comput. Phys. 161 2 2000 668 679
8. E. D'yakonov Iteration methods in eigenvalue problems Math. Notes 34 1983 945 953
9. E. D'yakonov Optimization in Solving Elliptic Problems 1996 CRC Press Boco Raton, FL
10. E. D'yakonov, and M. Orekhov Minimization of the computational labor in determining the first eigenvalues of different operators Math. Notes 27 1980 382 391
11. J. Fattebert, and J. Bernholc Towards grid-based O(N) density-functional theory methods: Optimized nonorthogonal orbits and multigrid acceleation Phys. Rev. B 62 3 2000 1713 1722
12. Y. Feng, and D. Owen Conjugate gradient methods for solving the smallest eigenpair of large symmetric eigenvalue problems Internat. J. Numer. Methods Engrg. 39 1996 2209 2229
13. S. Godunov, V. Ogneva, and G. Prokopov On the convergence of the modified method of steepest descent in the calculation of eignevalues Amer. Math. Soc. Transl. Ser. 2 105 1976 111 116
14. M. Hestenes, and W. Karush A method of gradients for the calculation of the characteristic roots and vectors of a real symmetric matrix J. Res. Nat. Bur. Standards 47 1951 45 61
15. L.V. Kantorovich Functional analysis and applied mathematics Transl. Uspehi Mat. Nauk 3 6(28) 1949 89 185 National Bureau of Standards Report, Washington, 1952
16. A.V. Knyazev, Computation of eigenvalues and eigenvectors for mesh problems: algorithms and error estimates, Department of Numerical Mathematics, USSR Academy of Sciences, Moscow, 1986 (in Russian)
17. A.V. Knyazev Convergence rate estimates for iterative methods for a mesh symmetric eigenvalue problem Russian J. Numer. Anal. Math. Modelling 2 1987 371 396
18. A.V. Knyazev, On modified gradient methods for spectral problems. Differentsial'nye Uravneniya 23(4) (1987) 715-717, 735 (in Russian)
19. A.V. Knyazev A preconditioned conjugate gradient method for eigenvalue problems and its implementation in a subspace in: Eigenvertaufgaben in Natur- und Ingenieurwissenschaften und ihre numerische Behandlung, Oberwolfach, 1990 Internat. Ser. Numer. Math. vol. 96 1991 Birkhäuser Basel
20. A.V. Knyazev Preconditioned eigensolvers - an oxymoron? Electron. Trans. Numer. Anal. 7 1998 104 123
21. A.V. Knyazev Preconditioned eigensolvers: practical algorithms Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, H. van der Vorst, Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide 2000 SIAM Philadelphia, PA 352 368 Section 11.3. An extended version published as a technical report UCD-CCM 143, 1999, at the Center for Computational Mathematics, University of Colorado at Denver
22. A.V. Knyazev Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method SIAM J. Sci. Comput. 23 2 2001 517 541
23. A.V. Knyazev, K. Neymeyr, Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method. ETNA, 2001 (accepted)
24. A.V. Knyazev, K. Neymeyr, A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems, 2001. Available from http://www-math.cudenver.edu/ ccmreports/rep173.pdf, CU-Denver
25. A.V. Knyazev, and A.L. Skorokhodov On exact estimates of the convergence rate of the steepest ascent method in the symmetric eigenvalue problem Linear Algebra Appl. 154-156 1991 157 245
26. D. Longsine, and S. McCormick Simultaneous Rayleigh-quotient minimization methods for Ax=λBx Linear Algebra Appl. 34 1980 195 234
27. S. McCormick, and T. Noe Simultaneous iteration for the matrix eigenvalue problem Linear Algebra Appl. 16 1977 43 56
28. R.B. Morgan Preconditioning eigenvalues and some comparison of solvers J. Comput. Appl. Math. 123 1-2 2000 101 115 Numerical Analysis 2000, Vol. III. Linear Algebra
29. R.B. Morgan, and D.S. Scott Preconditioning the Lanczos algorithm for of sparse symmetric eigenvalue problems SIAM J. Sci. Comput. 14 3 1993 585 593
30. K. Neymeyr A geometric theory for preconditioned inverse iteration applied to a subspace Math. Comput. 71 2002 197 216
31. K. Neymeyr A geometric theory for preconditioned inverse iteration. I: Extrema of the Rayleigh quotient Linear Algebra Appl. 322 2001 61 85
32. K. Neymeyr A geometric theory for preconditioned inverse iteration. II: Convergence estimates Linear Algebra Appl. 322 2001 87 104
33. M.K. Ng Preconditioned Lanczos methods for the minimum eigenvalue of a symmetric positive definite Toeplitz matrix SIAM J. Sci. Comput. 21 6 2000 1973 1986 electronic
34. Y. Notay Combination of Jacobi-Davidson and conjugate gradients for the partial symmetric eigenproblem Numer. Linear Algebra Appl. 9 2002 21 44
35. S. Oliveira On the convergence rate of a preconditioned sunspace eigensolver Computing 63 3 1999 219 231
36. E. Ovtchinnikov, and L. Xanthis Successive eigenvalue relaxation: a new method for generalized eigenvalue problems and convergence estimates Proc. Roy. Soc. London Ser. A 457 2001 441 451
37. E.E. Ovtchinnikov, and L.S. Xanthis Effective dimensional reduction algorithm for eigenvalue problems for thin elastic structures: A paradigm in three dimensions Proc. Nat. Acad. Sci. U.S.A. 97 3 2000 967 971
38. W. Petryshyn On the eigenvalue problem Tu-λSu=0 with unbounded and non-symmetric operators T and S Philos. Trans. Roy. Soc. London Ser. A. 262 1968 413 458
39. G. Rodrigue A gradient method for the matrix eigenvalue problem Ax=λBx Numer. Math. 22 1973 1 16
40. M. Sadkane, and R.B. Sidje Implementation of a variable block Davidson method with deflation for solving large sparse eigenproblems Numer. Algorithms 20 2-3 1999 217 240
41. A. Sameh, and Z. Tong The trace minimization method for the symmetric generalized eigenvalue problem J. Comput. Appl. Math. 123 1-2 2000 155 175 Numerical Analysis 2000, Vol. III. Linear Algebra
42. B. Samokish The steepest descent method for an eigenvalue problem with semi-bounded operators Izv. Vyssh. Uchebn. Zaved. Mat. 5 1958 105 114 in Russian
43. D.S. Scott Solving sparse symmetric generalized eigenvalue problems without factorization SIAM J. Numer. Anal. 18 1981 102 110
44. G.L.G. Sleijpen, and H.A. Van der Vorst A Jacobi-Davidson iteration method for linear eigenvalue problem SIAM J. Matrix Anal. Appl. 17 2 1996 401 425
45. P. Smit, and M.H.C. Paardekooper The effects of inexact solvers in algorithms for symmetric eigenvalue problems Linear Algebra Appl. 287 1-3 1999 337 357 Special issue celebrating the 60th birthday of Ludwig Elsner
46. X. Yang A survey of various conjugate gradient algorithms for iterative solution of the largest/smallest eigenvalue and eigenvector of a symmetric matrix, Collection: Application of conjugate grdient method to electro-magnetic and signal analysis Progr. Electromagnetic Res. 5 1991 567 588
47. T. Zhang, G.H. Golub, and K.H. Law Subspace iterative methods for eigenvalue problems Linear Algebra Appl. 294 1-3 1999 239 258