TY - GEN A1 - Kornhuber, Ralf T1 - Monotone Multigrid Methods for Elliptic Variational Inequalities I. N2 - Extending well--known linear concepts of successive subspace correction, we arrive at extended relaxation methods for elliptic variational inequalities. 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, which are called symmetric and unsymmetric multigrid methods, respectively. While the asymptotic convergence rates of the symmetric method suffer from insufficient coarse--grid transport, it turns out in our numerical experiments that reasonable application of the unsymmetric multigrid method may lead to the same efficiency as in the linear, unconstrained case. T3 - ZIB-Report - SC-93-18 Y1 - 1993 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-1147 ER - TY - GEN A1 - Kornhuber, Ralf T1 - Monotone Multigrid Methods for Elliptic Variational Inequalities II. N2 - We derive fast solvers for discrete elliptic variational inequalities of the second kind as resulting from the approximation by piecewise linear finite elements. Following the first part of this paper, monotone multigrid methods are considered as extended underrelaxations. Again, the coarse grid corrections are localized by suitable constraints, which in this case are fixed by fine grid smoothing. We consider the standard monotone multigrid method induced by the multilevel nodal basis and a truncated version. Global convergence results and asymptotic estimates for the convergence rates are given. The numerical results indicate a significant improvement in efficiency compared with previous multigrid approaches. T3 - ZIB-Report - SC-93-19 Y1 - 1993 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-1151 ER - TY - GEN A1 - Kornhuber, Ralf A1 - Yserentant, Harry T1 - Multilevel Methods for Elliptic Problems on Domains not Resolved by the Coarse Grid. N2 - Elliptic boundary value problems are frequently posed on complicated domains which cannot be covered by a simple coarse initial grid as it is needed for multigrid like iterative methods. In the present article, this problem is resolved for selfadjoint second order problems and Dirichlet boundary conditions. The idea is to construct appropriate subspace decompositions of the corresponding finite element spaces by way of an embedding of the domain under consideration into a simpler domain like a square or a cube. Then the general theory of subspace correction methods can be applied. T3 - ZIB-Report - SC-93-21 Y1 - 1993 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-1170 ER - TY - GEN A1 - Bornemann, Folkmar A. A1 - Erdmann, Bodo A1 - Kornhuber, Ralf T1 - A Posteriori Error Estimates for Elliptic Problems. N2 - {\def\enorm {\mathop{\mbox{\boldmath{$|\!|$}}}\nolimits} Let $u \in H$ be the exact solution of a given self--adjoint elliptic boundary value problem, which is approximated by some $\tilde{u} \in {\cal S}$, $\cal S$ being a suitable finite element space. Efficient and reliable a posteriori estimates of the error $\enorm u - \tilde{u}\enorm $, measuring the (local) quality of $\tilde{u}$, play a crucial role in termination criteria and in the adaptive refinement of the underlying mesh. A well--known class of error estimates can be derived systematically by localizing the discretized defect problem using domain decomposition techniques. In the present paper, we provide a guideline for the theoretical analysis of such error estimates. We further clarify the relation to other concepts. Our analysis leads to new error estimates, which are specially suited to three space dimensions. The theoretical results are illustrated by numerical computations.} T3 - ZIB-Report - SC-93-29 Y1 - 1993 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-1257 ER - TY - GEN A1 - Erdmann, Bodo A1 - Hoppe, Ronald H. W. A1 - Kornhuber, Ralf T1 - Adaptive Multilevel-Methods for Obstacle Problems in Three Space Dimensions. N2 - We consider the discretization of obstacle problems for second order elliptic differential operators in three space dimensions by piecewise linear finite elements. Linearizing the discrete problems by suitable active set strategies, the resulting linear sub--problems are solved iteratively by preconditioned cg--iterations. We propose a variant of the BPX preconditioner and prove an $O(j)$ estimate for the resulting condition number. To allow for local mesh refinement we derive semi--local and local a posteriori error estimates. The theoretical results are illustrated by numerical computations. T3 - ZIB-Report - SC-93-08 Y1 - 1993 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-1049 ER -