Minimization principles for the linear response eigenvalue problem. II: Computation
From MaRDI portal
Publication:2848618
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
Cited in
(34)- On the Kahan-Parlett-Jiang theorem -- a globally optimal backward perturbation error for two-sided invariant subspaces
- Error bounds for approximate deflating subspaces for linear response eigenvalue problems
- Heavy ball restarted CMRH methods for linear systems
- Rayleigh-Ritz majorization error bounds for the linear response eigenvalue problem
- Eigenvalue inclusion sets for linear response eigenvalue problems
- Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
- Structure-preserving \(\Gamma\) QR and \(\Gamma\)-Lanczos algorithms for Bethe-Salpeter eigenvalue problems
- A robust numerical algorithm for computing Maxwell's transmission eigenvalue problems
- Minimization principles and computation for the generalized linear response eigenvalue problem
- Trace minimization method via penalty for linear response eigenvalue problems
- Locally optimal and heavy ball GMRES methods
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- An indefinite variant of LOBPCG for definite matrix pencils
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Backward perturbation analysis and residual-based error bounds for the linear response eigenvalue problem
- A projected preconditioned conjugate gradient method for the linear response eigenvalue problem
- Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems
- Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
- A structure preserving Lanczos algorithm for computing the optical absorption spectrum
- Doubling algorithm for the discretized Bethe-Salpeter eigenvalue problem
- On generalizing trace minimization principles
- Weighted Golub-Kahan-Lanczos bidiagonalization algorithms
- 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
- A block Chebyshev-Davidson method for linear response eigenvalue problems
- A block Lanczos method for the linear response eigenvalue problem
- A symmetric structure-preserving {\(\Gamma\)}QR algorithm for linear response eigenvalue problems
- On generalizing trace minimization principles. II
- A Chebyshev locally optimal block preconditioned conjugate gradient method for product and standard symmetric eigenvalue problems
- Numerical methods for Bogoliubov-de Gennes excitations of Bose-Einstein condensates
- Computing the density of states for optical spectra of molecules by low-rank and QTT tensor approximation
- Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation
- Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory
- Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem
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)
