I am studying the QR algorithm, is it the fastest one in this situation?
The fastest algorithm of computing Principal eigenvector of a non-negative-entries matrix
1
$\begingroup$
linear-algebra
algorithms
eigenvalues-eigenvectors
numerical-linear-algebra
-
0@J.M. to be pre$c$ise it should be a non-negative entries matrix. Topic updated – 2012-01-08