2011
DOI: 10.4171/zaa/1435
|View full text |Cite
|
Sign up to set email alerts
|

On Compactness of Minimizing Sequences Subject to a Linear Differential Constraint

Abstract: For Ω ⊂ R N open (and possibly unbounded), we consider integral functionals of the formdened on the subspace of L p consisting of those vector elds u which satisfy Au = 0 on Ω in the sense of distributions. Here, A may be any linear dierential operator of rst order with constant coecients satisfying Murat's condition of constant rank. The main results provide sharp conditions for the compactness of minimizing sequences with respect to the strong topology in L p .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
4
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…The proof is based on an idea that already was used in [13] in a more general context. Let " > 0 and choose a function u 2 U such that…”
Section: Proposition 33 Letmentioning
confidence: 99%
“…The proof is based on an idea that already was used in [13] in a more general context. Let " > 0 and choose a function u 2 U such that…”
Section: Proposition 33 Letmentioning
confidence: 99%
“…However, all of these articles yield strong convergence at most on bounded domains. Results on unbounded domains with the sequence constrained to solutions of a linear system of differential equations (which includes the gradient case by using the constraint curl u n = 0, but is not limited to it) were recently obtained by the second author in [16].…”
Section: Introductionmentioning
confidence: 99%
“…x ∈ Ω, every µ ∈ R and every ξ ∈ R N . Then we have the following theorem, essentially a variant of the results of Visintin [24], Evans & Gariepy [7], Zhang [25] and Sychev [22,23] for the scalar case on unbounded domains (for related results on unbounded domains also see [16]).…”
mentioning
confidence: 99%
See 1 more Smart Citation