No abstract

With the vigorous development of the Internet information age, work efficiency can be improved by finding the information needed accurately and quickly. Therefore, it is of vital importance to make an ordering for the relevant information web pages that are provided by the Internet. This paper proposes a kind of PageRank algorithm based on matrix partitioning to complete the ordering of relevant information web pages and applies this algorithm in the calculation cases whose experimental results on the aspect of improving PageRank computational efficiency show matrix partitioning can reduce iterations and improve computational efficiency.

No abstract

According to the traditional stabilized biconjugate gradient algorithm (BiCGSTAB)