Is there any ways to compute the eigen vector without computing explicitly the associated eigenvalue?
Actually, I'd like to compute the largest eigenvalue of a positive matrix from its eigen vector, so I have to know its eigenvector first.
Is there any ways to compute the eigen vector without computing explicitly the associated eigenvalue? Actually, I'd like to compute the largest eigenvalue of a positive matrix from its eigen vector, so I have to know its eigenvector first. 

closed as off topic by Fernando Muro, Suvrit, Lee Mosher, Andrés Caicedo, Igor Rivin Sep 23 '12 at 18:47Questions on MathOverflow are expected to relate to research level mathematics within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here.If this question can be reworded to fit the rules in the help center, please edit the question. 


If you pick a random vector $v$ and look at $v_n=A^n v/\ A^n v\,$ that will converge to the dominant eigenvector. 


What do you know about the matrix? If we know that the rows all have the same sum (but not what that sum is) then we would essentially find it by multiplying by the corresponding eigenvector, $\mathbb{j}$, the all $1$'s vector. This will be the largest eigenvalue provided that the entries are nonnegative. One way this could happen (but not the only one) is if the rows are identical or merely each is a permutation of the first. If certain rows are equal then we know that $0$ is a eigenvalue although we never "computed" it. Then we do know an eigenvector. In a circulant matrix we know all the eigenvectors (not just $\mathbb{j}$) and we essentially use them to compute the corresponding eigenvalues. 

