# The fastest algorithm of computing Principal eigenvector of a non-negative-entries matrix

I am studying the QR algorithm, is it the fastest one in this situation?

-
(Principal, not principle.) –  Hans Lundmark Jan 5 '12 at 10:05
@Hans Thanks! Corrected. –  Rein Jan 5 '12 at 10:09
Nothing else special about your matrix? There's power iteration if you already have a good estimate... –  Guess who it is. Jan 8 '12 at 9:32
@J.M. In fact the matrix is a 0-or-1-matrix, all entries are either 0 or 1. –  Rein Jan 8 '12 at 9:37
Oh, $0$ is positive... you really should have mentioned that you had a $0$-$1$ matrix to begin with... –  Guess who it is. Jan 8 '12 at 10:58