LRPR

The problem of Pagerank is a simple one to state: Given a collection of websites, how do we
rank them? The primary way of formulating this utilizes a transition matrix which relates how web pages interact with each other.

We investigate what the effect of a low rank approximation for the transition matrix has on the power method and an inner-outer iteration for solving the Pagerank problem.

The purpose of the low rank approximation is two fold: (1) to reduce memory requirements (2) to decrease computational time. We show that we see an improvement in storage requirements and a decrease in computational time if we discard the time it takes to perform the low rank approximation, however at the sacrifice of accuracy.