Algorithm 844
Published in ACM Transactions on Mathematical Software • Jun 1, 2005
Authors:,,
Michael W. Berry
Shakhina Abdimajidovna Pulatova
G. W. Stewart
Abstract
In many applications---latent semantic indexing, for example---it is required to obtain a reduced rank approximation to a sparse matrix A . Unfortunately, the approximations based on traditional decompositions, like the singular value and QR decompositions, are not in general sparse. Stewart [(1999)...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!