Accelerated Solvers for Neutral Particle Dynamics in Plasma Simulation

The simulation of turbulence in the boundary region of a tokamak is crucial for understanding and optimizing the performance of fusion reactors. In this work, the use of low-rank linear algebra techniques is shown to enhance the efficiency of boundary simulations, specifically by accelerating the solution of a kinetic model for the neutral particles. Solving the kinetic model deterministically using the method of characteristics requires the solution of integral equations, which typically result in dense linear systems upon discretization. We employ hierarchical matrix approximations to significantly reduce the computational cost of assembling and solving the linear systems, leading to substantial savings in both time and memory. The hierarchical matrix method is implemented and tested within the GBS simulation code for boundary simulations, achieving over 90\% reduction in computation time and memory, and enabling simulations with unprecedented spatial resolution for neutral particles.

Publication Details

Journal
ArXiv.org
Published
2025-08-15
Primary Topic
Water Quality and Resources Studies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Accelerated Solvers for Neutral Particle Dynamics in Plasma Simulation

ArXiv.org
Water Quality and Resources Studies
article

Accelerated Solvers for Neutral Particle Dynamics in Plasma Simulation

article en

Abstract

The simulation of turbulence in the boundary region of a tokamak is crucial for understanding and optimizing the performance of fusion reactors. In this work, the use of low-rank linear algebra techniques is shown to enhance the efficiency of boundary simulations, specifically by accelerating the solution of a kinetic model for the neutral particles. Solving the kinetic model deterministically using the method of characteristics requires the solution of integral equations, which typically result in dense linear systems upon discretization. We employ hierarchical matrix approximations to significantly reduce the computational cost of assembling and solving the linear systems, leading to substantial savings in both time and memory. The hierarchical matrix method is implemented and tested within the GBS simulation code for boundary simulations, achieving over 90\% reduction in computation time and memory, and enabling simulations with unprecedented spatial resolution for neutral particles.

ArXiv.org
Affordable and clean energy
Openalex Percentile: Top 55%
Water Quality and Resources Studies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.