A quasi-Monte Carlo method for the coagulation equation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A quasi-Monte Carlo method for the coagulation equation

Résumé

We propose a quasi-Monte Carlo algorithm for the simulation of the continuous coagulation equation. The mass distribution is approximated by a finite number $N$ of numerical particles. Time is discretized and quasi-random points are used at every time step to determine whether each particle is undergoing a coagulation. Convergence of the scheme is proved when $N$ goes to infinity, if the particles are relabeled according to their increasing mass at each time step. Numerical tests show that the computed solutions are in good agreement with analytical ones, when available. Moreover, the error of the QMC algorithm is smaller than the error given by a standard Monte Carlo scheme using the same time step and number $N$ of numerical particles.
Fichier non déposé

Dates et versions

hal-00950680 , version 1 (21-02-2014)

Identifiants

  • HAL Id : hal-00950680 , version 1

Citer

Christian Lecot, Ali Tarhini. A quasi-Monte Carlo method for the coagulation equation. Essays in Honour of Harald Niederreiter (on the occasion of his 70th birthday), Jun 2014, Linz, Austria. à paraitre. ⟨hal-00950680⟩
102 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More