A study of the numerical heating in electrostatic particle simulations
โ Scribed by Hiroko Ueda; Yoshiharu Omura; Hiroshi Matsumoto; Takashi Okuzawa
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 721 KB
- Volume
- 79
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
โฆ Synopsis
We study the nonphysical increase of kinetic energy observed in electrostatic particle simulations. Quantitative analysis of the numerical heating is of vital importance in obtaining reliable results in simulation studies. The numerical heating caused by electrostatic fields is discussed with an emphasis on a couple of simulation parameters, such as the ratios of the number of particles Np to that of grid points N x, and Debye length A o to the grid size Ax. In this paper a measure called "heating rate" is used for this purpose, which is defined by the relative magnitude of the kinetic energy increment in unit time to the initial energy. The present numerical experiments have revealed that the heating rate may vary in proportion to (Np/Nx)-1 and (AD/A x)-3. The heating mechanisms are discussed in terms of nonphysical electric fields as observed in the fluctuation spectra of electric fields.
๐ SIMILAR VOLUMES
This article considers the treatment of long-range interactions in molecular dynamics simulations. We investigate the effects of using different cutoff distances, constant versus distancedependent dielectric, and different smoothing methods. In contrast to findings of earlier studies, we find that i
information [5]). Hereafter, the term direct numerical simulation (DNS) refers to the numerical integration of the Direct numerical simulation of a dilute suspension of finite-volume spheres requires computation of the time-varying fluid field exact equations of motion for the fluid and particle pha
An implicit scheme is developed for nonlinear heat transfer problems. The scheme possesses a number of properties. The most notable are the second-order accuracy in both space and time, the conservative feature, quick damping of numerical errors when the size of time step is large, the iterative app