American Institute of Mathematical Sciences

December  2013, 6(6): 1457-1471. doi: 10.3934/dcdss.2013.6.1457

Multigrid methods for some quasi-variational inequalities

 1 Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, RO-014700 Bucharest, Romania

Received  June 2012 Revised  September 2012 Published  April 2013

We introduce four variants of a multigrid method for quasi-variational inequalities composed by a term arising from the minimization of a functional and another one given by an operator. The four variants of the method differ from one to another by the argument of the operator. The method assume that the closed convex set is decomposed as a sum of closed convex level subsets. These methods are first introduced as subspace correction algorithms in a general reflexive Banach space. Under an assumption on the level decomposition of the closed convex set of the problem, we prove that the algorithms are globally convergent if a certain convergence condition is satisfied, and estimate the global convergence rate. These general algorithms become multilevel or multigrid methods if we use finite element spaces associated with the level meshes of the domain and with the domain decompositions on each level. In this case, the methods are multigrid $V$-cycles, but the results hold for other iteration types, the $W$-cycle iterations, for instance. We prove that the assumption we made in the general convergence theory holds for the one-obstacle problems, and write the convergence rate depending on the number of level meshes. The convergence condition in the theorem imposes a upper bound of the number of level meshes we can use in algorithms.
Citation: Lori Badea. Multigrid methods for some quasi-variational inequalities. Discrete & Continuous Dynamical Systems - S, 2013, 6 (6) : 1457-1471. doi: 10.3934/dcdss.2013.6.1457
References:

show all references

References:

2020 Impact Factor: 2.425