Complexity of SVD computation assuming knowing left singular vectors and singular values

42 Views Asked by At

Suppose we know the left singular vectors $\mathbf{U}$ and singular values $\mathbf{\Sigma}$ for the matrix $\mathbf{A}$ with SVD decomposition $\mathbf{U}\mathbf{\Sigma}\mathbf{V}^{\mathrm{H}}$, then what is the computational complexity of finding the right singular matrix $\mathbf{V}$? Is this computational complexity the same as the computational complexity of finding all three matrices $\mathbf{U}$, $\mathbf{\Sigma}$ and $\mathbf{V}$?