Abstract
We compare the block Lanczos and the Davidson methods for computing a basis of a singular subspace associated with the smallest singular values of large matrices. We introduce a simple modification on the preconditioning step of Davidson's method which appears to be efficient on a range of large sparse matrices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have