Doubling algorithm for the discretized Bethe-Salpeter eigenvalue problem
From MaRDI portal
Abstract: The discretized Bethe-Salpeter eigenvalue problem arises in the Green's function evaluation in many body physics and quantum chemistry. Discretization leads to a matrix eigenvalue problem for with a Hamiltonian-like structure. After an appropriate transformation of to a standard symplectic form, the structure-preserving doubling algorithm, originally for algebraic Riccati equations, is extended for the discretized Bethe-Salpeter eigenvalue problem. Potential breakdowns of the algorithm, due to the ill condition or singularity of certain matrices, can be avoided with a double-Cayley transform or a three-recursion remedy. A detailed convergence analysis is conducted for the proposed algorithm, especially on the benign effects of the double-Cayley transform. Numerical results are presented to demonstrate the efficiency and structure-preserving nature of the algorithm.
Recommendations
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- Structure-preserving QR and -Lanczos algorithms for Bethe-Salpeter eigenvalue problems
- A structure-preserving doubling algorithm for quadratic eigenvalue problems arising from time-delay systems
- Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems
- Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation
Cites work
- A Relativistic Equation for Bound-State Problems
- A structure-preserving doubling algorithm for continuous-time algebraic Riccati equations
- Convergence Analysis of Structure-Preserving Doubling Algorithms for Riccati-Type Matrix Equations
- Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1779173 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Minimization principles for the linear response eigenvalue problem. II: Computation
- Optimal parameters for doubling algorithms
- Solution of a nonsymmetric algebraic Riccati equation from a one-dimensional multistate transport model
- Solution of a nonsymmetric algebraic Riccati equation from a two-dimensional transport model
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- Structure-Preserving Algorithms for Periodic Discrete-Time Algebraic Riccati Equations
- Structured doubling algorithms for weakly stabilizing Hermitian solutions of algebraic Riccati equations
- Tensor-structured factorized calculation of two-electron integrals in a general basis
- The palindromic generalized eigenvalue problem \(A^{*}x=\lambda Ax\): Numerical solution and applications
- Vibration of fast trains, palindromic eigenvalue problems and structure-preserving doubling algorithms
Cited in
(7)- Eigenvalue inclusion sets for linear response eigenvalue problems
- The structure-preserving doubling algorithm and convergence analysis for a nonlinear matrix equation
- Structure-preserving QR and -Lanczos algorithms for Bethe-Salpeter eigenvalue problems
- Dual-root lattice discretization of Weyl orbit functions
- A Chebyshev locally optimal block preconditioned conjugate gradient method for product and standard symmetric eigenvalue problems
- Generating basis sets of double differences
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
This page was built for publication: Doubling algorithm for the discretized Bethe-Salpeter eigenvalue problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380095)
