Papers
Topics
Authors
Recent
Search
2000 character limit reached

Constructions of bounded solutions of div u=fdiv\, {\mathbf u}=f in critical spaces

Published 21 May 2024 in math.AP | (2405.12703v1)

Abstract: We construct uniformly bounded solutions of the equation div u=fdiv\, {\mathbf u}=f for arbitrary data ff in the critical spaces L<sup>d(Ω)L<sup>d(\Omega), where Ω\Omega is a domain of R<sup>d{\mathbb R}<sup>d. This question was addressed by Bourgain & Brezis, [On the equation div Y=f{\rm div}\, Y=f and application to control of phases, JAMS 16(2) (2003) 393-426], who proved that although the problem has a uniformly bounded solution, it is critical in the sense that there exists no linear solution operator for general L<sup>dL<sup>d-data. We first discuss the validity of this existence result under weaker conditions than f∈L<sup>d(Ω)f\in L<sup>d(\Omega), and then focus our work on constructive processes for such uniformly bounded solutions. In the d=2d=2 case, we present a direct one-step explicit construction, which generalizes for $d&gt;2$ to a (d−1)(d-1)-step construction based on induction. An explicit construction is proposed for compactly supported data in L<sup>2,∞(Ω)L<sup>{2,\infty}(\Omega) in the d=2d=2 case. We also present constructive approaches based on optimization of a certain loss functional adapted to the problem. This approach provides a two-step construction in the d=2d=2 case. This optimization is used as the building block of a hierarchical multistep process introduced in [E. Tadmor, Hierarchical construction of bounded solutions in critical regularity spaces, CPAM 69(6) (2016) 1087-1109] that converges to a solution in more general situations.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.