2012
DOI: 10.1137/110838960
|View full text |Cite
|
Sign up to set email alerts
|

Minimization Principles for the Linear Response Eigenvalue Problem I: Theory

Abstract: We present two theoretical results for the linear response eigenvalue problem. The first result is a minimization principle for the sum of the smallest eigenvalues with the positive sign. The second result is Cauchy-like interlacing inequalities. Although the linear response eigenvalue problem is a nonsymmetric eigenvalue problem, these results mirror the well-known trace minimization principle and Cauchy's interlacing inequalities for the symmetric eigenvalue problem.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
88
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 46 publications
(89 citation statements)
references
References 28 publications
1
88
0
Order By: Relevance
“…The eigenvalue problem (1.1) is referred to as the Linear Response Eigenvalue Problem (LREP) in the literature of computational quantum chemistry and physics, and several minimization principles were recently established and, as a result, CG type optimization algorithms were proposed to solve (1.1) [2,3,15]. Using the symmetric orthogonal matrix which was still referred to as the linear response eigenvalue problem (LREP) [2,16,23] and will be in this paper, too. The condition (1.2) implies that both K and M are symmetric and positive definite [2].…”
Section: A B B Amentioning
confidence: 99%
See 4 more Smart Citations
“…The eigenvalue problem (1.1) is referred to as the Linear Response Eigenvalue Problem (LREP) in the literature of computational quantum chemistry and physics, and several minimization principles were recently established and, as a result, CG type optimization algorithms were proposed to solve (1.1) [2,3,15]. Using the symmetric orthogonal matrix which was still referred to as the linear response eigenvalue problem (LREP) [2,16,23] and will be in this paper, too. The condition (1.2) implies that both K and M are symmetric and positive definite [2].…”
Section: A B B Amentioning
confidence: 99%
“…Using the symmetric orthogonal matrix which was still referred to as the linear response eigenvalue problem (LREP) [2,16,23] and will be in this paper, too. The condition (1.2) implies that both K and M are symmetric and positive definite [2]. Denote by In [2], a subspace version of this for characterizing the k smallest positive eigenvalues…”
Section: A B B Amentioning
confidence: 99%
See 3 more Smart Citations