sources about SVD complexity

310 Views Asked by At

I've heard that the complexity of SVD(singular values decomposition) of a $n \times m$ matrix is $O(mn^2)$ when $m>n$.(I mean the complexity to find out the singular vectors and the singular values.)

Would you please introduce me some books, papers,... to know about its proof?

Thank you very much.