Given a real-valued matrix $A$, one can obtain its largest eigenvalue $\lambda_1$ plus the corresponding eigenvector $v_1$ by choosing a random vector $r$ and repeatedly multiplying it by $A$ (and rescaling) until convergence.

Once we have the first eigenpair, is there a similar way to estimate the second eigenpair?