Two-level Fourier analysis of a multigrid approach for discontinuous Galerkin discretisation

In this paper we study a multigrid method for the solution of a linear second order elliptic equation, discretized by discontinuous Galerkin (DG) methods, andwe give a detailed analysis of the convergence for different block-relaxation strategies.We find that point-wise block-partitioning gives much better results than the classical cell-wise partitioning.Both for the Baumann-Oden and for the symmetric DG method,with and without interior penalty, the block relaxation methods (Jacobi,Gauss-Seidel and symmetric Gauss-Seidel) give excellent smoothing procedures in a classical multigrid setting.Independent of the mesh size, simple MG cycles give convergence factors 0.075 -- 0.4 per iteration sweep for the different discretisation methods studied

Multigrid with Cache Optimizations on Adaptive Mesh Refinement Hierarchies

This dissertation presents a multilevel algorithm to solve constant and variable coeffcient elliptic boundary value problems on adaptively refined structured meshes in 2D and 3D. Cacheaware algorithms for optimizing the operations to exploit the cache memory subsystem areshown. Keywords: Multigrid, Cache Aware, Adaptive Mesh Refinement, Partial Differential Equations, Numerical Solution