Plasma simulations with adaptive mesh and algorithm refinement

summary

The gist

Plasma simulations with adaptive mesh and algorithm refinement describes PAMAR, which extends Adaptive Mesh and Algorithm Refinement to weakly ionized plasmas by making each species an independent…

In short

PAMAR extends adaptive mesh and algorithm refinement to weakly ionized plasmas by using independent solvers for each species. It successfully simulated a planar discharge and a floating sphere, resolving electron groups and kinetic time scales without statistical noise. This method offers high-resolution dynamic properties of these discharges.

Key concepts

PAMAR
A simulation framework that adapts the mesh and algorithm independently for each plasma species. Each species gets its own solver based on its phase-space needs, connected by a field solver, allowing for highly detailed modeling of complex plasmas.
Species-Specific Solvers
The core idea is treating electrons and ions separately. Each species uses an adaptive mesh and refinement criteria tailored to its specific physics (e.g., kinetic vs. fluid). This allows the simulation to use the most appropriate mathematical model for each particle type.
Transport Model Hierarchy
A layered approach describing plasma transport, starting from kinetic models for electrons and ions, moving through angular moments, and ending with fluid equations at larger scales. This hierarchy ensures efficiency by using simpler models when spatial or temporal scales are large enough.
Hybrid Solvers
The framework uses different solvers based on local conditions. For example, the ion solver switches between kinetic and fluid models depending on temperature, while the electron solver uses a kinetic octree for escaping electrons and a Fokker-Planck model elsewhere.

Terminology used across episodes

This episode discusses

The paper

Plasma simulations with adaptive mesh and algorithm refinement · Read on arXiv

University of Alabama in Huntsville · CFD Research Corporation

Transcript

Introduction to the show: ident: Physics. The day in general physics: instruments, methods and results across the field.

Kai: We're looking at the paper: "Plasma simulations with adaptive mesh and algorithm refinement".

Mira: Here's the gist of the paper. Plasma simulations with adaptive mesh and algorithm refinement describes PAMAR, which extends Adaptive Mesh and Algorithm Refinement to weakly ionized plasmas by making each species an independent adaptive-mesh solver with its own phasespace dimensionality and refinement criteria, coupled through a field solver in one executable The paper demonstrates this capability for a planar capacitively coupled discharge computed with 1d1v two-stream kinetic solvers and for a floating sphere in a weakly collisional plasma computed with 1d2v octree solvers.

Kai: PAMAR combines adaptive Cartesian meshes with automatic selection of kinetic or fluid solvers across a computational domain It was introduced for rarefied gas dynamics in the Unified Flow Solver and extended to gas mixtures, particle and lattice-Boltzmann solvers, computational electromagnetics, multi-phase flows, and heterogeneous CPU–GPU architectures.

Mira: The central idea is that each plasma species is described by an independent adaptive-mesh solver with its own phase-space dimensionality, refinement criteria, and time step The physical model for electrons and ions is a build-time switch between a fully kinetic, a reduced-kinetic, and a fluid solver behind one fixed interface.

Kai: Transport Model Hierarchy A hierarchy of transport models describes electrons and ions in a weakly ionized plasma This hierarchy includes kinetic, angular moments with closures (an intermediate kinetic level), and fluid (velocity moments).

Paper summary: Mira: To summarize what they did here, PAMAR describes a plasma extension of their adaptive mesh and algorithm refinement method that allows electrons, ions, neutral species, and electromagnetics to have independent adaptive mesh solvers with their own phase-space dimensionality, refinement criteria, and time steps per solver.

Kai: It claims this is possible even in weakly ionized plasmas where the mass, velocity, and time scale differences between species are huge compared to gas dynamics.

Lev: They show two demonstrations: a transient simulation of a planar capacitively coupled plasma using one-dimensional two-stream kinetic solvers for electrons and ions on independent adaptive quadtrees, and another demonstration with a steady spherical plasma problem using one-dimensional two-velocity mu octree solvers for both species.

Kai: The results they got from these simulations are noise-free kinetic models of a capacitive discharge around a spherical probe, and they also resolve the three electron groups and the different time scales of electron and ion kinetics without any statistical noise.

Mira: They use this framework to show that when you look at specific plasma problems like planar discharges, they can resolve dynamic properties without the statistical noise you often get from particle-in-cell simulations.

Lev: The way they handle solver selection is a hybrid approach: the ion solver keeps the kinetic solver where its own solution shows temperature above one point five times the gas temperature and uses a fluid model elsewhere, while the electron hybrid keeps the two dimensional octree only for escaping electrons in the loss-cone layer and uses a Fokker–Planck model in position and total energy elsewhere.

Kai: That sounds like they are trying to be efficient by only running the most complex solver when it's actually needed, which is smart when you're dealing with computational costs.

Mira: They also mention that for the spherical results, the adaptive ion octree resolves cold ions at a tenth of the uniform mesh cost, and graded meshes improve absorbed flux, collected currents, and density profiles.

Lev: The paper notes that their per-species clocks help accelerate the approach to steady state in both demonstrations.

Kai: It seems like they’ve managed to get some high-resolution kinetic physics in a way that’s computationally tractable for these complex plasmas.

Mira: The paper itself is called "Plasma simulations with adaptive mesh and algorithm refinement," which points to how this methodology extends past its original use in rarefied gas dynamics into the realm of plasma physics.

Conclusion: Kai: So, thinking about the title, "Plasma simulations with adaptive mesh and algorithm refinement," it really tells you that this isn't just a minor tweak; they’re fundamentally changing how we model different physical scales in plasmas.

Mira: I think what matters is that they showed how to apply this complex adaptive meshing to weakly ionized plasmas where the species are so different in mass and time scale, which was a big challenge for their original work.

Lev: The implications are pretty deep because they’ve resolved things like the formation of electron groups and the two time averages of the potential that govern electrons and ions in planar discharges without statistical noise from PIC simulations.

Kai: And for the spherical case, it shows that adaptive ion octrees can resolve cold ions at a fraction of a uniform mesh cost while improving flux profiles.

Mira: The paper suggests that using angular-moment levels is the right tool for efficiently describing electrons in gas-discharge plasmas, which is something they found effective.

Lev: A major limitation they point out is that their GPU path is constrained by the current backend of Basilisk, which only supports Cartesian grids and not the adaptive quadtrees and octrees used by these kinetic solvers.

Kai: And another big one mentioned is that replacing explicit time advance with an implicit scheme for electrons coupled to Poisson's equation would let the coupled system advance on the ion or RF time scale, which they suggest would reduce the cost by several orders of magnitude.

Mira: So, while this method gives them great results for specific geometries like planar discharges and spheres, the current computational path is limited by hardware capabilities and explicit time stepping.

Lev: That makes sense; I'm always looking at how to take these theoretical advancements and make them actually runnable on real hardware with minimal overhead.

More episodes

← Home