Abstract. Over the years, multigrid has been demonstrated as an efficient technique for solving inviscid flow problems. However, for viscous flows, convergence rates often degrade. This is generally due to the required use of stretched meshes (i.e., the aspect ratio AR = ∆y/∆x << 1) in order to capture the boundary layer near the body. Usual techniques for generating a sequence of grids that produce proper convergence rates on isotropic meshes are not adequate for stretched meshes. This work focuses on the solution of Laplace's equation, discretized through a Galerkin finite-element formulation on unstructured stretched triangular meshes. A coarsening strategy is proposed and results are discussed.Key words. multigrid method, unstructured meshes, semicoarsening, anisotropic problems
AMS subject classifications. 65M55, 65M60, 76M10PII. S1064827595287638Introduction. Multigrid methods are well known to be successful for solving elliptic problems. This is mainly due to their good damping properties which result from two very simple principles. A usual Fourier analysis demonstrates that most of the commonly used solvers effectively damp the high frequencies of a signal. A low frequency component of a given signal on a fine mesh becomes a high frequency on a coarser one, hence the idea of solving the same problem on a sequence of meshes where all frequencies can be damped equally and, if enough grids are available, only a few iterations will be required to produce a converged solution (for more details see [4]). Despite these rather simple considerations, the multigrid algorithm is complex and difficult to implement. One of the difficulties resides in the generation of the sequence of grids for unstructured meshes. The convergence properties of the multigrid method depend upon the "quality" of these grids.A sequence of meshes may be produced through two different methods. First, starting from a mesh that is not too fine but correctly represents the problem, finer meshes may be generated through refinement. A global refinement, performed through local subdivision of the triangles of the discretization, tends to preserve the geometrical features required to obtain an efficient multigrid method. However, this will clearly not be efficient in terms of computational cost, hence the local refinement technique where specific regions of the mesh are refined and then possibly adapted [20]. Although this method seems more reasonable, it increases the computational time and the complexity of the multigrid algorithm.Another method consists in coarsening an existing fine mesh, which has been created to represent accurately the different phenomena to be observed. One of the techniques available consists in removing, through a coarsening criterion, a certain