Colloquium/Seminar

YearMonth
2017 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Oct   Nov   Dec  
2016 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Oct   Nov   Dec  
2015 Jan   Feb   Mar   Apr   May   Jun   Aug   Sep   Oct   Nov   Dec  
2014 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Sep   Oct   Nov   Dec  
2013 Jan   Feb   Mar   Apr   May   Jun   Aug   Sep   Nov   Dec  
2012 Jan   Feb   Apr   May   Jun   Jul   Aug   Sep   Nov   Dec  
2011 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Sep   Oct   Nov   Dec  
2010 Jan   Feb   Mar   Apr   May   Jun   Sep   Oct   Nov   Dec  
2009 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Sep   Oct   Nov   Dec  
2008 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Sep   Oct   Nov   Dec  
2007 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Sep   Oct   Nov   Dec  
2006 Jan   Feb   Mar   Apr   May   Jun   Jul   Sep   Oct   Nov   Dec  
2005 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Sep   Oct   Nov   Dec  
2004 Jan   Feb   Mar   Apr   May   Aug   Sep   Oct   Nov   Dec  

Event(s) on September 2005


  • Tuesday, 13th September, 2005

    Title: Arnoldi-type Algorithms for Computing Stationary Distribution Vectors, with Application to PageRank
    Speaker: Prof. Gene Golub, Department of Computer Science, Stanford University, USA
    Time/Place: 11:30  -  12:30
    RRS905
    Abstract: We consider the problem of iteratively computing the stationary distribution vector of large finite Markov chains. It is assumed that the matrices involved are too large for a decompositional approach to be effective, and matrix-vector products must be used. The problem is motivated by Google's PageRank algorithm for large web databases. We consider an Arnoldi-type restarted algorithm based on a combination of Arnoldi and the SVD. Connection of the algorithm to other techniques such as the quadratic extrapolation method is discussed, and the sensitivity of the PageRank problem is also addressed. Numerical examples illustrate the performance and convergence behavior of the algorithm. Joint work with Chen Grief