Fast Algorithms for Numerical, Conservative, and Entropy Approximations of the Fokker–Planck–Landau Equation - Université Toulouse III - Paul Sabatier - Toulouse INP Accéder directement au contenu
Article Dans Une Revue Journal of Computational Physics Année : 1997

Fast Algorithms for Numerical, Conservative, and Entropy Approximations of the Fokker–Planck–Landau Equation

Résumé

We present fast numerical algorithms to solve the nonlinear Fokker–Planck–Landau equation in 3D velocity space. The discretization of the collision operator preserves the properties required by the physical nature of the Fokker–Planck–Landau equation, such as the conservation of mass, momentum, and energy, the decay of the entropy, and the fact that the steady states are Maxwellians. At the end of this paper, we give numerical results illustrating the efficiency of these fast algorithms in terms of accuracy and CPU time.
Fichier non déposé

Dates et versions

hal-00083043 , version 1 (29-06-2006)

Identifiants

  • HAL Id : hal-00083043 , version 1

Citer

C. Buet, Stéphane Cordier, Pierre Degond, Mohamed Lemou. Fast Algorithms for Numerical, Conservative, and Entropy Approximations of the Fokker–Planck–Landau Equation. Journal of Computational Physics, 1997, vol 133, pp.1036-1053. ⟨hal-00083043⟩
136 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More