2018
DOI: 10.48550/arxiv.1803.05654
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Kolmogorov equations associated to the stochastic 2D Euler equations

Franco Flandoli,
Dejun Luo

Abstract: The Kolmogorov equation associated to a stochastic 2D Euler equations with transport type noise and random initial conditions is studied by a direct approach, based on Fourier analysis, Galerkin approximation and Wiener chaos methods. The method allows us to generalize previous results and to understand the role of the regularity of the noise, in relation to a limiting value of roughness.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(12 citation statements)
references
References 10 publications
0
12
0
Order By: Relevance
“…In the sense described in [2,11], the enstrophy measure µ is invariant also for this equation (for every β > 0, in this case). The same fact holds for a stochastic version of 2D Euler equations, but with transport type noise, as described in [12,13]:…”
Section: Introductionmentioning
confidence: 74%
See 1 more Smart Citation
“…In the sense described in [2,11], the enstrophy measure µ is invariant also for this equation (for every β > 0, in this case). The same fact holds for a stochastic version of 2D Euler equations, but with transport type noise, as described in [12,13]:…”
Section: Introductionmentioning
confidence: 74%
“…where Z 2 0 = Z 2 \ {0} and e k (x) is the orthonormal basis of sine and cosine functions, see (2.1) below. In [12,13] the problem has been studied for γ > 2.…”
Section: Introductionmentioning
confidence: 99%
“…The following result finds analogues in [2, Lemma 1.3.2], see also [1], and in [12, Theorem 8] or the related [9,14,16,13], all dealing with stationary solutions of 2-dimensional Euler equations.…”
Section: 2mentioning
confidence: 90%
“…The proof of the above assertion follows the idea of [10,Appendix 6], with some combinatorial flavor here. Since l, m are fixed, we write R N instead of R l,m (ω N 0 ) for simplicity.…”
Section: Appendixmentioning
confidence: 97%