Loading…
Transport of Pollutant in Shallow Water A Two Time Steps Kinetic Method
The aim of this paper is to present a finite volume kinetic method to compute the transport of a passive pollutant by a flow modeled by the shallow water equations using a new time discretization that allows large time steps for the pollutant computation. For the hydrodynamic part the kinetic solver...
Saved in:
Published in: | ESAIM. Mathematical modelling and numerical analysis 2003-03, Vol.37 (2), p.389-416 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The aim of this paper is to present a finite volume kinetic method to compute the transport of a passive pollutant by a flow modeled by the shallow water equations using a new time discretization that allows large time steps for the pollutant computation. For the hydrodynamic part the kinetic solver ensures – even in the case of a non flat bottom – the preservation of the steady state of a lake at rest, the non-negativity of the water height and the existence of an entropy inequality. On an other hand the transport computation ensures the conservation of pollutant mass, a non-negativity property and a maximum principle for the concentration of pollutant and the preservation of discrete steady states associated with the lake at rest equilibrium. The interest of the developed method is to preserve these theoretical properties with a scheme that allows to disconnect the hydrodynamic time step – related to a classical CFL condition – and the transport one – related to a new CFL condition – and further the hydrodynamic calculation and the transport one. The CPU time is very reduced and we can easily solve different transport problems with the same hydrodynamic solution without large storage. Moreover the numerical results exhibit a better accuracy than with a classical method especially when using 1D or 2D regular grids. |
---|---|
ISSN: | 0764-583X 1290-3841 |
DOI: | 10.1051/m2an:2003034 |