Cited in
(3)- Lehmann bounds and eigenvalue error estimation
- A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints
- Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations
This page was built for software: HSL_ea19
