Optimizing the eigenvector computation algorithm with diffusion approach

Abstract

In this paper, we apply the ideas of the matrix column based diffusion approach to define a new eigenvector computation algorithm of a stationary probability of a Markov chain.

4 pages

References in corpus (3)

• Optimized on-line computation of PageRank algorithm
• D-iteration method or how to improve Gauss-Seidel method
• Revisiting the D-iteration method: from theoretical to practical computation cost