Convergence analysis of Lanczos-type methods for the linear response eigenvalue problem

DOI10.1016/j.cam.2013.01.003zbMath1279.65040OpenAlexW2117216503MaRDI QIDQ1946190

Zhongming Teng, Ren-Cang Li

Publication date: 18 April 2013

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.01.003

zbMATH Keywords

convergence analysisnumerical exampleseigenvectorerror boundsLanczos-type methodlinear response eigenvalue problem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

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, 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

Uses Software

• SparseMatrix