In my computer vision class, we have seen the problem of solving $Ax = 0$ numerous times. Initially, we solved the problem by computing the smallest eigenvectors corresponding to the smallest eigenvalues of $A$.
However, we are now using singular value decomposition and extracting the the rightmost column vector of $V$ from $[U, D, V]$.
I am confused, because my understanding is that the columns in $V$ correspond to eigenvectors of $A^T A$. Therefore, how can the solution in one case be an eigenvector of $A$ and in another an eigenvector of $A^T A$?