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