Reduction of the RPA eigenvalue problem and a generalized Cholesky decomposition for real-symmetric matrices

DOI10.1209/0295-5075/78/12001zbMath1244.65054arXivnucl-th/0702031OpenAlexW2018841216MaRDI QIDQ2903625

Panagiota Papakonstantinou

Publication date: 11 August 2012

Published in: Europhysics Letters (EPL) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/nucl-th/0702031

zbMATH Keywords

Cholesky decompositionRPA eigenvalue problem

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Orthogonalization in numerical linear algebra (65F25)

Related Items (5)

Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems ⋮ 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 ⋮ Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem

This page was built for publication: Reduction of the RPA eigenvalue problem and a generalized Cholesky decomposition for real-symmetric matrices