  In this paper, we describe a new hybrid algorithm for computing all singular
triplets above a given threshold and provide its implementation in
MATLAB/Octave and R. The high performance of our codes and ease at which they
can be used, either independently or within a larger numerical scheme, are
illustrated through several numerical examples with applications to matrix
completion and image compression. Well-documented MATLAB and R codes are
provided for public use.
