Multigrid methods with Newton-Gauss-Seidel smoothing and constraint preserving interpolation for obstacle problems

DOI10.4208/NMTMA.2015.W08SIMaRDI QIDQ2991807zbMATH OpenOpenAlexFDO

Authors Chunxiao Wu, J. W. L. Wan

Publication date 10 August 2016

Published in Numerical Mathematics: Theory, Methods and Applications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/524edfdbade87971ce6b73590ffa7278cb07eb49

zbMATH Keywords

algorithmHamilton-Jacobi-Bellman equationobstacle problemcomplementarity problemelliptic variational inequalityminimal surfacemultigrid methodfull approximation schemeNewton-Gauss-Seidel method

Mathematics Subject Classification ID

Hamilton-Jacobi equations (35F21) Variational inequalities (49J40) Discrete approximations in optimal control (49M25) Minimal surfaces and optimization (49Q05) Numerical methods for variational inequalities and related problems (65K15)

Recommendations

• scientific article; zbMATH DE number 465306
• scientific article; zbMATH DE number 5050164
• scientific article; zbMATH DE number 2152284
• Multigrid methods with constraint level decomposition for variational inequalities
• scientific article; zbMATH DE number 5670835

Cited in

(2)

• New multigrid smoothers for the Oseen problem
• Path-following and semismooth Newton methods for the variational inequality arising from two membranes problem

This page was built for publication: Multigrid methods with Newton-Gauss-Seidel smoothing and constraint preserving interpolation for obstacle problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2991807)