Abstract
The minimization principle and Cauchy-like interlacing inequalities for the generalized linear response eigenvalue problem are presented. Based on these theoretical results, the best approximations through structure-preserving subspace projection and a locally optimal block conjugate gradient-like algorithm for simultaneously computing the first few smallest eigenvalues with the positive sign are proposed. Numerical results are presented to illustrate essential convergence behaviors of the proposed algorithm.
Similar content being viewed by others
Notes
It suffices to assume one of \(E_{\pm }\) is nonsingular since \(E_{\pm }^{{{\mathrm{T}}}}=E_{\mp }\).
A similar statement for the case in which \(K\succ 0\) but \(M\succeq 0\) can be made, noting that the decompositions in (2.7) no longer hold but similar decompositions exist.
How this factorization is done is not essential mathematically. But it is included to accommodate cases when such a factorization may offer certain conveniences. In general, simply taking \(W_1=W^{{{\mathrm{T}}}}\) and \(W_2=I_{\ell }\) or \(W_1=I_{\ell }\) and \(W_2=W\) may be sufficient.
Computationally, this can be realized by the QR decompositions of \(W_i^{{{\mathrm{T}}}}\). For more generality in presentation, we do not assume that they have to be QR decompositions.
References
Bai, Z., Li, R.C.: Minimization principle for linear response eigenvalue problem iii: general case. Technical Report 2013–01, Department of Mathematics, University of Texas at Arlington (2011). Available at http://www.uta.edu/math/preprint/
Bai, Z., Li, R.C.: Minimization principles for the linear response eigenvalue problem I: theory. SIAM J. Matrix Anal. Appl. 33(4), 1075–1100 (2012)
Bai, Z., Li, R.C.: Minimization principles for linear response eigenvalue problem II: Computation. SIAM J. Matrix Anal. Appl. 44(2), 392–416 (2013)
Challacombe, M.: Linear scaling solution of the time-dependent self-consisten-field equations. e-print arXiv:1001.2586v2 (2010)
Davis, T., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1–1:25 (2011)
Demmel, J.: Applied Numerical Linear Algebra. SIAM, Philadelphia (1997)
Flaschka, U., Lin, W.W., Wu, J.L.: A KQZ algorithm for solving linear-response eigenvalue equations. Linear Algebra Appl. 165, 93–123 (1992)
Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)
Grüning, M., Marini, A., Gonze, X.: Exciton-plasmon states in nanoscale materials: breakdown of the Tamm-Dancoff approximation. Nano Lett. 9, 2820–2824 (2009)
Lucero, M.J., Niklasson, A.M.N., Tretiak, S., Challacombe, M.: Molecular-orbital-free algorithm for excited states in time-dependent perturbation theory. J. Chem. Phys. 129(6), 64–114 (2008)
Mehl, C., Mehrmann, V., Xu, H.: On doubly structured matrices and pencils that arise in linear response theory. Linear Algebra Appl. 380, 3–51 (2004)
Muta, A., Iwata, J.I., Hashimoto, Y., Yabana, K.: Solving the RPA eigenvalue equation in real-space. Prog. Theor. Phys. 108(6), 1065–1076 (2002)
Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, New York (2006)
Olsen, J., Jensen, H.J.A., Jørgensen, P.: Solution of the large matrix equations which occur in response theory. J. Comput. Phys. 74(2), 265–282 (1988)
Olsen, J., Jorgensen, P.: Linear and nonlinear response functions for an exact state and for an MCSCF state. J. Chem. Phys. 82(7), 3235–3264 (1985)
Ring, P., Schuck, P.: The nuclear many-body problem. Springer, New York (1980)
Rocca, D., Bai, Z., Li, R.C., Galli, G.: A block variational procedure for the iterative diagonalization of non-Hermitian random-phase approximation matrices. J. Chem. Phys. 136, 034–111 (2012)
Stratmann, R.E., Scuseria, G.E., Frisch, M.J.: An efficient implementation of time-dependent density-functional theory for the calculation of excitation of large molecules. J. Chem. Phys. 109, 8218–8824 (1998)
Thouless, D.J.: Vibrational states of nuclei in the random phase approximation. Nucl. Phys. 22(1), 78–95 (1961)
Thouless, D.J.: The Quantum Mechanics of Many-Body Systems. Academic Press, New York (1972)
Tsiper, E.V.: Variational procedure and generalized Lanczos recursion for small-amplitude classical oscillations. JETP Lett. 70(11), 751–755 (1999)
Acknowledgments
We thank the referees for valuable comments and suggestions to improve the presentation of the paper Bai is supported in part by NSF grants DMR-1035468 and DMS-1115817. Li is supported in part by NSF grant DMS-1115834.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Peter Benner.
Dedicated to Professor Axel Ruhe on the occasion of his 70th birthday.
Appendix: Best approximations: the singular/unequal dimension case
Appendix: Best approximations: the singular/unequal dimension case
This appendix continues the investigation in Sect. 4 to seek best approximate eigenpairs of \(H-\lambda E\) for given \(\{\mathcal{U}, \mathcal{V}\}\), a pair of approximate deflating subspaces of \(H-\lambda E\) with \(\dim (\mathcal{U})=\ell _1\) and \(\dim (\mathcal{V})=\ell _2\). In Sect. 4, we have treated the case in which \(\ell _1=\ell _2\) and \(W \mathop {=}\limits ^{{\hbox {def}}}U^{{{\mathrm{T}}}}E_+V\) is nonsingular, where \(U\in {\mathbb R}^{n\times \ell _1},\,V\in {\mathbb R}^{n\times \ell _2}\) are the basis matrices of \(\mathcal{U}\) and \(\mathcal{V}\), respectively. In what follows, we will focus on the general case: \(\ell _1\) and \(\ell _2\) are not necessarily equal or \(W\) may be singular.
The case is much more complicated than the one in section 4, but it can be handled in the similar way as in [3] which is for \(E=I_{2n}\). So we will simply summarize the results and the reader is referred to [1, Appendix A] for detail.
Factorize
Both \(W_i\) have full row rank. FactorizeFootnote 5
where \(R_i\in {\mathbb R}^{r\times r},\,Q_i\in {\mathbb R}^{\ell _i\times \ell _i}\) (\(i=1,2\)) are nonsingular. Partition
Set
where \(K_{22}^{\dagger }\) and \(M_{22}^{\dagger }\) are the Moore-Penrose inverses of \(K_{22}\) and \(M_{22}\), respectively, and
Denote by \(\mu _j\) for \(j=1,\ldots ,r\) the eigenvalues with the positive sign of \(\widehat{H}_{\hbox {SR}}\) in the ascending order and by \(\hat{z}_j\) the associated eigenvectors:
It can be verified that \( \rho (\tilde{x}_j,\tilde{y}_j)=\mu _j\quad \hbox {for} j=1,\ldots ,r, \) where
for any \(u_j\) and \(v_j\) satisfying
Naturally the approximate eigenvectors of \(H-\lambda E\) should be taken as
Theorem 8.1
Let \(\{\mathcal{U}, \mathcal{V}\}\) be a pair of approximate deflating subspaces of \(H-\lambda E\) with \(\dim (\mathcal{U})=\ell _1\) and \(\dim (\mathcal{V})=\ell _2\), and let \(U\in {\mathbb R}^{n\times \ell _1},\,V\in {\mathbb R}^{n\times \ell _2}\) be the basis matrices of \(\mathcal{U}\) and \(\mathcal{V}\), respectively. Let \(\widehat{H}_{\hbox {SR}}\) be defined by (8.4). Then the best approximations to \(\lambda _j\) for \(1\le j\le k\) in the sense of (4.1) are the corresponding eigenvalues of \(\widehat{H}_{\hbox {SR}}\), with the corresponding approximate eigenvectors given by (8.7)–(8.9).
Despite much more complicated appearance of \(\widehat{H}_{\hbox {SR}}\) compared to \(H_{\hbox {SR}}\) in Sect. 4, our next theorem surprisingly unifies both.
Theorem 8.2
The eigenvalues of \(\widehat{H}_{\hbox {SR}}\) in (8.4) are the same as the finite eigenvalues of
and the eigenvector \(\hat{z}=\begin{bmatrix} \hat{y} \\ \hat{x} \end{bmatrix}\) of \(\widehat{H}_{\hbox {SR}}\) and the eigenvector \(\check{z}=\begin{bmatrix} \check{y} \\ \check{x} \end{bmatrix}\) of the pencil (8.10) associated with a finite eigenvalue are related by
where \(g\) is any vector in the kernel of \(K_{22}\) and \(h\) is any vector in the kernel of \(M_{22}\). In particluar, if \(\ell _1=\ell _2=r\), the relation in (8.11) is simplified to \(\hat{z}=(W_2\oplus W_1)\check{z}\) as in Theorem 4.2.
Proof
Let \(P_i=Q_i^{-{{\mathrm{T}}}}(R_i^{-{{\mathrm{T}}}}\oplus I_{\ell _i-r})\) for \(i=1,2\) and both are nonsingular. It can be verified that
where
and \(K_{ij}\) and \(M_{ij}\) are defined by 8.3. Since \(K\) and \(M\) are positive (semi)definite, we have \({{\mathrm{span}}}(K_{12}^{{{\mathrm{T}}}})\subseteq {{\mathrm{span}}}(K_{22})\) and \({{\mathrm{span}}}(M_{12}^{{{\mathrm{T}}}})\subseteq {{\mathrm{span}}}(M_{22})\) and consequently
Let
It can be verified that \(Z_1^{{{\mathrm{T}}}}\widehat{I} Z_2=\widehat{I}\) and, after using (8.15),
where \(\mathcal {K}_{11}\) and \(\mathcal {M}_{11}\) are defined in (8.5). Hence \((P_1Z_1\oplus P_2Z_2)^{{{\mathrm{T}}}}(\check{H}-\lambda \check{E})(P_2Z_2\oplus P_1Z_1)\) is
whose finite eigenvalues are the eigenvalues of
Now we turn to look for the eigenvector relation. Given an eigenvector \(\hat{z}=\begin{bmatrix} \hat{y} \\ \hat{x} \end{bmatrix}\) of \(\widehat{H}_{\hbox {SR}}\), we conclude by comparing (8.16) and (8.17) that the corresponding eigenvector of the matrix pencil (8.16) is
where \(g\) is any vector in the kernel of \(K_{22}\) and \(h\) is any vector in the kernel of \(M_{22}\). Therefore the corresponding eigenvector \(\check{z}=\begin{bmatrix} \check{y} \\ \check{x} \end{bmatrix}\) of \(\check{H}-\lambda \check{E}\) is given by
which, after simplification, yields (8.11). \(\square \)
The next theorem says that there are Cauchy-like interlacing inequalities for \(\widehat{H}_{\hbox {SR}}\), too. We omit its proof because its similarity to [3, Theorem 8.3] (see also [1, Appendix A]).
Theorem 8.3
Assume the conditions of Theorem 8.1. Then
where \(\lambda _{i+2n-(\ell _1+\ell _2)}=\infty \) if \(i+2n-(\ell _1+\ell _2)>n\).
Rights and permissions
About this article
Cite this article
Bai, Z., Li, RC. Minimization principles and computation for the generalized linear response eigenvalue problem. Bit Numer Math 54, 31–54 (2014). https://doi.org/10.1007/s10543-014-0472-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10543-014-0472-6