Publication Date:
2014-02-26
Description:
We consider the discretization of obstacle problems for the Laplacian by piecewise linear finite elements. Assuming that the discrete problems are reduced to a sequence of linear problems by suitable active set strategies, the linear problems are solved iteratively by preconditioned c-g iterations. The proposed preconditioners are treated theoretically as abstract additive Schwarz methods and are implemented as truncated hierarchical basis preconditioners. To allow for local mesh refinement we derive semi-local and local a posteriori error estimates, providing lower and upper estimates for the discretization error. The theoretical results are illustrated by numerical computations.
Keywords:
ddc:000
Language:
English
Type:
reportzib
,
doc-type:preprint
Format:
application/postscript
Format:
application/pdf
