Preconditioned eigensolvers - An oxymoron?

Electronic Transactions on Numerical Analysis

Volumn 7, Issue , 1998, Pages 104-123

  Knyazev, Andrew V ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

Conjugate gradient; Davidson's method; Domain decomposition; Eigensolver; Eigenvalue; Eigenvector; Iterative methods; Preconditioner

Indexed keywords

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

References (87)

1. A. ABRAMOW AND M. NEUHAUS, Bemerkungen über Eigenwertprobleme von Matrizen höherer Ordnung, in Les mathématiques de l'ingénieur, Mém, Publ. Soc. Sci. Arts Lett. Hainaut, vol. hors Série (1958), pp. 176-179.
2. N. V. BANICHUK, Problems and methods of optimal structural design, Math. Concepts Methods Sci. Engng., 26, Plenum Press, New York, 1983.
3. LUCA BERGAMASCHI, GIUSEPPE GAMBOLATI AND GIORGIO PINI, Asymptotic convergence of conjugate gradient methods for the partial symmetric eigenproblem, Numer. Linear Algebra Appl., 4(2) (1997), pp. 69-84.
4. A. N. BESPALOV AND YU. A. KUZNETSOV, RF cavity computations by the domain decomposition and fictitious component methods, Soviet J. Numer. Anal. Math. Modeling, 2(4) (1987), pp. 259-278.
5. F. BOURQUIN, Analysis and comparison of several component mode synthesis methods on one-dimensional domains, Numer. Math., 58(1) (1990), pp. 11-33.
6. _, Component mode synthesis and eigenvalues of second order operators: discretization and algorithm, RAIRO Modél. Math. Anal. Numér., 26(3) (1992), pp. 385-423.
7. _, A domain decomposition method for the eigenvalue problem in elastic multistructures, Asymptotic methods for elastic structures (Lisbon, 1993), de Gruyter, Berlin, 1995, pp. 15-29.
8. JAMES H. BRAMBLE, JOSEPH E. PASCIAK, AND ANDREW V. KNYAZEV, A subspace preconditioning algorithm for eigenvector/eigenvalue computation, Adv. Comput. Math., 6(2) (1996), pp. 159-189.
9. ZHI HAO CAO, Generalized Rayleigh quotient matrix and block algorithm for solving large sparse symmetric generalized eigenvalue problems, Numer. Math. J. Chinese Univ., 5(4) (1983), pp. 342-348.
10. ZHIQIANG CAI, JAN MANDEL AND STEVE MCCORMICK, Multigrid methods for nearly singular linear equations and eigenvalue problems, SIAM J. Numer. Anal., 34(1) (1997), pp. 178-200.
11. R. R. CRAIG, JR., Review of time domain and frequency domain component mode synthesis methods, in Design Methods for Two-Phase Flow in Turbomachinery, New York, ASME, 1985.
12. M. CROUZEIX, B. PHILIPPE AND M. SADKANE, The Davidson method, SIAM J. Sci. Comput., 15(1) (1994), pp. 62-76.
13. J. K. CULLUM AND R. A. WILLOUGHBY, Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Birkhäuser, Boston, 1985.
14. D. F. DAVIDENKO, The method of variation of parameters as applied to the computation of eigenvalues and eigenvectors of matrices, Soviet Math. Dokl., 1 (1960), pp. 364-367.
15. 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. 817-825.
16. _, Matrix eigenvector methods, G. H. F. Direcksen and S. Wilson, eds., Methods in Computational Molecular Physics, Reidel, Boston, 1983, pp. 95-113.
17. I. S. DUFF, R. G. GRIMES AND J. G. LEWIS, Sparse matrix test problems. ACM Trans. Math. Software, 15 (1989), pp. 1-14.
18. E. G. D'YAKONOV, Iteration methods in eigenvalue problems, Math. Notes, 34 (1983), pp. 945-953.
19. E. G. D'YAKONOV AND A. V. KNYAZEV, Group iterative method for finding lower-order eigenvalues, Moscow University, Ser. 15, Comput. Math. Cybernetics, 2 (1982), pp. 32-40.
20. _, On an iterative method for finding lower eigenvalues, Russian J. of Numer. Anal. Math. Modeling, 7(6) (1992), pp. 473-486.
21. E. G. D'YAKONOV AND M. YU. OREKHOV, Minimization of the computational labor in determining the first eigenvalues of differential operators, Math. Notes, 27(5-6) (1980), pp. 382-391.
22. _, Optimization in solving elliptic problems, CRC Press, Boca Raton, FL, 1996.
23. T. ARIAS, A. EDELMAN, AND S. SMITH, Curvature in Conjugate Gradient Eigenvalue Computation with Applications to Materials and Chemistry Calculations, in Proceedings of the 1994 SIAM Applied Linear Algebra Conference, J.G. Lewis, ed., SIAM, Philadelphia, (1994), pp. 233-238.
24. Y. T. FENG AND D. R. J. OWEN, Conjugate gradient methods for solving the smallest eigenpair of large symmetric eigenvalue problems, Internat. J. Numer. Methods Engrg., 39(13) (1996), pp. 2209-2229.
25. GIUSEPPE GAMBOLATI, GIORGIO PINI AND MARIO PUTTI, Nested iterations for symmetric eigenproblems, SIAM J. Sci. Comput., 16(1) (1995), pp. 173-191.
26. GIUSEPPE GAMBOLATI, FLAVIO SARTORETTO AND PAOLO FLORIAN, An orthogonal accelerated deflation technique for large symmetric eigenproblems, Comput. Methods Appl. Mech. Engrg., 94(1) (1992), pp. 13-23.
27. S. K. GODUNOV, V. V. OGNEVA, AND G. K. PROKOPOV, On the convergence of the modified steepest descent method in application to eigenvalue problems, in American Mathematical Society Translations. Ser. 2. Vol. 105. (English) Partial differential equations in Proceedings of a symposium dedicated to Academician S. L. Sobolev, American Mathematical Society, Providence, RI, (1976), pp. 77-80.
28. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, John Hopkins University Press, Baltimore, MD, 1983.
29. ROGER G. GRIMES, JOHN G. LEWIS AND HORST D. SIMON, A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems, SIAM J. Matrix Anal. Appl., 15(1) (1994), pp. 228-272.
30. S. M. GRZEGÓRSKI, On the scaled Newton method for the symmetric eigenvalue problem, Computing, 45(3), (1990), pp. 277-282.
31. LIANG JIAO HUANG AND TIEN-YIEN LI, Parallel homotopy algorithm for symmetric large sparse eigenproblems, J. Comput. Appl. Math., 60(1-2) (1995), pp. 77-100. Linear/nonlinear iterative methods and verification of solution (Matsuyama, 1993).
32. K. HIRAO AND H. NAKATSUJI, A generalization of the Davidson's method to large nonsymmetric eigenvalue problem, J. Comput. Phys, 45(2) (1982), pp. 246-254.
33. V. P. IL'IN, Numerical Methods of Solving Electrophysical Problems, Nauka, Moscow, 1985, in Russian.
34. A. V. KNYAZEV, Some two-step methods for finding the boundaries of the spectrum of a linear matrix pencil, Technical Report 3749/16, Kurchatov's Institute of Atomic Energy, Moscow, 1983, in Russian.
35. _, Computation of eigenvalues and eigenvectors for mesh problems: algorithms and error estimates, Dept. Numerical Math. USSR Academy of Sciences, Moscow, 1986, in Russian.
36. _, Convergence rate estimates for iterative methods for mesh symmetric eigenvalue problem, Soviet J. Numer. Anal. Math. Modeling, 2(5) (1987), pp. 371-396.
37. _, Methods for the derivation of some estimates in a symmetric eigenvalue problem, in Computational Processes and Systems, Gury I. Marchuk, ed., Computational Processes and Systems, No. 5, Nauka, Moscow, 1987, pp. 164-173, in Russian.
38. _, Modified gradient methods for spectral problems, Differ. Uravn., 23(4) (1987), pp. 715-717, in Russian.
39. _, A preconditioned conjugate gradient method for eigenvalue problems and its implementation in a subspace, in International Ser. Numerical Mathematics, v. 96, Eigenwertaufgaben in Natur-und Ingenieurwissenschaften und ihre numerische Behandlung, Oberwolfach, (1990), pp. 143-154.
40. _, New estimates for Ritz vectors, Math. Comp., 66(219) (1997), pp. 985-995.
41. A. V. KNYAZEV AND I. A. SHARAPOV, Variational Rayleigh quotient iteration methods for symmetric eigenvalue problem, East-West J. of Numer. Math., 1(2) (1993), pp. 121-128.
42. A. V. KNYAZEV AND A. L. SKOROKHODOV, On the convergence rate of the steepest descent method in euclidean norm, USSR J. Comput. Math. and Math. Physics, 28(5) (1988), pp. 195-196.
43. _, Preconditioned iterative methods in subspace for solving linear systems with indefinite coefficient matrices and eigenvalue problems, Soviet J. Numer. Anal. Math. Modeling, 4(4) (1989), pp. 283-310.
44. _, On exact estimates of the convergence rate of the steepest ascent method in the symmetric eigenvalue problem, Linear Algebra Appl., 154-156 (1991), pp. 245-257.
45. _, The preconditioned gradient-type iterative methods in a subspace for partial generalized symmetric eigenvalue problem, Soviet Math. Doklady, 45(2) (1993), pp. 474-478.
46. _, The preconditioned gradient-type iterative methods in a subspace for partial generalized symmetric eigenvalue problem, SIAM J. Numer. Anal., 31(4) (1994), pp. 1226-1239.
47. N. KOSUGI, Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of a large real symmetric matrix, J. Comput. Phys., 55(3) (1984), pp. 426-436.
48. YU. A. KUZNETSOV, Iterative methods in subspaces for eigenvalue problems, in Vistas in Appl. Math., Numer. Anal., Atmospheric Sciences, Immunology, A. V. Balakrishinan, A. A. Dorodnitsyn and J. L. Lions, eds., Optimization Software, Inc., New York, 1986, pp. 96-113.
49. V. I. LEBEDEV, Metod kompozitsii [Method of Composition], Akad. Nauk SSSR Otdel Vychisl. Mat., Moscow, 1986, in Russian.
50. S. H. LUI AND G. H. GOLUB, Homotopy method for the numerical solution of the eigenvalue problem of self-adjoint partial differential operators, Numer. Algorithms, 10(3-4) (1995), pp. 363-378.
51. V. G. LITVINOV, Optimization in elliptic boundary value problems with applications to mechanics, Nauka, Moscow, 1987, in Russian.
52. D. E. LONGSINE AND S. F. MCCORMICK, Simultaneous Rayleigh-quotient minimization methods for Λcursive Greek χ = λΒcursive Greek χ., Linear Algebra and Applications, 34 (1980), pp. 195-234.
53. S. H. LUI, H. B. KELLER AND T. W. C. KWOK, Homotopy method for the large, sparse, real nonsymmetric eigenvalue problem, SIAM J. Matrix Anal. Appl., 18(2) (1997), pp. 312-333.
54. JENN-CHING LUO, Solving eigenvalue problems by implicit decomposition, Numer. Methods Partial Differential Equations, 7(2) (1991), pp¿ 113-145.
55. _, A domain decomposition method for eigenvalue problems, in Fifth International Symposium on Domain Decomposition Methods for Partial Differential Equations, Norfolk, VA, 1991, SIAM, Philadelphia, PA (1992), pp. 306-321.
56. S. YU. MALIASSOV, On the Schwarz alternating method for eigenvalue problems, Russian J. Numer. Anal. Math. Modeling, 13(1) (1998), pp. 45-56.
57. JAN MANDEL, CHARBEL FARHAT, AND XIAO-CHUAN CAI, eds., Domain Decomposition Methods 10, Contemp. Math., volume 218, American Mathematical Society, Providence, RI, 1998.
58. V. P. MASLOV, Asimptoticheskie metody i teoriya vozmushcheniǐ [Asymptotic methods and perturbation theory], Nauka, Moscow, 1988, in Russian.
59. S. F. MCCORMICK AND T. NOE, Simultaneous iteration for the matrix eigenvalue problem, Linear Algebra Appl., 16(1) (1977), pp. 43-56.
60. ARND MEYER, Modern algorithms for large sparse eigenvalue problems, Math. Res., volume 34, Akademie-Verlag, Berlin, 1987.
61. R. B. MORGAN, Davidson's method and preconditioning for generalized eigenvalue problems, J. Comp. Phys., 89 (1990), pp. 241-245.
62. R. B. MORGAN AND D. S. SCOTT, Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 817-825.
63. [63 ] _, Preconditioning the Lanczos algorithm for of sparse symmetric eigenvalue problems, SIAM J. Sci. Comput., 14(3) (1993), pp. 585-593.
64. YU. M. NECHEPURENKO, The singular function method for computing the eigenvalues of polynomial matrices, Comput. Math. Math. Phys., 35(5) (1995), pp. 507-517.
65. W. V. PETRYSHYN, On the eigenvalue problem Tu - λSu = 0 with unbounded and non-symmetric operators T and S, Philos. Trans. R. Soc. Math. Phys. Sci., 262 (1968), pp. 413-458.
66. V. G. PRIKAZCHIKOV, Prototypes of iteration methods of solving an eigenvalue problem, Differential Equations, 16 (1981), pp. 1098-1106.
67. _, Steepest descent in a spectral problem, Differentsialnye Uravneniya, 22(7) (1986), pp. 1268-1271, 1288, in Russian.
68. V. G. PRIKAZCHIKOV AND A. N. KHIMICH, Iterative method for solving stability and oscillation problems for plates and shells, Sov. Appl. Mech., 20 (1984), pp. 84-89.
69. AKSEL RUÈ, Krylov rational sequence methods for computing eigenvalues, in Computational methods in linear algebra, Moscow, (1982), pp. 203-218, in Russian, Akad. Nauk SSSR Otdel Vychisl. Mat., Moscow, 1983, in Russian.
70. AXEL RUHE, SOR-methods for the eigenvalue problem with large sparse matrices, Math. Comput., 28(127) (1974), pp. 695-710.
71. _, Iterative eigenvalue algorithm based on convergent splittings, J. Comp. Phys., 19(1) (1975), pp. 110-120.
72. _, Rational Krylov: a practical algorithm for large sparse nonsymmetric matrix pencils, SIAM J. Sci. Comput., 19(5) (1998), pp. 1535-1551, (electronic).
73. Y. SAAD, Numerical Methods for Large Eigenvalue Problems. Halsted Press, NY, 1992.
74. M. SADKANE, Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems, Numer. Math., 64(2) (1993), pp. 195-211.
75. B. A. SAMOKISH, The steepest descent method for an eigenvalue problem with semi-bounded operators, Izvestiya Vuzov, Math., 5 (1958), pp. 105-114, in Russian.
76. G. V. SAVINOV, Investigation of the convergence of a generalized method of conjugate gradients for determining the extremal eigenvalues of a matrix, Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI), 111 (1981), pp. 145-150, 237.
77. D. S. SCOTT, Solving sparse symmetric generalized eigenvalue problems without factorization, SIAM J. Numer. Anal., 18 (1981), pp. 102-110.
78. N. S. SEHMI, Large order structural eigenanalysis techniques, Ellis Horwood Series: Mathematics and its Applications. Ellis Horwood Ltd., Chichester, 1989.
79. V. A. SHISHOV, A method for partitioning a high order matrix into blocks in order to find its eigenvalues, USSR Comput. Math. Math. Phys., 1(1) (1961), pp. 186-190.
80. A. SIMPSON AND B. TABARROK, On Kron's eigenvalue procedure and related methods of frequency analysis, Quart. J. Mech. Appl. Math., 21 (1968), pp. 1-39.
81. GERARD L. G. SLEIJPEN AND HENK A. VAN DER VORST, A Jacobi-Davidson iteration method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl., 17(2) (1996), pp. 401-425.
82. E. SUETOMI AND H. SEKIMOTO, Conjugate gradient like methods and their application to eigenvalue problems for neutron diffusion equation, Annals of Nuclear Energy, 18(4) (1991), p. 205.
83. DANIEL B. SZYLD AND OLOF B. WIDLUND, Applications of conjugate gradient type methods to eigenvalue calculations, in Advances in computer methods for partial differential equations, III, Proc. Third IMACS Internat. Sympos., Lehigh Univ., Bethlehem, PA, 1979, pp. 167-173.
84. HENK VAN DER VORST, Subspace iteration for eigenproblems, CWI Quarterly, 9(1-2) (1996), pp. 151-160.
85. H. YANG, Conjugate gradient methods for the Rayleigh quotient minimization of generalized eigenvalue problems, Computing, 51(1) (1993), pp. 79-94.
86. T. ZHANG, K. H. LAW AND G. H. GOLUB, On the homotopy method for perturbed symmetric generalized eigenvalue problems, SIAM J. Sci. Comput., 19(5) (1998), pp. 1625-1645 (electronic).
87. P. F. ZHUK AND V. G. PRIKAZCHIKOV, An effective estimate of the convergence of an implicit iteration method for eigenvalue problems, Differential Equations, 18 (1983), pp. 837-841, 1983.