Page 1

Displaying 1 – 6 of 6

Showing per page

A hybrid scheme to compute contact discontinuities in one-dimensional Euler systems

Thierry Gallouët, Jean-Marc Hérard, Nicolas Seguin (2002)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

The present paper is devoted to the computation of single phase or two phase flows using the single-fluid approach. Governing equations rely on Euler equations which may be supplemented by conservation laws for mass species. Emphasis is given on numerical modelling with help of Godunov scheme or an approximate form of Godunov scheme called VFRoe-ncv based on velocity and pressure variables. Three distinct classes of closure laws to express the internal energy in terms of pressure, density and additional...

A hybrid scheme to compute contact discontinuities in one-dimensional Euler systems

Thierry Gallouët, Jean-Marc Hérard, Nicolas Seguin (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

The present paper is devoted to the computation of single phase or two phase flows using the single-fluid approach. Governing equations rely on Euler equations which may be supplemented by conservation laws for mass species. Emphasis is given on numerical modelling with help of Godunov scheme or an approximate form of Godunov scheme called VFRoe-ncv based on velocity and pressure variables. Three distinct classes of closure laws to express the internal energy in terms of pressure, density...

Accurate and online-efficient evaluation of the a posteriori error bound in the reduced basis method

Fabien Casenave, Alexandre Ern, Tony Lelièvre (2014)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

The reduced basis method is a model reduction technique yielding substantial savings of computational time when a solution to a parametrized equation has to be computed for many values of the parameter. Certification of the approximation is possible by means of an a posteriori error bound. Under appropriate assumptions, this error bound is computed with an algorithm of complexity independent of the size of the full problem. In practice, the evaluation of the error bound can become very sensitive...

Currently displaying 1 – 6 of 6

Page 1