Structured eigenvalue problems in electronic structure methods from a unified perspective

• URL: http://arxiv.org/abs/2009.01136v2
• Date: Thu, 28 Oct 2021 02:40:53 GMT
• Title: Structured eigenvalue problems in electronic structure methods from a unified perspective
• Authors: Zhendong Li
• Abstract summary: The quaternion matrix eigenvalue problem and the linear response (Bethe-Salpeter) eigenvalue problem for excitation energies are frequently encountered structured eigenvalue problems. We show that the identification of Lie group structures for their eigenvectors provides a framework to design diagonalization algorithms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In (relativistic) electronic structure methods, the quaternion matrix eigenvalue problem and the linear response (Bethe-Salpeter) eigenvalue problem for excitation energies are two frequently encountered structured eigenvalue problems. While the former problem was thoroughly studied, the later problem in its most general form, namely, the complex case without assuming the positive definiteness of the electronic Hessian, is not fully understood. In view of their very similar mathematical structures, we examined these two problems from a unified point of view. We showed that the identification of Lie group structures for their eigenvectors provides a framework to design diagonalization algorithms as well as numerical optimizations techniques on the corresponding manifolds. By using the same reduction algorithm for the quaternion matrix eigenvalue problem, we provided a necessary and sufficient condition to characterize the different scenarios, where the eigenvalues of the original linear response eigenvalue problem are real, purely imaginary, or complex. The result can be viewed as a natural generalization of the well-known condition for the real matrix case.

Related papers

• Resolvent-based quantum phase estimation: Towards estimation of parametrized eigenvalues [0.0]
  We propose a novel approach for estimating the eigenvalues of non-normal matrices based on the matrix resolvent formalism. We construct the first efficient algorithm for estimating the phases of the unit-norm eigenvalues of a given non-unitary matrix. We then construct an efficient algorithm for estimating the real eigenvalues of a given non-Hermitian matrix.
  arXiv  Detail & Related papers  (2024-10-07T08:51:05Z)
• Improving Expressive Power of Spectral Graph Neural Networks with Eigenvalue Correction [55.57072563835959]
  spectral graph neural networks are characterized by filters. We propose an eigenvalue correction strategy that can free filters from the constraints of repeated eigenvalue inputs.
  arXiv  Detail & Related papers  (2024-01-28T08:12:00Z)
• $h(1) \oplus su(2)$ vector algebra eigenstates with eigenvalues in the matrix domain [0.0]
  We find a subset of generalized vector coherent states in the matrix domain. For a special choice of the matrix eigenvalue parameters we found the so-called vector coherent states with matrices associated to the Heisenberg-Weyl group.
  arXiv  Detail & Related papers  (2023-01-25T18:10:01Z)
• Non-standard entanglement structure of local unitary self-dual models as a saturated situation of repeatability in general probabilistic theories [61.12008553173672]
  We show the existence of infinite structures of quantum composite system such that it is self-dual with local unitary symmetry. We also show the existence of a structure of quantum composite system such that non-orthogonal states in the structure are perfectly distinguishable.
  arXiv  Detail & Related papers  (2021-11-29T23:37:58Z)
• A theory of quantum subspace diagonalization [3.248953303528541]
  We show that a quantum subspace diagonalization algorithm can accurately compute the smallest eigenvalue of a large Hermitian matrix. Our results can be of independent interest to solving eigenvalue problems outside the context of quantum computation.
  arXiv  Detail & Related papers  (2021-10-14T16:09:07Z)
• Solution of quantum eigenvalue problems by means of algebraic consistency conditions [0.0]
  We present a simple procedure that can be applied to solve a range of quantum eigenvalue problems without the need to know the solution of the Schr"odinger equation. The material presented may be particularly useful for undergraduate students or young physicists.
  arXiv  Detail & Related papers  (2021-10-07T23:27:20Z)
• Eigen Analysis of Self-Attention and its Reconstruction from Partial Computation [58.80806716024701]
  We study the global structure of attention scores computed using dot-product based self-attention. We find that most of the variation among attention scores lie in a low-dimensional eigenspace. We propose to compute scores only for a partial subset of token pairs, and use them to estimate scores for the remaining pairs.
  arXiv  Detail & Related papers  (2021-06-16T14:38:42Z)
• Minimax Estimation of Linear Functions of Eigenvectors in the Face of Small Eigen-Gaps [95.62172085878132]
  Eigenvector perturbation analysis plays a vital role in various statistical data science applications. We develop a suite of statistical theory that characterizes the perturbation of arbitrary linear functions of an unknown eigenvector. In order to mitigate a non-negligible bias issue inherent to the natural "plug-in" estimator, we develop de-biased estimators.
  arXiv  Detail & Related papers  (2021-04-07T17:55:10Z)
• Analysis of Truncated Orthogonal Iteration for Sparse Eigenvector Problems [78.95866278697777]
  We propose two variants of the Truncated Orthogonal Iteration to compute multiple leading eigenvectors with sparsity constraints simultaneously. We then apply our algorithms to solve the sparse principle component analysis problem for a wide range of test datasets.
  arXiv  Detail & Related papers  (2021-03-24T23:11:32Z)
• Eigendecomposition-Free Training of Deep Networks for Linear Least-Square Problems [107.3868459697569]
  We introduce an eigendecomposition-free approach to training a deep network. We show that our approach is much more robust than explicit differentiation of the eigendecomposition. Our method has better convergence properties and yields state-of-the-art results.
  arXiv  Detail & Related papers  (2020-04-15T04:29:34Z)
• Eigenvalue and Generalized Eigenvalue Problems: Tutorial [12.323996999894002]
  This paper is a tutorial for eigenvalue and generalized eigenvalue problems. We first introduce eigenvalue problem, eigen-decomposition (spectral decomposition), and generalized eigenvalue problem.
  arXiv  Detail & Related papers  (2019-03-25T22:22:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.