Machine Learning approach to modeling of neutral particles transport in plasma
M. V. Umansky, G. J. Parker, R. D. Smirnov
TL;DR
The paper tackles neutral transport in fusion boundary plasmas, where accurate modeling of neutrals is essential for self-consistent edge dynamics; neutrals obey the kinetic equation $\hat{L} f_n = S_n$ and can be represented by a Green function (propagator). It introduces a propagator-based Monte Carlo framework using a single-collision propagator $\hat{P}$ to construct the total CX source via $\vec{S}_{cx,tot} = \sum_{m\ge1} \hat{P}^m \vec{S}_n$ and solves $(I-\hat{P}) \vec{S}_{cx,tot} = \hat{P} \vec{S}_n$. A densely connected neural network learns to map plasma density profiles to the propagator matrix (size $N^2$) with architecture: input 5, hidden 11, output $N^2$, trained by MSE with NAdam, yielding smooth, differentiable propagator outputs. 1D tests show agreement with direct MC and demonstrate speed-ups, with results suggesting feasibility of extending to higher dimensions and coupling to plasma solvers via Newton-Krylov time integration, while scaling remains for future work.
Abstract
A propagator-based approach is investigated for Monte-Carlo (MC) modeling of neutral particles transport in fusion boundary plasmas. The propagator is essentially a Green function for the neutral kinetic equation, which depends on the plasma profiles. A Neural Network (NN) based model for the propagator provides a fast and accurate solution for the neutral distribution function in plasma. Furthermore, continuous and smooth dependence of NN-based reconstruction of the propagator on the plasma parameters opens the possibility for using this approach with Jacobian-based methods for time-integration and root finding. Initial results from a small 1D test problem look promising; however, important research questions are concerned with the scaling of the algorithm to larger systems.
