2007
DOI: 10.1016/j.jde.2007.04.009
|View full text |Cite
|
Sign up to set email alerts
|

Frequency-uniform decomposition method for the generalized BO, KdV and NLS equations

Abstract: Sufficient and necessary conditions for the embeddings between Besov spaces B s 1 p,q and modulation spaces M s 2 p,q are obtained. Moreover, using the frequency-uniform decomposition method, we study the Cauchy problem for the generalized BO, KdV and NLS equations, for which the global well-posedness of solutions with the small rough data in certain modulation spaces M s 2,1 is shown.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
116
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 124 publications
(116 citation statements)
references
References 36 publications
0
116
0
Order By: Relevance
“…It will be interesting to compare our result with the following result of Wang-Huang [19 is the Besov space. Let 0 < p ≤ 1.…”
Section: Qmentioning
confidence: 71%
“…It will be interesting to compare our result with the following result of Wang-Huang [19 is the Besov space. Let 0 < p ≤ 1.…”
Section: Qmentioning
confidence: 71%
“…The modulation space M s 2,1 can be equivalently defined in the following way (cf. [40,41,42]): 6) where k = 1 + |k|. For any Banach function spaces X defined in R × R n , we will use the function spaces 1,s (X) ,…”
Section: Resultsmentioning
confidence: 99%
“…To answer this question, modulation spaces seem very useful tools. Recalling the sharp embedding (see [35,38,40]) M sc 2,1 ⊂ H sc , M s 2,1 ⊂ H sc if s < s c , it will be interesting if we can establish the global well-posedness for the initial data in M s 2,1 with s < s c . In fact, there are some recent works which have been devoted to the study of the well-posedness for a class of nonlinear evolution equation in modulation spaces; cf.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Recall that supp ψ ⊂ (−1, 1) n . Therefore, from (27), (28), and Lemma 4.1 with Ω = (−1, 1) n , we obtain…”
mentioning
confidence: 85%