Minimization principles for the linear response eigenvalue problem. II: Computation
From MaRDI portal
Publication:2848618
DOI10.1137/110838972zbMATH Open1311.65102OpenAlexW2031196199MaRDI QIDQ2848618FDOQ2848618
Authors: Zhaojun Bai, Ren-Cang Li 
Publication date: 26 September 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/06d2c2d7db7455d5df5da79c6cf2a544a04b2701
Recommendations
- Minimization principles and computation for the generalized linear response eigenvalue problem
- A block Chebyshev-Davidson method for linear response eigenvalue problems
- A projected preconditioned conjugate gradient method for the linear response eigenvalue problem
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
Eigenvalues, singular values, and eigenvectors (15A18) Perturbation theories for operators and differential equations in quantum theory (81Q15) Numerical solution of eigenvalue problems involving ordinary differential equations (65L15)
Cited In (34)
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- An indefinite variant of LOBPCG for definite matrix pencils
- Doubling algorithm for the discretized Bethe-Salpeter eigenvalue problem
- Numerical methods for Bogoliubov-de Gennes excitations of Bose-Einstein condensates
- Minimization principles and computation for the generalized linear response eigenvalue problem
- Computing the density of states for optical spectra of molecules by low-rank and QTT tensor approximation
- Error bounds for approximate deflating subspaces for linear response eigenvalue problems
- Heavy ball restarted CMRH methods for linear systems
- On generalizing trace minimization principles
- Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory
- Eigenvalue inclusion sets for linear response eigenvalue problems
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- Weighted Golub-Kahan-Lanczos bidiagonalization algorithms
- Rayleigh-Ritz majorization error bounds for the linear response eigenvalue problem
- Structure-preserving \(\Gamma\) QR and \(\Gamma\)-Lanczos algorithms for Bethe-Salpeter eigenvalue problems
- Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
- Locally optimal and heavy ball GMRES methods
- Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems
- On the Kahan-Parlett-Jiang theorem -- a globally optimal backward perturbation error for two-sided invariant subspaces
- A block Chebyshev-Davidson method for linear response eigenvalue problems
- A block Lanczos method for the linear response eigenvalue problem
- A Chebyshev locally optimal block preconditioned conjugate gradient method for product and standard symmetric eigenvalue problems
- Backward perturbation analysis and residual-based error bounds for the linear response eigenvalue problem
- A symmetric structure-preserving {\(\Gamma\)}QR algorithm for linear response eigenvalue problems
- Computing symplectic eigenpairs of symmetric positive-definite matrices via trace minimization and Riemannian optimization
- A spectrally accurate numerical method for computing the Bogoliubov-de Gennes excitations of dipolar Bose-Einstein condensates
- Trace minimization method via penalty for linear response eigenvalue problems
- A projected preconditioned conjugate gradient method for the linear response eigenvalue problem
- On generalizing trace minimization principles. II
- Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem
- Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation
- A robust numerical algorithm for computing Maxwell's transmission eigenvalue problems
- A structure preserving Lanczos algorithm for computing the optical absorption spectrum
This page was built for publication: Minimization principles for the linear response eigenvalue problem. II: Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848618)
