Mathematics > Analysis of PDEs
[Submitted on 8 May 2018 (v1), last revised 13 Oct 2022 (this version, v5)]
Title:The Regularity Theory for the Double Obstacle Problem for Fully Nonlinear Operator
View PDFAbstract:In this paper, we prove the existence and uniqueness of $W^{2,p}$ ($n<p<\infty$) solutions of a double obstacle problem with $C^{1,1}$ obstacle functions. Moreover, we show the optimal regularity of the solution and the local $C^1$ regularity of the free boundary. In the study of the regularity of the free boundary, we deal with a general problem, the no-sign reduced double obstacle problem with an upper obstacle $\psi$, $F(D^2 u,x) =f\chi_{\Omega(u) \cap\{ u< \psi\} } + F(D^2\psi,x) \chi_{\Omega(u)\cap \{u=\psi\}}, u\le \psi \text { in } B_1$, where $\Omega(u)=B_1 \setminus \left( \{u=0\} \cap \{ \nabla u =0\}\right)$.
Submission history
From: Jinwan Park [view email][v1] Tue, 8 May 2018 02:30:16 UTC (18 KB)
[v2] Fri, 10 Aug 2018 06:14:58 UTC (17 KB)
[v3] Tue, 14 Jan 2020 03:23:55 UTC (21 KB)
[v4] Wed, 15 Jan 2020 02:15:48 UTC (21 KB)
[v5] Thu, 13 Oct 2022 09:34:08 UTC (20 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.