Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem

DOI10.1553/etna_vol51s529zbMath1431.65049OpenAlexW2994811031WikidataQ126559198 ScholiaQ126559198MaRDI QIDQ5218406

Hong-Xiu Zhong, Guo-Liang Chen

Publication date: 3 March 2020

Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://etna.mcs.kent.edu/volumes/2011-2020/vol51/abstract.php?vol=51&pages=529-546

zbMATH Keywords

linear response eigenvalue problemthick restartharmonic Rayleigh-Ritz projectionweighted Golub-Kahan-Lanczos algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Deflated and restarted Krylov subspace methods for Sylvester tensor equations

Uses Software

• SparseMatrix
• Quantum Espresso

Cites Work

• Unnamed Item
• Unnamed Item
• A harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
• A block Chebyshev-Davidson method for linear response eigenvalue problems
• A symmetric structure-preserving {\(\Gamma\)}QR algorithm for linear response eigenvalue problems
• Backward perturbation analysis and residual-based error bounds for the linear response eigenvalue problem
• Computing interior eigenvalues of large matrices
• Structure preserving parallel algorithms for solving the Bethe-Salpeter eigenvalue problem
• Weighted Golub-Kahan-Lanczos bidiagonalization algorithms
• Convergence analysis of Lanczos-type methods for the linear response eigenvalue problem
• A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
• A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
• Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
• Matrix Algorithms
• Minimization Principles for the Linear Response Eigenvalue Problem II: Computation
• Generalized Golub--Kahan Bidiagonalization and Stopping Criteria
• Reduction of the RPA eigenvalue problem and a generalized Cholesky decomposition for real-symmetric matrices
• Rayleigh--Ritz Approximation For the Linear Response Eigenvalue Problem
• The university of Florida sparse matrix collection
• Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
• Numerical Methods for Large Eigenvalue Problems
• Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
• Harmonic projection methods for large non-symmetric eigenvalue problems
• Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
• The time-dependent relativistic mean-field theory and the random phase approximation