Finite volume schemes for the approximation via characteristics of linear convection equations with irregular data

L’idée principale est ici de développer un schéma volumes finis original fondé sur le même type de discrétisations que celles introduites pour les équations d’Euler et sur la

Then we show the convergence of a sequence of discrete solutions obtained with more and more refined discretiza- tions, possibly up to the extraction of a subsequence, to a

The following lemma allows us to compare the results at the global scale (in variables (t, x)) and at the local scale (in variables (s, y)) in order to carry the desired result from

We rigorously prove, under ergodicity assumption of the approximation process, that the entropy rate produced by the numerical scheme for the Langevin process with additive noise is

It is proved in [5] that all of them are gradient discretisation methods for which general properties of discrete spaces and operators are allowing common convergence and

In Section 3, we show that all methods in the following list are gradient schemes and satisfy four of the five core properties (coercivity, consistency, limit-conformity,

We discretise the diffu- sion terms in (1) using the implicit Euler scheme in time and the so-called Discrete Duality Finite Volume (DDFV) schemes in space.. The DDFV schemes were

We will fur- thermore show that under certain circumstances approximate approximation phenomena occur, in the sense that, in case of non-convergence of the scheme to the true