%0 PDF
%T The Application of Algebraic Multigrid Methods to Solving Large Scale HodgeRank Problems
%A Colley, Charles.
%D 2018-03-16T09:33:52.457-04:00
%8 2018-03-16
%R http://localhost/files/gq67k385c
%X Abstract: In this thesis we consider unsmoothed aggregation algebraic multigrid preconditioners applied to graph ranking problems arising from the HodgeRank algorithm. We will discuss the HodgeRank algorithm's foundations after a brief discussion of common ranking methods and present an analysis of the UA-AMG method for solving graph Laplacians systems arising from the least squares problems,applying it as a preconditioner for conjugate gradient (CG) to achieve better performance. We also provide experiments comparing the LSRN, LSQR, and CG method (with and without UA-AMG as a preconditoner) on a collection of larger random graphs and a collection of real world network topologies to demonstrate the effectiveness of UA-AMG method for solving least squares problems on graphs.; Thesis (M.S.)--Tufts University, 2018.; Submitted to the Dept. of Computer Science.; Advisor: Shuchin Aeron.; Committee: Xiaozhe Hu, and Misha Kilmer.; Keywords: Applied mathematics, and Computer science.
%[ 2018-10-10
%9 Text
%~ Tufts Digital Library
%W Institution