Asymptotic-Preserving scheme for a strongly anisotropic vorticity equation arising in fusion plasma modelling
Andrea Mentrelli, Claudia Negulescu

TL;DR
This paper develops an efficient asymptotic-preserving numerical scheme to accurately simulate the evolution of electric potential in the highly anisotropic peripheral region of tokamak plasmas, crucial for fusion reactor performance.
Contribution
It introduces a novel asymptotic-preserving method tailored for strongly anisotropic vorticity equations in plasma physics, addressing computational challenges without high costs.
Findings
Successfully handles strong anisotropy and non-linear boundary conditions
Maintains accuracy across different asymptotic regimes
Reduces computational costs compared to traditional methods
Abstract
The electric potential is an essential quantity for the confinement process of tokamak plasmas, with important impact on the performances of fusion reactors. Understanding its evolution in the peripheral region - the part of the plasma interacting with the wall of the device - is of crucial importance, since it governs the boundary conditions for the burning core plasma. The aim of the present paper is to study numerically the evolution of the electric potential in this peripheral plasma region. In particular, we are interested in introducing an efficient Asymptotic-Preserving numerical scheme capable to cope with the strong anisotropy of the problem as well as the non-linear boundary conditions, and this with no huge computational costs. This work constitutes the numerical follow-up of the more mathematical paper by C. Negulescu, A. Nouri, Ph. Ghendrih, Y. Sarazin, "Existence and…
| model parameters | geometric configuration | |||||||
| case study | ||||||||
| Case (M) | ||||||||
| Case (P) | ||||||||
| AP scheme | SP scheme | AP scheme | ||||||
|---|---|---|---|---|---|---|---|---|
| -norm error | -norm error | -norm error | ||||||
| ✗ | ||||||||
| ✗ | ||||||||
| ✗ | ||||||||
| ✗ | ||||||||
| ✗ | ||||||||
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Asymptotic-Preserving scheme for a strongly anisotropic vorticity equation arising in fusion plasma modelling
Andrea Mentrelli†, Claudia Negulescu∗
Department of Mathematics & Alma Mater Research Center on Applied Mathematics (AM2), University of Bologna, Italy;
∗ Université de Toulouse & CNRS, UPS, Institut de Mathématiques de Toulouse UMR 5219, F-31062 Toulouse, France
[email protected]; [email protected]
Abstract.
The electric potential is an essential quantity for the confinement process of tokamak plasmas, with important impact on the performances of fusion reactors. Understanding its evolution in the peripheral region – the part of the plasma interacting with the wall of the device – is of crucial importance, since it governs the boundary conditions for the burning core plasma. The aim of the present paper is to study numerically the evolution of the electric potential in this peripheral plasma region. In particular, we are interested in introducing an efficient Asymptotic-Preserving numerical scheme capable to cope with the strong anisotropy of the problem as well as the non-linear boundary conditions, and this with no huge computational costs. This work constitutes the numerical follow-up of the more mathematical paper by C. Negulescu, A. Nouri, Ph. Ghendrih, Y. Sarazin, Existence and uniqueness of the electric potential profile in the edge of tokamak plasmas when constrained by the plasma-wall boundary physics.
Key words and phrases:
Keywords: Magnetically confined fusion plasma, Plasma-wall interaction, Singularly perturbed problem, Highly anisotropic evolution problem, Asymptotic-Preserving numerical scheme.
1. Introduction
The subject matter of the present paper is related to the magnetically confined fusion plasmas with the objective to contribute by some means to the improvement of the numerical schemes used for the simulation of the plasma evolution in a tokamak.
Succeeding to produce energy via thermonuclear fusion processes in a tokamak, is strongly dependent on the aptitude to confine the plasma in the core of the tokamak and at the same time on the ability to control the plasma heat-flux on the wall of the device. These two requirements (sine qua non) are incommoded by the turbulent plasma transport occurring in such high temperature environments. So, one of the most important research fields at the moment is the comprehension, the prediction as well as the control of the turbulent plasma flow in a tokamak, in particular in the edge region of such a device. What we mean with “edge” or “peripheral” region of the tokamak is the region constituted firstly of the open magnetic field lines of the SOL (Scrape-off Layer), intercepting the wall (at the limiter), and secondly of the closed field line region, nearby the separatrix.
The study of peripheral tokamak plasmas is crucial for several reasons. First of all, this region imposes boundary conditions for the core plasma, and has thus to be treated with care. In particular, it is very important for the confinement properties of the reactor, to understand the turbulences occurring there. Secondly, it is the SOL-plasma which enters into contact with the wall of the reactor, such that controlling this peripheral plasma can be important for the protection of the reactor.
In this peripheral region, fluid models are often employed to describe the plasma evolution. This is due to the befalling smaller temperatures, which induce smaller particle mean-field paths such that closure relations, such as the Braginskii closures [2], are valid and permit to obtain macroscopic fluid models from more accurate kinetic ones. The TOKAM3X code [20, 21], which is at the basis of the present work, is founded on such a fluid approach. The strong magnetic configuration has as an effect that the underlying conservation laws are strongly anisotropic. The plasma dynamics parallel to the magnetic field lines is very fast, whereas the dynamics in the perpendicular direction (with respect to the magnetic field) is more constraint. Multiple scales are thus present in the governing conservation laws, which render the mathematical as well as numerical study very challenging. Specific numerical algorithms have hence to be designed in order to capture accurately the physics of interest, without unnecessary small time and space steps. This is of primary importance, in order to reduce computational burden in such huge simulations.
The aim of the present paper is hence to contribute to the advance of the TOKAM3X code by proposing an efficient numerical scheme for a singularly-perturbed equation, which seems to be for the moment one of the troublesome points of this code. Indeed, the vorticity equation, which permits to compute the electric potential , is strongly anisotropic, leading numerically to an ill-conditioned problem. Standard numerical techniques require refined meshes in order to account for the strong anisotropy and to get accurate results. This leads necessarily to excessive computational costs and multi-scale numerical schemes could be a welcome alternative. The Asymptotic-Preserving scheme we propose in this paper is based on a microscopic-macroscopic decomposition of the unknown function (electric potential ) separating in this manner the fast and rapid scales in the problem and permitting to transform the original singularly-perturbed problem into a regularly-perturbed one. This last one is then simply discretized by a standard finite-difference method. This procedure allows the choice of meshes independent on the perturbation parameter , which describes the anisotropy, the numerical results remaining uniformly accurate for all ranges of .
Several types of AP-schemes have been introduced in literature, for various types of singularly-perturbed problems. To mention only some examples, we refer the interested reader to [3, 4, 8, 10, 12, 11, 17] and references therein. Briefly, Asymptotic-Preserving schemes are efficient procedures for solving singularly-perturbed problems. They consist in trying to mimic, at the discrete level, the asymptotic behaviour of the problem-solution as the perturbation parameter tends towards zero. This property renders the AP-scheme uniformly accurate, with respect to . The AP-scheme proposed in the present paper is based on the experience of the authors acquired with the study of highly anisotropic elliptic [5, 6, 7] or parabolic equations [14, 15].
The structure of this paper is the following: In Section 2 we shall present in detail the mathematical problem and the numerical difficulties one can encounter for its resolution. Section 3 presents and investigates mathematically an Asymptotic-Preserving reformulation for the underlying singularly-perturbed problem, reformulation which suites better for the limit of vanishing resistivity parameter, i.e. . Section 4 deals then with the discretization of the AP-method we introduced above. And finally, in Section 5 we shall first validate the AP-scheme, and then apply it in the case of a real thermonuclear plasma experiment.
2. The mathematical model
Let us now present the singularly-perturbed, non-linear problem, describing the evolution of the electric potential in the peripheral tokamak region, represented by the domain , which is sketched in Fig. 1. This equation reads
[TABLE]
and is completed with the initial condition
[TABLE]
for some given function . The imposed boundary conditions are the no-slip boundary conditions on
[TABLE]
periodic boundary conditions on , that means in the core of the plasma, and the nonlinear sheath boundary conditions on the limiters
[TABLE]
The source term is composed of a stiff and a non-stiff part, denoted respectively by and , whereas , and are some given constants. The parameter is the sheath floating potential and represents the parallel resistivity of the plasma and is supposed to be very small , resulting in a singularly-perturbed problem, which is very challenging to solve numerically. The domain covers both, closed flux surfaces (periodic region) and open flux surfaces, touching the limiter (nonlinear boundary conditions), describing thus the so-called SOL region (Scrape-off Layer) of a tokamak plasma.
Our model problem (2.1)–(2.4) is extracted from the TOKAM3X model [20, 21] which describes the dynamics of a magnetically confined tokamak edge-plasma via a fluid approach. At the basis of the TOKAM3X code are the balance equations for the electrons and ions, coupled to the Poisson equation for the electrostatic potential. Under some suitable assumptions, such as for example the quasi-neutrality condition, the low mass ratio assumption, the drift-approximation, and so on, one obtains a fluid model, based on the particle balance equation, the parallel momentum equation, the charge balance () and the parallel Ohm’s law, describing the evolution of respectively the electron density , the parallel ion momentum , the plasma potential and the parallel current , parallel with respect to the imposed strong magnetic field. Introducing the vorticity quantity , the set of equations at the foundation of the TOKAM3X code, read
[TABLE]
with the vorticity and the parallel current defined as
[TABLE]
In this system is the magnetic field, with direction , is a source term, is the static pressure defined as and is the normalized parallel collisional resistivity of the plasma. Furthermore denote the particle macroscopic velocities, with the perpendicular parts characterized in terms of the electric and curvature drift velocities, given by
[TABLE]
and where are the respective particle temperatures, considered in the present case as constant. The diffusion coefficients account for the collisional transport and/or diffusive transport (neoclassical and anomalous) and model the turbulences at small scales. System (2.5) allows to study the isothermal, electrostatic, 3D turbulences arising in the SOL. For its detailed derivation from the underlying conservation laws, we refer the interested reader to the references [20, 21]. The numerical simulations as well as a detailed analysis of the obtained results are also presented there. The authors remark that there are still some numerical difficulties to be further inquired in the vorticity equation, and this due to the strong anisotropy of the problem. In order to address these numerical difficulties, we decided to extract in this paper the vorticity equation from the whole system (2.5) and simplify it, keeping only the terms which cause complications. A simplified version of this potential equation is given by our problem (2.1)–(2.4) (see previous work [18] for its derivation from (2.5)).
The rigorous mathematical study, meaning the study of the well-posedness of this problem (existence, uniqueness and stability of a weak solution), has been considered in [18]. We observed in that work that the primary mathematical difficulties (for fixed ) arise on one hand from the degeneracy in time of the problem (regularization) and on the other hand from the non-linear boundary conditions. These difficulties will naturally also occur in the numerical treatment of this problem.
The main goal of the present paper is to propose a numerical follow-up of the latter more mathematical paper, in the aim to design an efficient numerical scheme for the resolution of problem (2.1)–(2.4). Typical computational challenges within this task come from:
- •
the high anisotropy of the problem, described by the small resistivity parameter , and introduced into the problem by the strong magnetic field, which confines the plasma;
- •
the non-linearity of the boundary conditions, describing the plasma-wall interactions (Bohm-conditions).
Concerning the first point, the anisotropy, we have to deal with a typical singularly-perturbed problem when . Such kind of problems are particularly difficult to treat numerically, as the equations change type as the perturbation parameter tends towards zero, leading (usually) to ill-posed problems in the limit. In the present case, the so-called “reduced-model” has the form
[TABLE]
associated with the other boundary conditions on and as well as the initial conditions. One can now remark that this reduced model is ill-posed, as it admits either no solution (if the initial condition is not well-prepared) or an infinite amount of solutions, as one can add to any solution another -dependent function, satisfying the boundary conditions on and the initial condition. On the discrete level, the -problem will always have infinitely many solutions, as one steps over the initial condition. This distinction between well-prepared and not well-prepared initial condition is related to the creation of a boundary layer near .
At the discrete level, all these complications will be translated into the fact that the linear system to be solved will become singular, as , or equally, becomes ill-conditioned as , leading hence to erroneous results. For not too small, fixed -values, a preconditioner could help, however in a general case, where the perturbation parameter varies within the simulation domain and takes various orders of magnitude, the preconditioner will no longer follow and new techniques have to be employed to rescue the user.
The occurrence of all these difficulties (theoretical as well as numerical) is strongly related to the multi-scale character of our problem. Indeed, for small the problem is evolving more rapidly in the -direction, which represents the direction of the strong magnetic field, than in the perpendicular -direction. Different space- and time-scales are hence introduced in the problem by the perturbation parameter , and in order to be accurate, a standard numerical scheme has to take into account for all these small scales, by imposing very restrictive grid-conditions as for example meshes of order . This can become rapidly too costly.
The aim of the next sections will be hence to introduce a multi-scale numerical scheme, based on the study of the asymptotic behaviour of the solution as goes to zero. A decomposition of into a macroscopic part and a microscopic one separates somehow the different dynamics in the problem. This procedure permits then the use of judicious mesh-sizes and time-steps, adapted to the physical phenomenon one wants to study and not to the perturbation parameter and permits to treat with no huge computational costs even the limiting case .
3. An asymptotic-preserving reformulation for the evolution problem
This section is devoted to a reformulation of the original singularly-perturbed electric potential problem (2.1)–(2.4), denoted in the sequel by , into a problem which behaves better in the limit .
The essence of our numerical method for the resolution of (2.1)–(2.4) is based on the following micro-macro decomposition of the unknown
[TABLE]
where the macroscopic function is chosen to be solution of the “dominant” problem
[TABLE]
associated with the other homogeneous or periodic conditions on the remaining boundaries. For the uniqueness of the decomposition, we shall further fix (or equivalently ) on an interface, denoted here , as follows
[TABLE]
Indeed, the decomposition (3.7) is now unique for given and fixed , precisely due to the fact that we impose on , fixing thus also on this interface. Problem (3.8) becomes thus a well-posed elliptic problem with unique solution for all .
With this decomposition, the problem transforms now into the completely equivalent system
[TABLE]
associated with the usual initial condition for , the usual homogeneous resp. periodic boundary conditions on resp. and the following boundary conditions on for the unknowns
[TABLE]
Note that no boundary condition for is needed on , as no -derivatives of occur in the system. We shall call in the following this problem the Asymptotic-Preserving reformulation of our Singularly-Perturbed problem (2.1)–(2.4), denoted simply by .
The equivalence of both problems, and , for any , is due to the uniqueness of the solution of (3.8) when imposing . This equivalence together with the mathematical existence and uniqueness studies of the problem , considered in [18], permits to show that is well-posed for each . The essential difference between these two reformulations is perceived only in the limit . Indeed, becomes singular, as explained in Section 2. Let us yet formally investigate what happens with the micro-macro reformulation , when goes to zero. Setting formally one gets the system
[TABLE]
associated with the following boundary conditions for the unknowns
[TABLE]
which is a type of saddle-point problem. The unknown can be seen here as a Lagrangian multiplier, associated to the constraint . The rigorous well-posedness of this limit problem is not the aim of the present paper, which is much more numerical, can however be a nice extension of this work, involving saddle-point theory.
Hence, the main benefit of the AP-reformulation is that in the limit one gets a well-posed problem, such that we have no more to face numerical singularities, when solving the reformulation for small -values. This big advantage shall be extensively put into light with the simulations performed in Section 5.
Before proceeding to the numerical treatment, let us mention here some words about the essence of the micro-macro decomposition (3.7), which is at the basis of our AP-reformulation. The idea behind was to eliminate the dominant, stiff operator, and this has been done by introducing a sort of separation of scales. The function solves the dominant operator, whereas incorporates the microscopic information. In the limit the microscopic part is still present in the homogenized limit model , and it is this part which renders the problem well-posed. It permits to recover the microscopic information, which was lost in the reduced model (2.6).
4. The numerical discretization via finite differences
In contrast to previous papers on highly anisotropic elliptic or parabolic problems [5, 6, 7, 14, 15], we made here the choice to solve the model equations outlined in Eqs. (2.1)–(2.4) and (3.10)–(3.11) by means of a numerical approach based on finite difference approximations, instead of relying on the finite element method. The reason for this choice is the fact that we would like to provide the team developing the TOKAM3X code, based on a discretization of the balance equations via the finite volume method, with a technique directly applicable in that context in a way as straightforward as possible.
For the investigation of the consistency and accuracy of the numerical scheme proposed here, a Cartesian uniform mesh with constant mesh size along both longitudinal and radial directions () has been adopted (see Section 5.2). This constant uniform mesh may however be abandoned to introduce mesh refinement near the borders of the domain, or where steep gradients of the solution are to be expected. Such a non-uniform Cartesian mesh has been adopted in the second part of our investigation, when the analysis of a problem setting inspired by a real physical plasma application is proposed. This will be presented in Section 5.3.
The semi-discretization in space is not the most critical part in the construction of an AP scheme, though. In fact, special care must be paid to the time-discretization, in particular when decisions have to be taken concerning which terms to take implicitly and which ones explicitly. In order not to destroy the desirable properties of our AP formulation, the time discretization is here based on the implicit Euler scheme. The interval is discretized in uniform steps , the solution being evaluated at the time instants defined as
[TABLE]
Let us present now the discretizations of both formulations, the -scheme formulated in Eqs. (3.10)–(3.11) respectively the -scheme formulated in Eqs. (2.1)–(2.4). In the following Section 5, we shall then compare the performances of these two formulations.
4.1. Semi-discretization in time of .
Discretizing Eq. (2.1) in time by means of the implicit Euler scheme, yields
[TABLE]
and hence for ,
[TABLE]
where , and denote the solution and the source terms resp. , evaluated at the -th time step, and is given by the initial condition (2.2).
This equation is associated with the following nonlinear boundary conditions:
[TABLE]
where we used the notation , and similarly for .
4.2. Semi-discretization in time of .
Discretizing Eq. (3.10) in time by means of the implicit Euler scheme yields for
[TABLE]
where denotes the microscopic function at the -th time step. Eq. (4.16) is associated with the following nonlinear boundary conditions:
[TABLE]
where is an arbitrary constant.
4.3. Linearization of the boundary conditions.
The treatment of the nonlinear boundary conditions is the same for both formulations or , and is based on a linearization obtained via a Taylor expansion. The following approximation has been adopted:
[TABLE]
leading to the following Robin boundary condition, substituting the boundary conditions on and for the scheme (see Section 4.1),
[TABLE]
and the following conditions substituting the boundary conditions on and for the scheme (see Section 4.2):
[TABLE]
4.4. Semi-discretization in space.
The computational domain , sketched in Fig. 1, has been discretized by means of a structured Cartesian grid. We shall denote by the maximum number of grid nodes in the (longitudinal) direction (the node located on is not included in the computational domain – and hence also in – because of the periodic boundary conditions on and ), and by the maximum number of grid nodes in the (radial) direction. Since the domain is not a square, the total number of grid points, denoted by , is in general .
In the case of the scheme, Eq. (4.14) is discretized in the grid points of the computational domain, leading to a system of algebraic equations with a number of unknowns matching the number of grid nodes, i.e. , where the components of the vector represent the grid values of the function .
In the case of the scheme, Eq. (4.16)1 is discretized on the grid points of the computational domain, and Eq. (4.16)2 is discretized on the grid nodes of the computational domain except the interface (due to the fact that the value of the function is prescribed on , as explained in Section 3), leading to unknowns. The components of the vector represent in this case the grid values of the function and the grid values of the microscopic function .
Standard finite difference approximations have been used to discretize the second and fourth order derivatives appearing in Eq. (4.14) and Eq. (4.16). Denoting with the value of the unknown variable () in the node located in the -th column and -th row of the Cartesian grid, whose and coordinates are, respectively, and , we have
[TABLE]
with
[TABLE]
and
[TABLE]
The boundary conditions given in Eq. (4.19) (for the scheme) or Eq. (4.20) (for the scheme) are then properly used to eliminate the ghost-nodes.
This discretization of the differential equations, together with the shape of the computational domain, result in a sparse matrix of the emerging linear system having a peculiar pattern. This pattern is represented in Fig. 2 for both and formulations of the problem, for a particularly poor discretization of the computational domain for the sake of the visualization (, , ; for the , for the problem).
In the case of the formulation, it is clearly visible that the band of the sparse matrix changes in correspondence to the change of the longitudinal size of the domain . This pattern is reproduced in the upper left block of the matrix pertaining to the formulation (in this case, the unknowns numbered from to represent the grid values of the variable , and the unknowns ranging from to represent the grid values of the microscopic function ).
The linear system associated to this sparse matrix is solved by means of the MUMPS library [16]. The error analysis, provided in Section 5, is carried out by means of an estimate of the upper bound of the error affecting the solution [1]– a metric which turns out to be particularly meaningful for sparse linear systems arising from a physical application – as well as by means of the traditional condition number [19]. The first metric is directly provided by the MUMPS library; the second is calculated with the aid of the linalg module of the SciPy software package [13].
5. Simulation results
In this section, selected numerical solutions are presented for two particular case studies. For this purpose, we have designed and implemented a code that allows to solve the model equations Eqs. (2.1)–(2.4) via both the scheme – leading to Eqs. (4.14)–(4.15) – and the scheme, leading to Eqs. (4.16)–(4.17).
The first case, a mathematical example denoted as Case (M), is a set-up for which a time-independent analytical solution has been constructed. The aim of this investigation is twofold. The primary aim is to validate the developed codes by comparing the numerical solution to the exact analytical solution. The second main purpose is to compare the numerical solution obtained by means of the formulation to the one obtained with the formulation, in order to highlight how the approach allows to overcome the difficulties encountered when using the approach, as the perturbation parameter .
The second case, a physical example denoted as Case (P), is a set-up closer to a real physical scenario inspired by the Tokamak configuration of interest for the research group developing the TOKAM3X code. The main purpose here is to investigate if the -based formulation represents a viable approach to the numerical study of the problem in a practical situation.
The details about the domain size, the model parameters and other settings of the numerical algorithms for the two above-mentioned cases are detailed in Section 5.1. In Section 5.2 and in Section 5.3, selected numerical solutions for Case (M) and Case (P), respectively, are presented.
5.1. Presentation of the test cases
The mathematical example, Case (M), regards a setting of the problem for which a time-independent exact solution was explicitly constructed. The set of model parameters (, and ), as well as the geometric configuration (dimensions , , , , ; see Fig. 1), are listed in Tab. 1.
The exact analytical solution , denoted as , along with the source terms and , denoted respectively as and , are defined as follows:
[TABLE]
It is worth noticing that the parameters listed in Tab. 1 as well as the source terms , and the solution , do not have any relevant physical meaning. The only purpose of their choice is to have at our disposal a relatively simple analytical solution to Eqs. (2.1)–(2.4) that allows us to validate the numerical code and to investigate the good properties of the asymptotic-preserving formulation of the problem.
The physical example, Case (P), regards a more physically-oriented set-up of the problem. The model parameters and the geometric configuration – also listed in Tab. 1 – completely characterize the physical systems together with the source terms and , denoted in this case respectively as and , and defined as
[TABLE]
The analysis of the configuration Case (P) is motivated by the purpose of applying the proposed numerical scheme to a real physical application as the study of a Tokamak plasma: in this respect, Case (P) resembles (despite significant simplifications and idealizations) to the actual configuration and working scenario of a Tokamak plasma of interest for the studies carried out by the team developing the numerical code TOKAM3X [9].
In both settings – Case (M) and Case (P) – the initial data is defined as follows:
[TABLE]
5.2. Numerical investigations of Case (M)
Let us test now the performances of both, and formulations, in Case (M). An exact steady-state solution to Eqs. (2.1)–(2.4) is given in (5.24). In this case, the adopted grid is uniform, with constant and equal step size in each direction, ; a sketch of the domain with an example of its discretization is provided in Fig. 3.
5.2.1. Validation of the numerical code and order of convergence
The -norm of the error of the numerical solution (with respect to the exact solution), as well as the order of convergence of the and numerical schemes, are shown in Tab. 2.
It is evident that the numerical scheme guarantees good performances for any value of the parameter in the interval ; even values of as small as or the limit case are not critical. Contrary to this, the scheme can be used only for larger values of . As Tab. 2 shows, the case is only treatable with the scheme, and even in the case , the scheme does not allow to obtain reasonable numerical results (or any result at all) when the grid is fine.
The behavior of the -norm of the error of the numerical solution (with respect to the exact solution) is shown in Fig. 4. Comparing these data to those shown in Tab. 2, it is easily seen that when considering the -norm, the convergence is of second order in space, while it is of first order in the -norm, which is completely standard.
5.2.2. Comparison of the and formulations
In order to compare the behavior of the and schemes for small values of , it is useful to take a closer look at the linear system of algebraic equations emerging from the discretization of the model equations.
A classical metric which provides insight in the reliability and accuracy of the solution of a linear system , is the condition number of the matrix , defined as . The larger the condition number, the closer to singular is the matrix. In this latter case, obtaining the solution to the linear system could not be feasible or, when feasible, the solution is typically affected by a large error and therefore should not be trusted as a reliable solution.
In more details, the relative effect of round-off errors on the solution of a linear system is bounded by the condition number of the matrix in the following manner
[TABLE]
where is the computed numerical solution of and can be seen as the exact solution of the slightly perturbed linear system , perturbations being due to round-off errors.
This traditional relative error-estimate is very pessimistic, for example it does not take into account for the particular form of the matrix , or for the special form of the right-hand side . A more satisfying approach has been proposed by Arioli et al. in [1], where the sparsity of the matrix is kept in mind. The relative error of the solution to the linear system is estimated in that work as follows
[TABLE]
where the quantities and (backward errors) are defined as follows
[TABLE]
with the -th row of , being the matrix with elements , the vector with elements , and representing the set of indices of the equations of the linear system such that is nonzero and is small, whereas representing the set of indices of the remaining equations (if is empty, then ).
Moreover, two condition numbers resp. of the system (not just of the matrix) are defined as follows:
[TABLE]
where is the column vector with all unitary elements. In the evaluation of only those equations with index are considered ().
In order to evaluate numerically the accuracy of the resolution of the linear system corresponding to our two problems and , in particular to examine the influence of the parameter on the obtained results, we plotted in Fig. 5 two graphs. Firstly, the standard condition number of the matrix associated to the and schemes, is plotted as a function of the perturbation parameter . As expected, the results show that as the perturbation parameter , the condition number associated to the increases as , signifying that the matrix gets closer and closer to a singular-matrix. In contrast, the condition number associated to the scheme never reaches critical values and remains independent of the parameter , clearly showing that the singularity of of the singularly perturbed problem (2.1) has been removed in the formulation we propose.
Secondly, to be sure that the traditional condition number is not too pessimistic in the here treated case, we decided to consider also the new metric proposed in [1], allowing to compute a good estimate of the upper bound of the relative error of the computed solution with respect to the exact solution of .
The analysis of the upper bound of the relative error of the computed solution, shown in Fig. 5, once more clearly points out how the solution corresponding to the -scheme rapidly becomes unreliable as . On the other hand, the relative error affecting the solution corresponding to the -scheme is roughly constant and of the order – also for .
5.3. Numerical investigations of Case (P)
In this section, we discuss the numerical results obtained for a case inspired by a real physical application, namely the evolution of the electric potential in the peripheral plasma region of a tokamak reactor. The list of model parameters and the geometric configuration of this case are given in Tab. 1, while a sketch of the discretized computational domain is provided in Fig. 6. In contrast to the mathematical case previously discussed in Section 5.2, the computational grid is not uniform in this case, being more refined (i.e. with smaller step sizes and ) in the proximity of the borders , , . A graphical representation of the source terms and , given in Eqs. (5.27)–(5.28), is provided in Fig. 7.
5.3.1. Error estimates of the numerical solution
To start, we computed also in this physical case the condition number and the upper bound of the relative error , introduced in Section 5.2.2, for the scheme and compared it to those obtained for the scheme.
These metrics, plotted in Fig. 8, clearly show that – as expected – also in this physical case the scheme does not provide reliable numerical results for values of the parameter below , while the -scheme always gives accurate numerical results independently on the parameter . The results are naturally obtained with a fixed grid and varying in , clearly underlying the Asymptotic-Preserving property of the numerical scheme we introduced in this work.
5.3.2. Selection of numerical results
Let us now study in more details the numerical results obtained for the physical Case (P).
In Fig. 9 and Fig. 10, we plotted the profiles of the solution as a function of at three different values of the radial coordinate, resp. as a function of at three different values of the longitudinal coordinate. The profiles obtained by means of the scheme are compared to those obtained with the scheme, for several values of the parameter . It is easily seen that as decreases, the profiles obtained with the scheme converge to the limit profile obtained with . This correct, expected behavior is not observed in the profiles calculated by means of the scheme. In this latter case, in fact, when is small enough (, in the case under investigation), the results are clearly not showing the expected trend. This behavior is naturally also pointed out by the -evolution of the upper bound estimate of the relative error affecting the computed numerical solution of the discretized algebraic system associated to (see Fig. 8). The results obtained by means of the scheme are therefore not reliable as the parameter approaches zero.
Looking in more details at Fig. 9 and 10 and reminding the reduced problem (2.6), one can do a very nice observation. As stated in Section 2, the solution to (2.6) is not unique, as one can add an arbitrary -dependent function to one solution , in order to get another solution. The -evolution of all these solutions is however well-defined. This specific feature can be now observed in Fig. 9 and 10. Indeed, for small -values, instead of solving the computer will solve the reduced problem (2.6), and will hence arbitrarily fix a function . Fig. 9 shows precisely this behaviour, as the -evolution is identical for both, and schemes, however has some difficulties below to find the right constant, for fixed . In Fig. 10, one notices immediately the wrong -evolution for the -scheme as gets smaller and smaller.
The computations shown in Fig. 9 and Fig. 10 have been carried out with , , ( for the scheme; for the scheme).
In Fig. 11, the evolution of the solution at four different time instants (, , and ) are represented. The initial data, as previously mentioned, is . The field , obtained for using the scheme, evolves towards the asymptotic solution represented in Fig. 11(d) for large times. The last of the shown fields, corresponding to , has been obtained with a time-independent version of the numerical code, and as such it represents the steady state solution.
In Fig. 12 a selection of the longitudinal and radial profiles of the solution are plotted for several time instants, including those presented in Fig. 11. From these profiles it is easy to observe that the solution converges to the steady-state solution labeled with . Briefly, the AP-scheme seems to recover also very well the asymptotics, and this for all values of . The numerical solutions graphically shown in Fig. 11 and Fig. 12 have been obtained with the scheme, with , , and . Grid refinement did not lead to appreciable changes in the results.
All the numerical results presented in this work have been obtained working in double precision floating-point arithmetics on a single node workstation, based on an Intel(R) Core(TM) i7-4770 CPU at 3.40GHz with hyper-threading enabled. A OpenMP-based parallelization has been adopted (when convenient) for the calculation of the linear system coefficients, and the MUMPS library has been compiled as to make use of OpenMP directives. In all cases, the computational time (“wall time”) of each single computation ranges from few seconds to few minutes, such that no further form of software or hardware acceleration was needed for the purpose of the present study.
6. Conclusion
We introduced in this work an Asymptotic-Preserving numerical scheme for the resolution of the highly anisotropic vorticity equation arising in plasma modelling. Numerical simulations permitted to underline the advantages of this new scheme as compared to standard discretizations, used in present simulation codes. In particular our AP-scheme permits to choose the grid independent on the perturbation parameter . This property can lead to an essential gain in memory and computational time, without loss of accuracy, for -values below a certain threshold value. This threshold value can be situated in our test cases at approximately . If the physical parameter is smaller than , then our AP-methodology could be of important benefit for tokamak simulations. For larger -values however, standard discretizations are to be preferred, as only one equation (for the unknown ) has to be solved, whereas our AP-scheme is constituted of two equations for . Keep nevertheless in mind that the -value can be varying in the simulation domain, taking different orders of magnitude in various parts of the domain. In such a case, the AP-formulation takes the advantage. Anyhow, our here presented AP-formulation has still to be extended to this situation of variable , as for the moment we treated only constant -values. Another future step would be also to implement this new AP-method in the TOKAM3X code and validate its practical use. All this will be the aim of a future work.
Acknowledgments. The authors would like first thank Patrick Tamain, Guido Ciraolo and Davide Galassi for fruitful discussions on this paper. Furthermore, we would like to acknowledge support from the Italian National Group for Mathematical Physics (GNFM/INdAM). This work has been carried out within the framework of the EUROfusion Consortium and has received funding from the Euratom research and training programme 2014-2018 under grant agreement No 633053. The views and opinions expressed herein do not necessarily reflect those of the European Commission.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Arioli, J. W. Demmel, I. S. Duff, Solving Sparse Linear Systems with Sparse Backward Error , SIAM J. Matrix Anal. Appl. 10 (1989), no.2, 165–190.
- 2[2] S.I. Braginskii, Transport processes in a plasma , , Reviews of Plasma Physics , 1 (1965), 205–311.
- 3[3] N. Crouseilles, M. Lemou, An asymptotic preserving scheme based on a micro-macro decomposition for collisional Vlasov equations: diffusion and high-field scaling limits , Kinetic and Related Models 4 (2011), no. 2, 441–477.
- 4[4] P. Degond, Asymptotic-Preserving Schemes for Fluid Models of Plasmas , Panoramas et synthèses 39-40 (2013), 1–90.
- 5[5] P. Degond, F. Deluzet, A. Lozinski, J. Narski, C. Negulescu, Duality based Asymptotic-Preserving Method for highly anisotropic diffusion equations , Communications in Mathematical Sciences 10 (2012), no. 1, 1–31.
- 6[6] P. Degond, F. Deluzet, C. Negulescu, An Asymptotic Preserving scheme for strongly anisotropic elliptic problem , SIAM Multiscale Modeling and Simulation 8 (2010), no. 2, 645–666.
- 7[7] P. Degond, A. Lozinski, J. Narski, C. Negulescu, An Asymptotic-Preserving method for highly anisotropic elliptic equations based on a micro-macro decomposition , Journal of Computational Physics 231 (2012), no. 7, 2724–2740.
- 8[8] F. Filbet, S. Jin, A class of asymptotic preserving schemes for kinetic equations and related problems with stiff sources , J. Comp. Physics 229 (2010), no. 20, 7625–7648.
