2009
DOI: 10.1016/j.jcp.2008.10.025
|View full text |Cite
|
Sign up to set email alerts
|

Small-angle Coulomb collision model for particle-in-cell simulations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
68
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 58 publications
(68 citation statements)
references
References 27 publications
0
68
0
Order By: Relevance
“…The z-axis in (1) coincides with the velocity vector of the test particle in the local mean drift frame of the field particles before the test particle is collisionally scattered. The scattered velocity vector is transformed back to the laboratory Cartesian frame with the rotation matrix given in [1] or [6], and the local mean drift of the field particles is added. Equation (1) is a discretized solution of the Fokker-Planck equation for the probability density of velocities f (v)…”
Section: Collision Algorithms In Particle Codesmentioning
confidence: 99%
See 3 more Smart Citations
“…The z-axis in (1) coincides with the velocity vector of the test particle in the local mean drift frame of the field particles before the test particle is collisionally scattered. The scattered velocity vector is transformed back to the laboratory Cartesian frame with the rotation matrix given in [1] or [6], and the local mean drift of the field particles is added. Equation (1) is a discretized solution of the Fokker-Planck equation for the probability density of velocities f (v)…”
Section: Collision Algorithms In Particle Codesmentioning
confidence: 99%
“…In (19) of Manheimer et al, [4] a finite Δt correction to the drag F d is introduced to improve energy conservation. Energy and momentum conservation can be repaired by scaling and shifting velocities after the Monte Carlo collisions occur on each time step [4], [6].…”
Section: Collision Algorithms In Particle Codesmentioning
confidence: 99%
See 2 more Smart Citations
“…The binary collision is then performed by using a semi-relativistic extension [13] of the Takizuka and Abe collision algorithm. The grid-based algorithm performs at least as good or better than other gridbased algorithms [14,15], is more tolerant to rare large Gaussian random number because only a scattering angle is determined by the random number, is not subject to possible noise-induced numerical instability [15], and allows use of a significantly larger time step for electron-ion collisions [13].…”
mentioning
confidence: 99%