𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comparison of Krylov subspace methods on the PageRank problem

✍ Scribed by Gianna M. Del Corso; Antonio Gullí; Francesco Romani

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
289 KB
Volume
210
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis

PageRank algorithm plays a very important role in search engine technology and consists in the computation of the eigenvector corresponding to the eigenvalue one of a matrix whose size is now in the billions. The problem incorporates a parameter that determines the difficulty of the problem. In this paper, the effectiveness of stationary and nonstationary methods are compared on some portion of real web matrices for different choices of . We see that stationary methods are very reliable and more competitive when the problem is well conditioned, that is for small values of . However, for large values of the parameter the problem becomes more difficult and methods such as preconditioned BiCGStab or restarted preconditioned GMRES become competitive with stationary methods in terms of Mflops count as well as in number of iterations necessary to reach convergence.

📜 SIMILAR VOLUMES

On preconditioned Krylov subspace method
On preconditioned Krylov subspace methods for discrete convection–diffusion problems
✍ Michael P. Chernesky 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB 👁 2 views

We study nonstationary iterative methods for solving preconditioned systems arising from discretizations of the convection-diffusion equation. The preconditioners arise from Gauss-Seidel methods applied to the original system. It is shown that the performance of the iterative solvers is affected by

Partitioned versus global Krylov subspac
Partitioned versus global Krylov subspace iterative methods for FE solution of 3-D Biot’s problem
✍ X. Chen; K.K. Phoon; K.C. Toh 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 740 KB

Finite element analysis of 3-D Biot's consolidation problem needs fast solution of discretized large 2 Â 2 block symmetric indefinite linear systems. In this paper, partitioned iterative methods and global Krylov subspace iterative methods are investigated and compared. The partitioned iterative met

A Preconditioned Krylov Subspace Method
A Preconditioned Krylov Subspace Method for the Solution of Least Squares Problems in Inverse Scattering
✍ Kees Vuik; Agur G.J. Sevink; Gérard C. Herman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 384 KB

In this paper we consider an underdetermined system of equations Lx ϭ b so m Ͻ n. However, the methods given We present an iterative method of preconditioned Krylov type for the solution of large least squares problems. We prove that the in Section 3 can also be used for overdetermined systems. me

Preconditioned Krylov subspace methods f
Preconditioned Krylov subspace methods for boundary element solution of the Helmholtz equation
✍ S. Amini; N. D. Maines 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 2 views

Discretization of boundary integral equations leads, in general, to fully populated complex valued non-Hermitian systems of equations. In this paper we consider the e cient solution of these boundary element systems by preconditioned iterative methods of Krylov subspace type. We devise preconditione