Accuracy Measures and Fourier Analysis for the Full Multigrid Algorithm

The full multigrid (FMG) algorithm is often claimed to achieve so-called discretization-level accuracy. In this paper, this notion is formalized by defining a worst-case relative accuracy measure, denoted ElFMG, which compares the total error of the l-level FMG solution against the inherent discretization error. This measure can be used for...

Coarse grid approximation governed by local

Solving discrete boundary value problems with the help of an appropriate multigrid method [1, 3, 4, 5] necessitates the construction of a sequence of coarse grids with corresponding coarse grid approximations for the given fine grid discretization. Popular choices in this context are the Galerkin coarse grid approximation (GCA) and the use of...