Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Equilibrium schemes for scalar conservation laws with stiff sources
HTML articles powered by AMS MathViewer

by Ramaz Botchorishvili, Benoit Perthame and Alexis Vasseur PDF
Math. Comp. 72 (2003), 131-157 Request permission

Abstract:

We consider a simple model case of stiff source terms in hyperbolic conservation laws, namely, the case of scalar conservation laws with a zeroth order source with low regularity. It is well known that a direct treatment of the source term by finite volume schemes gives unsatisfactory results for both the reduced CFL condition and refined meshes required because of the lack of accuracy on equilibrium states. The source term should be taken into account in the upwinding and discretized at the nodes of the grid. In order to solve numerically the problem, we introduce a so-called equilibrium schemes with the properties that (i) the maximum principle holds true; (ii) discrete entropy inequalities are satisfied; (iii) steady state solutions of the problem are maintained. One of the difficulties in studying the convergence is that there are no $BV$ estimates for this problem. We therefore introduce a kinetic interpretation of upwinding taking into account the source terms. Based on the kinetic formulation we give a new convergence proof that only uses property (ii) in order to ensure desired compactness framework for a family of approximate solutions and that relies on minimal assumptions. The computational efficiency of our equilibrium schemes is demonstrated by numerical tests that show that, in comparison with an usual upwind scheme, the corresponding equilibrium version is far more accurate. Furthermore, numerical computations show that equilibrium schemes enable us to treat efficiently the sources with singularities and oscillating coefficients.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2000): 65M06, 65M12, 35L65
  • Retrieve articles in all journals with MSC (2000): 65M06, 65M12, 35L65
Additional Information
  • Ramaz Botchorishvili
  • Affiliation: VIAM, Tbilissi State University, 2 University Street, 380043 Tbilissi, Georgia
  • Email: rdboch@viam.hepi.edu.ge
  • Benoit Perthame
  • Affiliation: INRIA, M3N, domaine de Voluceau, BP 105, F78153 Le Chesnay
  • Address at time of publication: ENS, DMA, 45, rue d’Ulm, F75230 Paris cédex 05, France
  • Email: benoit.perthame@ens.fr
  • Alexis Vasseur
  • Affiliation: Laboratoire J.A. Dieudonné, UMR 6621, Université Nice-Sophia Antipolis, Parc Valrose, F-06108 Nice Cedex 02, France
  • MR Author ID: 642986
  • Email: vasseur@math3.unice.fr
  • Received by editor(s): March 29, 2000
  • Received by editor(s) in revised form: January 3, 2001
  • Published electronically: November 20, 2001
  • © Copyright 2001 American Mathematical Society
  • Journal: Math. Comp. 72 (2003), 131-157
  • MSC (2000): Primary 65M06, 65M12, 35L65
  • DOI: https://doi.org/10.1090/S0025-5718-01-01371-0
  • MathSciNet review: 1933816