Convergence acceleration of iterative algorithms. Applications to thin shell analysis and Navier-Stokes equations
Texte intégral
Documents relatifs
Studying approximations deduced from a Large Eddy Simulations model, we focus our attention in passing to the limit in the equation for the vorticity.. Generally speaking, if E(X) is
Mimicking the previous proof of uniqueness (given in Sec. 2.2) at the discrete level it is possible to obtain error esti- mates, that is an estimate between a strong solution (we
If we are in a case where the convolution operator commutes with the differentiation, we obtain that (u, p) is a solution of the mean incom- pressible Navier-Stokes Equations (1.2)..
An essential feature of the studied scheme is that the (discrete) kinetic energy remains controlled. We show the compactness of approximate sequences of solutions thanks to a
They go back to Nishida [39] for the compressible Euler equation (this is a local in time result) and this type of proof was also developed for the incompressible Navier-Stokes
Remark also that ℓ − 0 is by no means unique, as several profiles may have the same horizontal scale as well as the same vertical scale (in which case the concentration cores must
We consider a family of weights which permit to generalize the Leray procedure to obtain weak suitable solutions of the 3D incom- pressible Navier–Stokes equations with initial data
We show the stability of the scheme and that the pressure and velocity converge towards a limit when the penalty parameter ε, which induces a small divergence and the time step δt