2012
DOI: 10.1137/110845008
|View full text |Cite
|
Sign up to set email alerts
|

Rates of Convergence for Discretizations of the Stochastic Incompressible Navier--Stokes Equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

2
147
3

Year Published

2014
2014
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 72 publications
(152 citation statements)
references
References 15 publications
2
147
3
Order By: Relevance
“…3.3 Basic Similarity Setting 57 We will not give much attention to a rigorous proof of such convergence. However, it is well known since the works of Stokes [43] that the Stokes equations describe well "slow flows," which are not turbulent and therefore not in the scope of this book.…”
Section: Formal Limitsmentioning
confidence: 99%
“…3.3 Basic Similarity Setting 57 We will not give much attention to a rigorous proof of such convergence. However, it is well known since the works of Stokes [43] that the Stokes equations describe well "slow flows," which are not turbulent and therefore not in the scope of this book.…”
Section: Formal Limitsmentioning
confidence: 99%
“…(b) We also note that the error estimate for the velocity approximations of divergencefree finite element methods do not have the "bad" factor k − 1 2 (cf. [13]) at the expense of using divergence-free finite element spaces and not approximating the pressure.…”
Section: )mentioning
confidence: 99%
“…A fully discrete mixed finite element scheme was also considered and strong convergence with rates was also proved for the velocity approximation. As noted in [13], the interaction of Lagrange multipliers with the stochastic forcing in the scheme limits the accuracy of general discretely LBB-stable space discretizations. Strategies to overcome this difficulty were also proposed in [13] although the convergence of the pressure approximation was not addressed.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…In [20] algorithms based on Wiener Chaos expansion for SNSE are considered, these algorithms can work on relatively short time intervals only. In [6,4] implicit and semi-discrete Euler time and …nite element based space-time discretizations are studied, convergence is proved in the mean-square (strong) sense. The work [14] deals with a time-splitting scheme combined with a Galerkin approximation in the space variable for SNSE exploiting the semi-group and cubature techniques, a weak convergence is proved for the proposed method.…”
Section: Introductionmentioning
confidence: 99%