Skip to main navigation Skip to search Skip to main content

Optimal convergence rate of the multitype sticky particle approximation of one-dimensional diagonal hyperbolic systems with monotonic initial data

Research output: Contribution to journalArticlepeer-review

Abstract

Brenier and Grenier [SIAM J. Numer. Anal., 1998] proved that sticky particle dynamics with a large number of particles allow to approximate the entropy solution to scalar one-dimensional conservation laws with mono-tonic initial data. In [arXiv:1501.01498], we introduced a multitype version of this dynamics and proved that the associated empirical cumulative distri-bution functions converge to the viscosity solution, in the sense of Bianchini and Bressan [Ann. of Math. (2), 2005], of one-dimensional diagonal hyperbolic systems with monotonic initial data of arbitrary finite variation. In the present paper, we analyse the L1 error of this approximation procedure, by splitting it into the discretisation error of the initial data and the non-entropicity error induced by the evolution of the particle system. We prove that the error at time t is bounded from above by a term of order (1 + t)=n, where n denotes the number of particles, and give an example showing that this rate is optimal. We last analyse the additional error introduced when replacing the multitype sticky particle dynamics by an iterative scheme based on the typewise sticky particle dynamics, and illustrate the convergence of this scheme by numerical simulations.

Original languageEnglish
Pages (from-to)4963-4996
Number of pages34
JournalDiscrete and Continuous Dynamical Systems
Volume36
Issue number9
DOIs
Publication statusPublished - 1 Sept 2016

Keywords

  • Hyperbolic systems
  • Multitype sticky particle dynamics
  • Rate of convergence

Fingerprint

Dive into the research topics of 'Optimal convergence rate of the multitype sticky particle approximation of one-dimensional diagonal hyperbolic systems with monotonic initial data'. Together they form a unique fingerprint.

Cite this