I start with B=I, A positive matrix, and compute B=(BA)/norm(B) by iterating until B is sufficiently close to rank-1 matrix. What is a good stopping criterion for this algorithm?
There's Birkhoff contraction coefficient which measures how far matrix is from rank-1 matrix, but it's expensive, I'm looking for some GPU-friendly criterion I could apply to the difference B-B_old