Implicit particle-in-cell development for ion source plasmas
Bibliographic record
Abstract
Abstract Particle-in-Cell (PIC) codes used to study plasma dynamics within ion sources typically use an explicit scheme. These methods can be slow when simulating regions of high electron density in ion sources, which require resolving the Debye length in space and the plasma frequency in time. Recent developments on fully-implicit PIC models in curvilinear geometries have shown that these spatial/time scales can be significantly decreased/increased respectively, allowing for notable speed-ups in simulation time, and thus making it a potential tool for studying the physics of ion sources. For this purpose, a charge and energy conserving implicit PIC code has been developed in 1D to determine its potential for simulating bounded plasmas. In this paper, we use this model to simulate a 1D benchmark of a bounded plasma with fixed plasma density and electron/ion temperatures. The results are shown to compare well to the benchmark and to the results using an explicit PIC code. It is shown that the total amount of macro-particles used in the simulation is a better figure of merit for accurate results than the standard particles per cell used in literature. Significant speed-ups in computation time can be achieved for high plasma densities if the accuracy requirements are relaxed. In this case, we demonstrate the ability of the implicit PIC code to speed-up simulation time by nearly a factor of 12 compared to explicit PIC.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".