I have a maxtrix ${\bf A} \in \mathcal{C}^{m \times n}$, where $m < n$. However, the $m$ and $n$ are large numbers (for eg: m = 50, n = 250). I need to find the $k$ dominant right singular vectors of ${\bf A}$, where $k$ can be smaller than the rank of the ${\bf A}$.
Now, computing SVD can be computational complex. Is there any method to compute $k$ dominant right singular vectors for ${\bf A}$.
I know the dominant singular vector can be computed using the power iteration method but what can be done if we need to kind $k$ dominant right singular vectors.