The aim of this work is to solve linear systems arising from the discretization of continuous problems by using algebraic multigrid methods. We first explain the multigrid principle by introducing the geometric multigrid methods. We then introduce the algebraic multigrid methods and describe, in particular, two of these methods: the first one, from the book of Briggs, henson and McCormick [4], is called classical method, and the second one, proposed by Vanek, Mandel and Brezina in [20], is called aggregation method. Finally, we compare the numerical performance of the two methods, using a program implemented in this work (based on the theory of [4]), and a program implemented by Michal Kocvara (which uses the aggregation method of [20]).
Comparaison de méthodes de multigrilles algébriques (type classique vs type agrégation) pour la résolution de systèmes linéaires issus de la discrétisation de problèmes continus
Detournay, S. (Author). 2006
Student thesis: Master types › Master in Mathematics