For the accurate approximation of the minimal singular triple (singular value and left and right singular vector), we may use two separate search spaces, one for the left, and one for the right singular vector. In Lanczos bidiagonalization, for example, such search spaces are constructed. In [3], the author proposes a Jacobi–Davidson type method for the singular value problem, where solutions t...
