Step-by-step verification of particle-in-cell Monte Carlo collision codes
Bibliographic record
Abstract
The particle-in-cell (PIC) method with Monte Carlo collisions (MCC) is widely used in the simulation of non-equilibrium plasmas for electric propulsion and laboratory applications. Due to the simplicity of the basic PIC algorithm and the specific modeling needs of the different research groups, many codes have been independently developed. Verification of these codes, i.e., ensuring that the computational code correctly implements the intended mathematical models and algorithms, is of fundamental importance. Different benchmark cases, such as one from Turner et al. [Phys. Plasmas 20, 013507 (2013)], Charoy et al. [Plasma Sources Sci. Technol. 28, 105010 (2019)], and Villafana et al. [Plasma Sources Sci. Technol. 30, 075002 (2021)], have been published in recent years. These have consisted of a complex physical setup, in which many computation modules interact to yield the final result. Although this approach has the advantage of testing the code in a realistic case, it may hide some implementation errors. Moreover, in the case of disagreement, the previous works do not provide an easy way to identify the faulty code modules. In this work, we propose a step-by-step approach for the verification of PIC-MCC codes in a 2D-3V electrostatic setup. The criteria for the test cases are (i) they should highlight possible implementation errors by testing the modules separately, whenever possible (ii) they should be free from physical instabilities to avoid chaotic behavior, and (iii) the numerical result should be accompanied by analytical calculations, for confirmation purposes. The seven test cases identified all show excellent agreement between the authors' codes.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.034 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.004 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".