Computation of the fundamental singular subspace of a large matrix Original Research Article

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.