Skip to main content Accessibility help

Multigrid Methods with Newton-Gauss-Seidel Smoothing and Constraint Preserving Interpolation for Obstacle Problems

  • Chunxiao Wu (a1) and Justin W.L. Wan (a2)


In this paper, we propose a multigrid algorithm based on the full approximate scheme for solving the membrane constrained obstacle problems and the minimal surface obstacle problems in the formulations of HJB equations. A Newton-Gauss-Seidel (NGS) method is used as smoother. A Galerkin coarse grid operator is proposed for the membrane constrained obstacle problem. Comparing with standard FAS with the direct discretization coarse grid operator, the FAS with the proposed operator converges faster. A special prolongation operator is used to interpolate functions accurately from the coarse grid to the fine grid at the boundary between the active and inactive sets. We will demonstrate the fast convergence of the proposed multigrid method for solving two model obstacle problems and compare the results with other multigrid methods.



Hide All
[1]Bellman, R.E.Introduction to the Mathematical Theory of Control Processes: Nonlinear processes. Mathematics in science and engineering. Academic Press, 1971.
[2]Brandt, Achi and Cryer, Colin W. Multigrid algorithms for the solution of linear complementarity problems arising from free boundary problems. SIAM journal on scientific and statistical computing, 4(4):655684, 1983.
[3]Caffarelli, Luis A. The obstacle problem revisited. Journal of Fourier Analysis and Applications, 4(4):383402, 1998.
[4]Clarke, F. Optimization and nonsmooth analysis wiley. New York, 1983.
[5]Figueiredo, Isabel Narra, Rodrigues, José Francisco, and Santos, . Free Boundary Problems: Theoryand Applications, volume 154. Springer, 2007.
[6]Glowinski, R, Lions, Jacques Louis, and Trémoliéres, Raymond. Numerical analysis of variational inequalities, 1981.
[7]Glowinski, Roland. Lectures on Numerical Methods for Non-Linear Variational Problems. Springer, 2008.
[8]Hackbusch, Wolfgang and Mittelmann, Hans Detlef. On multi-grid methods for variational inequalities. Numerische Mathematik, 42(1):6576, 1983.
[9]Hintermüller, Michael and Kunisch, Karl. Path-following methods for a class of constrained minimization problems in function space. SIAM J. Optim., 17(1):159187, 2006.
[10]Hoppe, Ronald H.W.Multigrid algorithms for variational inequalities. SIAM journal on numerical analysis, 24(5):10461065, 1987.
[11]Howard, Ronald A.. Dynamic Programming and Markov Process. MIT Press, Cambridge, MA, USA, 1960.
[12]Ito, Kazufumi and Kunisch, Karl. Semi-smooth Newton methods for variational inequalities of the first kind. Mathematical Modelling and Numerical Analysis, 37(1):4162, 2003.
[13]Kornhuber, Ralf. Monotone multigrid methods for elliptic variational inequalities I. Numerische Mathematik, 69:167167, 1994.
[14]Lions, P.-L. and Mercier, B.Approximation numerique des equations Hamilton-Jacobi-Bellman. RAIRO – Analyse numerique, 14(4):369393, 1980.
[15]Moré, Jorge J. Global convergence of newton-gauss-seidel methods. SIAM Journal on Numerical Analysis, 8(2):325336, 1971.
[16]O’Leary, Dianne P. Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations. Computing, 22(1):5977, 1979.
[17]Oosterlee, Cornelis W. On multigrid for linear complementarity problems with application to American-style options. Electronic Transactions on Numerical Analysis, 15(165–185):27, 2003.
[18]Qi, Liqun and Sun, Jie. A nonsmooth version of Newton’s method. Mathematical programming, 58(1–3):353367, 1993.
[19]Rodrigues, J-F. Obstacle problems in mathematical physics, volume 134. North Holland, 1987.
[20]Tai, Xue-Cheng. Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities. Numerische Mathematik, 93(4):755786, 2003.


Multigrid Methods with Newton-Gauss-Seidel Smoothing and Constraint Preserving Interpolation for Obstacle Problems

  • Chunxiao Wu (a1) and Justin W.L. Wan (a2)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed