| Issue |
ESAIM: M2AN
Volume 43, Number 6, November-December 2009
|
|
|---|---|---|
| Page(s) | 1063 - 1097 | |
| DOI | https://doi.org/10.1051/m2an/2009038 | |
| Published online | 09 October 2009 | |
Relaxation and numerical approximation of a two-fluid two-pressure diphasic model
1
DEN/DANS/DM2S/SFME/LETR CEA-Saclay, 91191
Gif-sur-Yvette, France. annalisa.ambroso@cea.fr
2
Université Paris 7-Denis Diderot and UMR 7598, Laboratoire Jacques-Louis Lions, 75005 Paris, France. chalons@math.jussieu.fr
3
Université Pierre et Marie Curie-Paris 6, UMR 7598, Laboratoire Jacques-Louis Lions, 75005 Paris, France. coquel@ann.jussieu.fr
4
CNRS, UMR 7598, Laboratoire Jacques-Louis Lions, 75005 Paris, France.
Received:
6
May
2008
Revised:
3
November
2008
This paper is concerned with the numerical approximation of the solutions of a two-fluid two-pressure model used in the modelling of two-phase flows. We present a relaxation strategy for easily dealing with both the nonlinearities associated with the pressure laws and the nonconservative terms that are inherently present in the set of convective equations and that couple the two phases. In particular, the proposed approximate Riemann solver is given by explicit formulas, preserves the natural phase space, and exactly captures the coupling waves between the two phases. Numerical evidences are given to corroborate the validity of our approach.
Mathematics Subject Classification: 76T10 / 35L60 / 76M12
Key words: Two-phase flows / two-fluid two-pressure model / hyperbolic systems / finite volume methods / relaxation schemes / Riemann solvers.
© EDP Sciences, SMAI, 2009
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.