2013
DOI: 10.1016/j.jfa.2012.10.005
|View full text |Cite
|
Sign up to set email alerts
|

Compactness for nonlinear continuity equations

Abstract: We prove compactness and hence existence for solutions to a class of nonlinear transport equations. The corresponding models combine the features of linear transport equations and scalar conservation laws. We introduce a new method which gives quantitative compactness estimates compatible with both frameworks.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
28
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7
2

Relationship

3
6

Authors

Journals

citations
Cited by 23 publications
(28 citation statements)
references
References 40 publications
0
28
0
Order By: Relevance
“…This is achieved through a complete revisiting of the classical compactness theory by obtaining quantitative regularity estimates. The idea is inspired by estimates obtained for nonlinear continuity equations in [7], though with a different method than the one introduced here. Those estimates correspond to critical spaces, also developed and used for instance in works by J. Bourgain, H. Brézis and P. Mironescu and by A.C. Ponce, see [12] and [60].…”
Section: Introductionmentioning
confidence: 99%
“…This is achieved through a complete revisiting of the classical compactness theory by obtaining quantitative regularity estimates. The idea is inspired by estimates obtained for nonlinear continuity equations in [7], though with a different method than the one introduced here. Those estimates correspond to critical spaces, also developed and used for instance in works by J. Bourgain, H. Brézis and P. Mironescu and by A.C. Ponce, see [12] and [60].…”
Section: Introductionmentioning
confidence: 99%
“…We present in this section our main existence result concerning System (1). As usual for global existence of weak solutions to nonlinear PDEs, one has to prove stability estimates for sequences of approximate solutions and construct such approximate sequences.…”
Section: Statements Of the Resultsmentioning
confidence: 99%
“…The proof of Th. 2 mostly follows the steps of [9], the main improvement being the more precise Proposition 7. First of all by Kruzkov's doubling of variables, see [35], any entropy solution u to (1.1) satisfies in the sense of distributions that ∂ t |u(t, x) − u(t, y)| + div x (a(t, x) F (u(t, x), u(t, y)) + div y (a(t, y) F (u(t, x), u(t, y)) + G(u(t, x), u(t, y)) div x a(t, x) + G(u(t, y), u(t, x)) div y a(t, y) ≤ 0, Note that up to adding a constant in f , we may assume that f (0) = 0 thus normalizingḠ s.t.Ḡ(0, 0) = 0.…”
Section: Proof Of Theoremmentioning
confidence: 99%