Gradient bounds for p-harmonic systems with vanishing neumann data in a convex domain
Agnid Banerjee, John L. Lewis

TL;DR
This paper establishes gradient bounds for solutions to p-harmonic systems with vanishing Neumann boundary conditions in convex domains, using subsolution techniques instead of level set methods.
Contribution
It introduces a new approach employing subsolution arguments to obtain gradient bounds, replacing previous level set based methods in similar elliptic problems.
Findings
Gradient of solutions is bounded in the domain segment.
Constants depend only on dimension, p, N, and domain measure.
Method simplifies previous approaches based on level sets.
Abstract
Let be a bounded convex domain in Euclidean space, and Let be a weak solution to \[\nabla \cdot \left (|\nabla \ti u |^{p-2} \nabla \ti u \right) = 0 \mbox{in} \ti \Om \cap B (\hat x, 4 r) \mbox{with} |\nabla \ti u|^{p-2} \, \ti u_\nu = 0 \mbox{on} \ar \ti \Om \cap B (\hat x, 4 r). \] We show that sub solution type arguments for certain uniformly elliptic systems can be used to deduce that is bounded in with constants depending only on and Our argument replaces an argument based on level sets in recent important work of [CM], [CM1], [GS], [M], [M1], involving similar problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNonlinear Partial Differential Equations · Advanced Mathematical Modeling in Engineering · Numerical methods in inverse problems
