Search

A key aspect in the modelling of magnetohydrodynamic (MHD) equilibria in tokamak devices is having access to fast, accurate, and stable numerical simulation methods. There is an increasing demand for reliable methods that can be used to develop traditional or machine learning-based shape control feedback systems, optimise scenario designs, and integrate with other plasma edge or transport modelling codes. To handle such applications, these codes need to be flexible and, more importantly, they need to have been validated against both analytically known and real-world tokamak equilibria to ensure they are consistent and credible. In this paper, we are interested in solving the static forward Grad-Shafranov (GS) problem for free-boundary MHD equilibria. Our focus is on the validation of the static forward solver in the Python-based equilibrium code FreeGSNKE by solving equilibria from magnetics-only EFIT++ reconstructions of MAST-U shots. In addition, we also validate FreeGSNKE against equilibria simulated using the well-established MATLAB-based equilibrium code Fiesta. To do this, we develop a computational pipeline that allows one to load the same (a)symmetric MAST-U machine description into each solver, specify the required inputs (active/passive conductor currents, plasma profiles and coefficients, etc.) from EFIT++, and solve the GS equation for all available time slices across a shot. For a number of different MAST-U shots, we demonstrate that both FreeGSNKE and Fiesta can successfully reproduce various poloidal flux quantities and shape targets (e.g. midplane radii, magnetic axes, separatrices, X-points, and strikepoints) in agreement with EFIT++ calculations to a very high degree of accuracy. We also provide public access to the code/data required to load the MAST-U machine description in FreeGSNKE/Fiesta and reproduce the equilibria in the shots shown.

The optimisation of scenarios and design of real-time-control in tokamaks, especially for machines still in design phase, requires a comprehensive exploration of solutions to the Grad-Shafranov (GS) equation over a high-dimensional space of plasma and coil parameters. Emulators can bypass the numerical issues in the GS equation, if a large enough library of equilibria is available. We train an ensemble of neural networks to emulate the typical shape-control targets (separatrix at midplane, X-points, divertor strike point, flux expansion, poloidal beta) as a function of plasma parameters and active coil currents for the range of plasma configurations relevant to spherical tokamaks with a super-X divertor, with percent-level accuracy. This allows a quick calculation of the classical-control shape matrices, potentially allowing real-time calculation at any point in a shot with sub-ms latency. We devise a hyperparameter sampler to select the optimal network architectures and quantify uncertainties on the model predictions. To generate the relevant training set, we devise a Markov-Chain Monte Carlo algorithm to produce large libraries of forward Grad-Shafranov solutions without the need for user intervention. The algorithm promotes equilibria with desirable properties, while avoiding parameter combinations resulting in problematic profiles or numerical issues in the integration of the GS equation., Comment: Physics of Plasmas in print, ICDDPS-4 special issue, 15 pages, 6 figures