@Article{JCM-27-1,
author = {},
title = {Multigrid Methods for Obstacle Problems},
journal = {Journal of Computational Mathematics},
year = {2009},
volume = {27},
number = {1},
pages = {1--44},
abstract = {<p style="text-align: justify;">In this review, we intend to clarify the underlying ideas and the relations between various multigrid methods ranging from subset decomposition, to projected subspace decomposition and truncated multigrid. In addition, we present a novel globally convergent inexact active set method which is closely related to truncated multigrid. The numerical properties of algorithms are carefully assessed by means of a degenerate problem and a problem with a complicated coincidence set.</p>},
issn = {1991-7139},
doi = {https://doi.org/2009-JCM-8559},
url = {https://global-sci.com/article/84848/multigrid-methods-for-obstacle-problems}
}