Garcia Hilares, Nilton Alan2019-10-172019-10-172019-09-13http://hdl.handle.net/10919/94618As finite element discretizations ever grow in size to address real-world problems, there is an increasing need for fast algorithms. Nowadays there are many GPU/CPU parallel approaches to solve such problems. Multigrid methods can be used to solve large-scale problems, or even better they can be used to precondition the conjugate gradient method, yielding better results in general. Capabilities of multigrid algorithms rely on the effectiveness of the inter-grid transfer operators. In this thesis we focus on the aggregation approach, discussing how different aggregation strategies affect the convergence rate. Based on these discussions, we propose an alternative parallel aggregation algorithm to improve convergence. We also provide numerous experimental results that compare different aggregation approaches, multigrid methods, and conjugate gradient iteration counts, showing that our proposed algorithm performs better in serial and parallel.ETDen-USCreative Commons Attribution-ShareAlike 3.0 United StatesAlgebraic multigridAggregationMaximal independent setPoisson's equationThesis