Volume 27, Issue 1
Multigrid Methods for Obstacle Problems

Carsten Gräser & Ralf Kornhuber

DOI:

J. Comp. Math., 27 (2009), pp. 1-44.

Published online: 2009-02

[An open-access article; the PDF is free to any online user.]

Preview Full PDF 912 2584
Export citation
  • Abstract

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.

  • Keywords

Multigrid methods Variational inequalities

  • AMS Subject Headings

65M55 35J85.

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@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 = { 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.}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/8559.html} }
TY - JOUR T1 - Multigrid Methods for Obstacle Problems JO - Journal of Computational Mathematics VL - 1 SP - 1 EP - 44 PY - 2009 DA - 2009/02 SN - 27 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/8559.html KW - Multigrid methods KW - Variational inequalities AB - 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.
Carsten Gräser & Ralf Kornhuber. (2019). Multigrid Methods for Obstacle Problems. Journal of Computational Mathematics. 27 (1). 1-44. doi:
Copy to clipboard
The citation has been copied to your clipboard