Monotone Multigrid Methods for Variational Inequalities I

Ralf Kornhuber
Konrad-Zuse-Zentrum Berlin
Heilbronner Str. 10
D-10711 Berlin
Germany

Abstract

We derive fast solvers for discrete elliptic variational inequalities of the first kind (obstacle problems) as resulting from the approximation of related continuous problems by piecewise linear finite elements. Using basic ideas of successive subspace correction, we modify well-known relaxation methods by extending the set of search directions. Extended underrelaxations are called monotone multigrid methods, if they are quasioptimal in a certain sense. By construction, all monotone multigrid methods are globally convergent. We take a closer look at two natural variants, the standard monotone multigrid method and a truncated version. For the considered model problems, the asymptotic convergence rates resulting from the standard approach suffer from insufficient coarse-grid transport, while the truncated monotone multigrid method provides the same efficiency as in the unconstrained case.


Contributed April 8, 1994.