Hostname: page-component-89b8bd64d-mmrw7 Total loading time: 0 Render date: 2026-05-07T08:09:14.389Z Has data issue: false hasContentIssue false

Data-driven model discovery for plasma turbulence modelling

Published online by Cambridge University Press:  14 December 2022

I. Abramovic*
Affiliation:
University of Technology Eindhoven, De Zaale, 5612 AJ Eindhoven, The Netherlands Massachusetts Institute of Technology, 77 Massachusetts Ave, Cambridge, MA 02139, USA
E.P. Alves
Affiliation:
Department of Physics and Astronomy, University of California, Los Angeles, CA 90095, USA
M. Greenwald
Affiliation:
Massachusetts Institute of Technology, 77 Massachusetts Ave, Cambridge, MA 02139, USA
*
Email address for correspondence: iabramovic@psfc.mit.edu
Rights & Permissions [Opens in a new window]

Abstract

An important problem in nuclear fusion plasmas is the prediction and control of turbulence which drives the cross-field transport, thus leading to energy loss from the system and deteriorating confinement. Turbulence, being a highly nonlinear and multiscale process, is challenging to theoretically describe and computationally model. Most advanced computational models fall into one of the two categories: fluid or gyro-kinetic. They both come at a high computational cost and cannot be applied for routine simulation of plasma discharge evolution and control. Development of reduced models based on (physics informed) artificial neural networks could potentially fulfil the need for affordable simulations of plasma turbulence. However, the training requires an extensive data base and the obtained models lack extrapolation capability to scenarios not originally encountered during training. This leads to reduced models of limited validity which may not prove adequate for predicting scenarios in future machines. In contrast, we explore a data-driven model discovery approach based on sparse regression to infer governing nonlinear partial differential equations directly from the data. Our input data are generated by simulations of drift-wave turbulence according to the Hasegawa–Wakatani and modified Hasegawa–Wakatani models. Balancing model accuracy and complexity enables the reconstruction of the systems of partial differential equations accurately describing the dynamics simulated in the input data sets. Sparse regression is not data hungry and can be extrapolated to unexplored parameter ranges. We explore and demonstrate the potential of this approach for fusion plasma turbulence modelling. The findings show that the methodology is promising for the development of reduced and computationally efficient turbulence models as well as for existing model cross-validation.

Information

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
Copyright © The Author(s), 2022. Published by Cambridge University Press
Figure 0

Figure 1. Code structure: the arrows denote the flow of information and the blocks depict the sequence of steps performed by the sparse regression (SR) algorithm. The colour coding refers to parts of the code which might need to be adapted to a particular physics problem depending on the input data structure and content (red) and the parts which essentially remain the same regardless of the input data structure and content (blue).

Figure 1

Figure 2. The HW (a,b) and mHW (c,d) density and vorticity data.

Figure 2

Table 1. Simulation set-up and correct model coefficients.

Figure 3

Figure 3. Main result on the noise-less synthetic data. The two different markers, circles and triangles, represent model-form variance obtained in the cross-validation procedure (variance in the sparsity vector $\xi$). The red ellipses circle the points of optimal accuracy/complexity trade-off and correspond to identification of correct features of the HW system of PDE. The ‘error’ bars represent the minimum and maximum FVU encountered during cross-validation.

Figure 4

Table 2. Results of SR for the density equation of the HW and mHW models.

Figure 5

Table 3. Results of SR for the vorticity equation of the HW and mHW models.

Figure 6

Table 4. Results of the sensitivity to the spatial domain size of the sampling region.

Figure 7

Figure 4. Sensitivity to spatial sampling domain size: largest (a) and smallest (b) sampling regions used in the study.

Figure 8

Table 5. Results of the sensitivity to the sample time-series length.

Figure 9

Figure 5. First derivative of the SSI over the sample. The SSI is calculated between the first data frame and every consecutive data frame throughout the sample. The curve indicates the evolution of the dynamics in the data starting from the first frame.

Figure 10

Figure 6. The FVU for the density equation of the HW model for noisy data. The level of noise is increased from $0\,\%$ to $18\,\%$ (see table 6 for details). The inflection in the accuracy/complexity curve is reduced as the noise level is increased. The number of recovered terms of the density PDE progressively drops from $5$ to $2$.

Figure 11

Table 6. Average error on the recovered feature coefficients from noisy data.

Figure 12

Table 7. Number of features recovered in the presence of $6\,\%$ noise and increasing sampling volume size.