Lehmann bounds and eigenvalue error estimation The paper investigates the properties of Lehmann’s optimal bounds for eigenvalues of Hermitian problems in order to find a way to efficiently use them for eigenvalue error estimation. A practical error estimation scheme is described that can be employed in the framework of a subspace iteration algorithm and is actually implemented by the HSL-ea19 software package from the HSL Mathematical Software Library of Rutherford Appleton Laboratory.
Keywords for this software
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Cai, Yunfeng; Bai, Zhaojun; Pask, John E.; Sukumar, N.: Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations (2013)
- Browne, P. A.; Budd, C.; Gould, N. I. M.; Kim, H. A.; Scott, J. A.: A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints (2012)
- Ovtchinnikov, E. E.: Lehmann bounds and eigenvalue error estimation (2011)