Previous |  Up |  Next

Article

Title: On the subspace projected approximate matrix method (English)
Author: Brandts, Jan H.
Author: Reis da Silva, Ricardo
Language: English
Journal: Applications of Mathematics
ISSN: 0862-7940 (print)
ISSN: 1572-9109 (online)
Volume: 60
Issue: 4
Year: 2015
Pages: 421-452
Summary lang: English
.
Category: math
.
Summary: We provide a comparative study of the Subspace Projected Approximate Matrix method, abbreviated SPAM, which is a fairly recent iterative method of computing a few eigenvalues of a Hermitian matrix $A$. It falls in the category of inner-outer iteration methods and aims to reduce the costs of matrix-vector products with $A$ within its inner iteration. This is done by choosing an approximation $A_0$ of $A$, and then, based on both $A$ and $A_0$, to define a sequence $(A_k)_{k=0}^n$ of matrices that increasingly better approximate $A$ as the process progresses. Then the matrix $A_k$ is used in the $k$th inner iteration instead of $A$. In spite of its main idea being refreshingly new and interesting, SPAM has not yet been studied in detail by the numerical linear algebra community. We would like to change this by explaining the method, and to show that for certain special choices for $A_0$, SPAM turns out to be mathematically equivalent to known eigenvalue methods. More sophisticated approximations $A_0$ turn SPAM into a boosted version of Lanczos, whereas it can also be interpreted as an attempt to enhance a certain instance of the preconditioned Jacobi-Davidson method. Numerical experiments are performed that are specifically tailored to illustrate certain aspects of SPAM and its variations. For experiments that test the practical performance of SPAM in comparison with other methods, we refer to other sources. The main conclusion is that SPAM provides a natural transition between the Lanczos method and one-step preconditioned Jacobi-Davidson. (English)
Keyword: Hermitian eigenproblem
Keyword: Ritz-Galerkin approximation
Keyword: subspace projected approximate matrix
Keyword: Lanczos method
Keyword: Jacobi-Davidson method
MSC: 65F10
MSC: 65F35
idZBL: Zbl 06486919
idMR: MR3396473
DOI: 10.1007/s10492-015-0104-8
.
Date available: 2015-06-30T12:07:17Z
Last updated: 2020-07-02
Stable URL: http://hdl.handle.net/10338.dmlcz/144316
.
Reference: [1] Bai, Z., Demmel, J., Dongarra, J., Ruhe, A., (eds.), H. van der Vorst: Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide.Software-Environments-Tools. 11 SIAM, Philadelphia (2000). Zbl 0965.65058, MR 1792141
Reference: [2] Bauer, F. L., Fike, C. T.: Norms and exclusion theorems.Numer. Math. 2 (1960), 137-141. Zbl 0101.25503, MR 0118729, 10.1007/BF01386217
Reference: [3] Beattie, C.: Harmonic Ritz and Lehmann bounds.ETNA, Electron. Trans. Numer. Anal. 7 18-39 (1998). Zbl 0918.65027, MR 1665476
Reference: [4] Brandts, J.: The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action.Linear Algebra Appl. 358 335-365 (2003). Zbl 1030.65022, MR 1942737
Reference: [5] Brandts, J., Silva, R. R. da: A subspace-projected approximate matrix method for systems of linear equations.East Asian J. Appl. Math. 3 120-137 (2013). Zbl 1287.65021, MR 3109561, 10.4208/eajam.070213.280513a
Reference: [6] Chen, W., Poirier, B.: Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. II: QMR linear solver.J. Comput. Phys. 219 (2006), 198-209. Zbl 1106.65025, MR 2273374, 10.1016/j.jcp.2006.03.031
Reference: [7] Ciarlet, P. G., (eds.), J. L. Lions: Handbook of Numerical Analysis. Volume II: Finite Element Methods (Part 1).North-Holland, Amsterdam (1991). Zbl 0712.65091, MR 1115235
Reference: [8] Crouzeix, M., Philippe, B., Sadkane, M.: The Davidson method.SIAM J. Sci. Comput. 15 62-76 (1994). Zbl 0803.65042, MR 1257154, 10.1137/0915004
Reference: [9] Davidson, E. R.: The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices.J. Comput. Phys. 17 87-94 (1975). Zbl 0293.65022, MR 0381271, 10.1016/0021-9991(75)90065-0
Reference: [10] Genseberger, M., Sleijpen, G. L. G.: Alternative correction equations in the Jacobi-Davidson method.Numer. Linear Algebra Appl. 6 (1999), 235-253. Zbl 0983.65047, MR 1706333, 10.1002/(SICI)1099-1506(199904/05)6:3<235::AID-NLA166>3.0.CO;2-8
Reference: [11] Golub, G. H., Vorst, H. A. van der: Eigenvalue computation in the 20th century.J. Comput. Appl. Math. 123 (2000), 35-65. MR 1798518, 10.1016/S0377-0427(00)00413-1
Reference: [12] Golub, G. H., Loan, C. F. van: Matrix Computations.The Johns Hopkins Univ. Press Baltimore (1996). MR 1417720
Reference: [13] Győrffy, W., Seidler, P., Christiansen, O.: Solving the eigenvalue equations of correlated vibrational structure methods: preconditioning and targeting strategies.J. Chem. Phys. 131 (2009), 024108. 10.1063/1.3154382
Reference: [14] Jia, Z., Stewart, G. W.: An analysis of the Rayleigh-Ritz method for approximating eigenspaces.Math. Comput. 70 637-647 (2001). Zbl 0968.65020, MR 1697647, 10.1090/S0025-5718-00-01208-4
Reference: [15] Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators.J. Research Nat. Bur. Standards 45 (1950), 255-282. MR 0042791, 10.6028/jres.045.026
Reference: [16] Medvedev, D. M., Gray, S. K., Wagner, A. F., Minkoff, M., Shepard, R.: Advanced software for the calculation of thermochemistry, kinetics, and dynamics.J. Phys.: Conf. Ser. 16 (2005), 247-251.
Reference: [17] Morgan, R. B., Scott, D. S.: Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices.SIAM J. Sci. Stat. Comput. 7 (1986), 817-825. Zbl 0602.65020, MR 0848565, 10.1137/0907054
Reference: [18] Paige, C. C., Saunders, M. S.: Solution of sparse indefinite systems of linear equations.SIAM J. Numer. Anal. 12 (1975), 617-629. Zbl 0319.65025, MR 0383715, 10.1137/0712047
Reference: [19] Parlett, B. N.: The Symmetric Eigenvalue Problem.Classics in Applied Mathematics 20 SIAM, Philadelphia (1998). Zbl 0885.65039, MR 1490034
Reference: [20] Ribeiro, F., Lung, C., Leforestier, C.: A Jacobi-Wilson description coupled to a block-Davidson algorithm: an efficient scheme to calculate highly excited vibrational levels.J. Chem. Phys. 123 (2005), 054106.
Reference: [21] Shepard, R., Wagner, A. F., Tilson, J. L., Minkoff, M.: The subspace projected approximate matrix (SPAM) modification of the Davidson method.J. Comput. Phys. (2001), 172 472-514. Zbl 0986.65027, MR 1857613
Reference: [22] Sleijpen, G. L. G., Eshof, J. van den: On the use of harmonic Ritz pairs in approximating internal eigenpairs.Linear Algebra Appl. 358 115-137 (2003). MR 1942726
Reference: [23] Sleijpen, G. L. G., Vorst, H. A. van der: A Jacobi-Davidson iteration method for linear eigenvalue problems.SIAM J. Matrix Anal. Appl. 17 (1996), 401-425. MR 1384515, 10.1137/S0895479894270427
Reference: [24] Sleijpen, G. L. G., Vorst, H. A. van der: The Jacobi-Davidson method for eigenvalue problems and its relation with accelerated inexact Newton schemes.Iterative Method in Linear Algebra II S. D. Margenov, P. S. Vassilevski IMACS Ann. Comput. Appl. Math. 3 (1996), 377-389.
Reference: [25] Sleijpen, G. L. G., Vorst, H. A. van der: A Jacobi-Davidson iteration method for linear eigenvalue problems.SIAM Rev. 42 267-293 (2000). MR 1778354, 10.1137/S0036144599363084
Reference: [26] Sorensen, D. C.: Implicit application of polynomial filters in a $k$-step Arnoldi method.SIAM J. Matrix Anal. Appl. 13 (1992), 357-385. Zbl 0763.65025, MR 1146670, 10.1137/0613025
Reference: [27] Stewart, G. W.: Matrix Algorithms. Vol. 2: Eigensystems.SIAM, Philadelphia (2001). Zbl 0984.65031, MR 1853468
Reference: [28] Stewart, G. W.: A Krylov-Schur algorithm for large eigenproblems.SIAM J. Matrix Anal. Appl. 23 (2002), 601-614 addendum ibid. 24 599-601 (2002). MR 1896808, 10.1137/S0895479800371529
Reference: [29] Stewart, G. W., Sun, J. G.: Matrix Perturbation Theory.Computer Science and Scientific Computing Academic Press, Boston (1990). Zbl 0706.65013, MR 1061154
Reference: [30] Wrobel, L. C., Aliabadi, M. H.: The Boundary Element Method. Vol. 1: Applications in Thermo-Fluids and Acoustics.Wiley, Chichester (2002). Zbl 0994.74002
Reference: [31] Zhou, Y., Shepard, R., Minkoff, M.: Computing eigenvalue bounds for iterative subspace matrix methods.Comput. Phys. Commun. 167 (2005), 90-102. Zbl 1196.15007, MR 2124799, 10.1016/j.cpc.2004.12.013
.

Files

Files Size Format View
AplMat_60-2015-4_5.pdf 549.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo