a novel approach to determining pagerank for web pages views the problem as being comparable to solving for an electromagnetic field problem . this view of ranking web pages enables appropriate entries for a matrix g of the web , so that fast - solver techniques can be employed to iterate g , solving for ranks , or a dominant eigenstructure , achieving an o performance in time and memory requirements . the specific solver technique that is used can be , for example , a fast multi - pole method , or a multilevel low - rank compression method . once the problem is correctly formulated , it is not necessary to create the matrix g . local information can be queried on demand by the solver . this approach can also be used to determine different scores of web pages , such as trustrank , which is indicative of their trustworthiness .