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(Principal, not principle.) – 2012-01-05
-
0@Hans Thanks! Corrected. – 2012-01-05
-
0Nothing *else* special about your matrix? There's power iteration if you already have a good estimate... – 2012-01-08
-
0@J.M. In fact the matrix is a 0-or-1-matrix, all entries are either 0 or 1. – 2012-01-08
-
0Oh, $0$ is positive... you really should have mentioned that you had a $0$-$1$ matrix to begin with... – 2012-01-08
-
0@J.M. to be precise it should be a non-negative entries matrix. Topic updated – 2012-01-08