 # Globally Convergent Multigrid Method for Variational Inequalities with a Nonlinear Term

Conference paper
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 104)

## Abstract

In , one- and two-level Schwarz methods have been proposed for variational inequalities with contraction operators. This type of inequalities generalizes the problems modeled by quasi-linear or semilinear inequalities. It is proved there that the convergence rates of the two-level methods are almost independent of the mesh and overlapping parameters. However, the original convex set, which is defined on the fine grid, is used to find the corrections on the coarse grid, too. This leads to a suboptimal computing complexity. A remedy can be found in adopting minimization techniques from the construction of multigrid methods for the constrained minimization of functionals. In this case, to avoid visiting the fine grid, some level convex sets for the corrections on the coarse levels have been proposed in [4, 7–10] and the review article  for complementarity problems, and in  for two two-obstacle problems. In this paper, we introduce and investigate the convergence of a new multigrid algorithm for the inequalities with contraction operators, and we have adopted the construction of the level convex sets which has been introduced in . In this way, the introduced multigrid method has an optimal computing complexity of the iterations. Also, the convergence theorems for the methods introduced in  contain a convergence condition depending on the total number of the subdomains in the decompositions of the domain. The convergence condition of a direct extension of these methods to more than two-levels will introduce an upper bound for the number of mesh levels which can be used in the method. In comparison with these methods, the convergence condition of the algorithm introduced in this paper is less restrictive and depends neither on the number of the subdomains in the decompositions of the domain nor on the number of levels. Moreover, this convergence condition is very similar with the condition of existence and uniqueness of the solution of the problem.

## References

1. 1.
L. Badea, Schwarz methods for inequalities with contraction operators. J. Comput. Appl. Math. 215(1), 196–219 (2008)
2. 2.
L. Badea, Global convergence rate of a standard multigrid method for variational inequalities. IMA J. Numer. Anal. 34(1), 197–216 (2014). doi:10.1093/imanum/drs054
3. 3.
I. Ekeland, R. Temam, Analyse Convexe et Problèmes Variationnels (Dunod, Paris, 1974)Google Scholar
4. 4.
E. Gelman, J. Mandel, On multilevel iterative method for optimization problems. Math. Program. 48, 1–17 (1990)
5. 5.
R. Glowinski, J.L. Lions, R. Trémolières, Analyse Numérique des Inéquations Variationnelles (Dunod, Paris, 1976)
6. 6.
C. Graser, R. Kornhuber, Multigrid methods for obstacle problems. J. Comput. Math. 27(1), 1–44 (2009)
7. 7.
R. Kornhuber, Monotone multigrid methods for elliptic variational inequalities I. Numer. Math. 69, 167–184 (1994)
8. 8.
R. Kornhuber, Monotone multigrid methods for elliptic variational inequalities II. Numer. Math. 72, 481–499 (1996)
9. 9.
J. Mandel, A multilevel iterative method for symmetric, positive definite linear complementarity problems. Appl. Math. Optim. 11, 77–95 (1984a)Google Scholar
10. 10.
J. Mandel, Etude algébrique d’une méthode multigrille pour quelques problèmes de frontière libre. C.R. Acad. Sci., Ser. I 298, 469–472 (1984b)Google Scholar