Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

What are the standard methods of computing the rank-k truncated SVD of large dense matrices? My literature search yields results only for large sparse matrices.

I assume for k small that you use a Krylov subspace method (this is what Matlab's svds does). But (empirically) how large can k get before these methods become impractical, and then what should one resort to?

share|improve this question
    
Not sure why this had two downvotes... –  Yemon Choi Mar 15 '13 at 7:12
    
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.