Multigrid Methods for Obstacle Problems

Multigrid Methods for Obstacle Problems

Year:    2009

Journal of Computational Mathematics, Vol. 27 (2009), Iss. 1 : pp. 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.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/2009-JCM-8559

Journal of Computational Mathematics, Vol. 27 (2009), Iss. 1 : pp. 1–44

Published online:    2009-01

AMS Subject Headings:   

Copyright:    COPYRIGHT: © Global Science Press

Pages:    44

Keywords:    Multigrid methods Variational inequalities.