Analysis of an asymptotic preserving scheme for linear kinetic equations in the diffusion limit
Jian-Guo Liu, Luc Mieussens (IMB)

TL;DR
This paper provides a mathematical analysis demonstrating that an asymptotic preserving scheme for linear kinetic equations remains stable and accurate across different regimes, with conditions depending on the mean free path.
Contribution
The paper offers a rigorous proof of the uniform stability and accuracy of the scheme under a CFL condition that adapts to the mean free path, using simple energy estimates.
Findings
Scheme is uniformly stable and accurate across regimes.
CFL condition adapts to mean free path size.
Analysis uses simple energy estimates.
Abstract
We present a mathematical analysis of the asymptotic preserving scheme proposed in [M. Lemou and L. Mieussens, SIAM J. Sci. Comput., 31, pp. 334-368, 2008] for linear transport equations in kinetic and diffusive regimes. We prove that the scheme is uniformly stable and accurate with respect to the mean free path of the particles. This property is satisfied under an explicitly given CFL condition. This condition tends to a parabolic CFL condition for small mean free paths, and is close to a convection CFL condition for large mean free paths. Ou r analysis is based on very simple energy estimates.
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.
Taxonomy
TopicsGas Dynamics and Kinetic Theory · Nuclear reactor physics and engineering · Lattice Boltzmann Simulation Studies
*draft, for submission to SINUM, *
**Analysis of an asymptotic preserving scheme for linear kinetic equations in the diffusion limit
**
Jian-Guo Liu111Department of Physics and Department of Mathematics, Duke University, Durham, NC 27708, USA ([email protected]), Luc Mieussens222Institut de Mathématiques de Bordeaux (UMR 5251), Université de Bordeaux, 351, cours de la Libération, 33405 Talence cedex, France ([email protected])
**Abstract. ** We present a mathematical analysis of the asymptotic preserving scheme proposed in [M. Lemou and L. Mieussens, SIAM J. Sci. Comput., 31, pp. 334–368, 2008] for linear transport equations in kinetic and diffusive regimes. We prove that the scheme is uniformly stable and accurate with respect to the mean free path of the particles. This property is satisfied under an explicitly given CFL condition. This condition tends to a parabolic CFL condition for small mean free paths, and is close to a convection CFL condition for large mean free paths. Our analysis is based on very simple energy estimates.
Key words. transport equations, diffusion limit, asymptotic preserving schemes, stiff terms, stability analysis
AMS subject classifications. 65M06, 35B25, 82C80, 41A60
1 Introduction
Particle systems are often described at the microscopic level by kinetic models (neutron transport, radiative transfer, electrons in semi-conductors, or rarefied gas dynamics). Simulating such systems by using kinetic models can be computationally very expensive, but modern super computers now enable realistic simulations. When the mean free path of the particles is very small as compared to the (macroscopic) size of the computational domain, the kinetic model can be very well approximated by a much simpler macroscopic model (diffusion equation, Rosseland approximation, Euler and Navier-Stokes equations), that can be numerically solved much faster.
However, there are many cases where the ratio mean free path/macroscopic size (the so-called “Knudsen number” in rarefied gas dynamics, denoted by in this paper) is not constant: depending on the geometry of the boundaries, or on the boundary conditions, this ratio may vary in time, and in space. In such multiscale situations, usual kinetic solvers are often useless: for stability and accuracy reasons, they must resolve the microscopic scales, which is computationally to expensive in “fluid” zones (where is small). By contrast, macroscopic solvers are faster but may be inaccurate in “kinetic” zones (where is large).
This is why many people have been working for more than 20 years on a kind of multiscale kinetic schemes: the asymptotic-preserving (AP) schemes. Such schemes are uniformly stable with respect to (thus their computational complexity does not depend on ), and are consistent with the macroscopic model when goes to [math] (the limit of the scheme is a scheme for the macroscopic model).
Up to our knowledge, AP schemes have first been studied (for steady problems) in neutron transport by Larsen, Morel and Miller [22], Larsen and Morel [21], and then by Jin and Levermore [10, 11]. For unstationary problems, the difficulty is the time stiffness due to the collision operator. To avoid the use of expensive fully implicit schemes, two classes of semi-implicit time discretizations have been proposed by Klar [16] and Jin, Pareschi and Toscani [15] (see preliminary works in [14, 9] and extensions in [13, 12, 25, 17, 18]. Similar ideas have also been used by Buet et al. in [4].
In [23], Lemou and Mieussens have proposed a new AP scheme based on the micro-macro decomposition of the distribution function into microscopic and macroscopic components (similar schemes have also been proposed by Klar and Schmeiser [19], and more recently by Carrillo et al. [5, 6]). A coupled system of equations is obtained for these two components without any linearity assumption. The decomposition only uses basic properties of the collision operator that are common to most of kinetic equations (namely conservation and equilibrium properties). Then this system is solved with a suitable time semi-implicit discretization and space finite differences on staggered grids. While almost all the schemes mentioned before are based on very similar ideas, the approach proposed in [23] has been shown to be very general, since it applies to kinetic equations for both diffusion and hydrodynamic regimes (for the diffusion regime, see [23] for linear transport equations and [3] for the non-linear Kac equation, for the hydrodynamic regime, see [2] for the Boltzmann equation). We also mention the work of Degond, Liu and Mieussens [7] who proposed a similar approach (micro-macro decomposition) to design macroscopic diffusion models with kinetic upscalings: this approach also leads to AP schemes, at least for a semi-discrete time discretization (no AP space discretization was studied in this paper).
While many different schemes have been proposed in the past few years, it appears that the rigorous proof of their AP property looks rather difficult and is seldom investigated. Up to our knowledge, there are only two papers on this subject. Klar and Unterreiter [20] have proved that a scheme similar to that of [16] and [15] for the linear transport equation is uniformly stable. However, their proof is based on a von Neumann analysis, and hence is restricted to a one dimensional equation with constant coefficients in a periodic domain. Gosse and Toscani have proposed in [8] an AP scheme based on a rather different idea (discretization of the collision term as a non-conservative product and use of well-balanced Godunov schemes): they have been able to prove a uniform stability property, still in the linear case, but also a strong positivity property. However, their scheme is based on techniques (like approximation of the steady solution) that are difficult to generalize to other equations.
In this paper, we propose a very simple stability proof for the AP scheme of [23] and we exhibit an explicit CFL condition. This condition is uniform with respect to , and gives a standard parabolic CFL condition when goes to 0. While a stability property was already proved in [23] for this scheme, this was only for a simple two-velocity model (telegraph equation), by using von Neumann analysis. Here, our proof is based on energy estimates that are more general than von Neumann analysis, and hence is valid for one-dimensional linear equations with non-constant coefficients, continuous velocity variable, in the whole space. By the same technique, we are also able to prove uniform error estimates.
Our paper is organized as follows. In section 2, we introduce a general linear equation, we present its discretization by the AP scheme, and we give the main features of this scheme. Then, in section 3, we give our main stability result and its proof. The error estimates are given in section 4.
2 An AP scheme for the linear transport equation
Linear transport equation is a model for the evolution of particles in some medium (neutron transport, linear radiative transfer, …). Generally, this model reads, in scaled variables
[TABLE]
where is the number density of particles in the position-direction phase space that depends on time , position , and angular direction of propagation of particles . Moreover, is the total cross section, is the absorption cross section, and is an internal source of particles, which is independent of . The linear operator models the scattering of the particles by the medium and acts only on the angular dependence of . This simple model does not allow for particles of possibly different energy (or frequency); it is called “one-group” or “monoenergetic” equation. The parameter is a scale factor that measures the ratio between a typical microscopic length (the mean free path of a particle, for instance) to a typical macroscopic length (the size of the computational domain, for instance). See [22] for details.
In this paper, we consider this one-group equation in the slab geometry: we assume that depends only on the slab axis variable . Then it can be shown that the average of with respect to the cosine directions of , denoted by , satisfies the one-dimensional equation
[TABLE]
where is the cosine direction of . At , we have the initial data . We assume that the cross sections satisfy the inequalities and for every . We do not consider boundary conditions in this paper, and hence .
The linear operator is given by
[TABLE]
where the kernel is such that for every in . We also assume that satisfies , and that it is symmetric: . For the sequel, it is useful to define the operator such that is the average of every velocity dependent function . With these assumptions, it is standard [1] to state the following properties of :
Proposition 2.1**.**
- •
* for every in *
- •
the null space of is (constant functions)
- •
the rank of is
- •
* is non-positive self-adjoint in and we have*
[TABLE]
for every
- •
* admits a pseudo-inverse from onto , denoted by *
- •
the orthogonal projection from onto is
When becomes small (the “diffusion” regime), it is well known that the solution of (1) tends to its own average density , which is a solution of the asymptotic diffusion limit
[TABLE]
where the diffusion coefficient is . An asymptotic preserving scheme for the linear kinetic equation (1) is a numerical scheme that discretizes (1) in such a way that it leads to a correct discretization of the diffusion limit (4) when is small.
Now, we summarize the results obtained in [23]. By using the micro-macro decomposition , where and is such that , we derived the micro-macro model for (1) that reads
[TABLE]
with initial data and . This system if formally equivalent to (1).
Then, we proposed the following numerical scheme for this system. We choose a time step and times , and two staggered grids of step and nodes and We use the approximated values and , and the scheme reads
[TABLE]
where . Note that as in the continuous case, this scheme preserves the zero average of :
Proposition 2.2**.**
If the initial data satisfies for every , then for every and , we have
[TABLE]
Proof.
Apply the average operator to (6b): since we have (obvious), (proposition 2.1), and (obvious), this relation yields , which gives the result. ∎
In scheme (6), the upwind discretization of is to insure stability in the kinetic regime, while the centered approximations of and are to capture the diffusion limit. Indeed, it is clear that when goes to 0, we have from (6b) . Consequently, the flux of is
[TABLE]
where we have used the facts that does not depend on and that —and hence too—only applies to functions of . Then, using this relation in (6a), we get
[TABLE]
with , which is the usual 3-points stencil explicit scheme for the diffusion equation (4).
Of course, this property is true only if can be chosen independently of , or in other words, if the scheme is uniformly stable with respect to . In [23], we have proved that this scheme is indeed uniformly stable under some CFL condition, in the simpler case of the telegraph equation (in which we have only two discrete velocities , and , , ). In the following section, we extend this result to the general equation (1) for scheme (6).
3 Uniform stability
We give our main result of stability for scheme (6). Without lost of generality, we assume (source free case).
Theorem 3.1**.**
If satisfies the following CFL condition
[TABLE]
with , then the sequences and defined by scheme (6) satisfy the energy estimate
[TABLE]
for every , and hence the scheme (6) is stable.
Note that CFL condition (9) can be viewed as an average of a diffusive CFL condition (needed for the diffusion scheme (8)) and of a convection CFL . It shows that the scheme is stable uniformly in , that is to say a diffusive CFL condition is sufficient for stability for small , while a convection CFL is sufficient for .
Moreover, while our CFL condition (9) is valid for every , we point out that it is not optimal for each . This might be the price to be paid for getting a uniform condition. For instance, in the simpler case of constant cross sections () and kernel (), the diffusion coefficient of the diffusion equation (8) is , and the optimal CFL condition for scheme (8) is . However, CFL condition (9) for our AP scheme reads (for ) , which is as small as the optimal CFL.
Remark 3.1*.*
If we have a source term , then the same CFL condition naturally gives a linear growth of the energy. Since this is standard and does not lead to any additional difficulty, we do not consider this case here.
Remark 3.2*.*
In the case of a time explicit discretization of the absorption term (that is to say when is replaced by in (6), we have the same result with a CFL condition which is a bit more complicated. Namely, the scheme is stable if
[TABLE]
where is the maximum time step allowed by CFL condition (9) for the scheme with implicit (or zero) absorption term.
This theorem is proved in the following sections: section 3.1 contains compact notations and useful lemma, and section 3.2 contains the derivation of our energy estimate.
3.1 Notations and useful lemma
We give some useful notations for norms and inner products that are used in our analysis. For every grid function we define:
[TABLE]
For every velocity dependent grid function , we define:
[TABLE]
If and are two velocity dependent grid functions, we define their inner product:
[TABLE]
Now we give some notations for the finite difference operators that are used in scheme (6). For every grid function , we define the following one-sided operators:
[TABLE]
We also define the following centered operators:
[TABLE]
Finally, for every grid function , we define the following centered operator:
[TABLE]
Lemma 3.1** (Centered form of the upwind operator).**
For every grid function , we have:
[TABLE]
Proof.
This result is easily obtained by using the relations and the identity . ∎
Lemma 3.2**.**
For every grid function , we have:
[TABLE]
Proof.
Expand the left-hand side, use the inequality , and then use the change of index . ∎
Lemma 3.3** (Estimate for the adjoint upwind operator).**
For every positive real number and for every velocity dependent grid functions and , we have:
[TABLE]
Proof.
From Young’s inequality, we obtain for any positive real number :
[TABLE]
Now, the second term of the right-hand side of this inequality can be written:
[TABLE]
Then, with a simple changing of index, can be replaced by in the first integral, which gives:
[TABLE]
Finally, using this inequality in (17) gives the result. ∎
Lemma 3.4** (Discrete integration by parts).**
For every grid functions , , and , we have:
[TABLE]
Proof.
These results are simply obtained by using obvious changing of indexes and the definitions of the finite difference operators given in (14–16). ∎
Lemma 3.5**.**
If then
[TABLE]
Proof.
We just note that
[TABLE]
∎
3.2 Energy estimates
Since the time discretization of absorption term is implicit, it plays no role in the energy estimate. Consequently, to simplify the proof, we consider the case where there is no absorption (see remark 3.3 at the end of this section). We proceed in five short steps.
Step 1.
Here we derive a first energy relation. With the finite difference operators defined in (14)–(16), the scheme can be written in the following compact form:
[TABLE]
We define the energy of system (5) as . It is clear that the scheme can be proved to be stable if the energy at time can be controlled by the energy at time . Consequently, we first multiply (18a) by , then we take the sum over , and finally, we use the standard equality to get:
[TABLE]
Now we use relation (7): since for every , a simple expansion of the inner product of the left-hand side of (19b) shows that it can be reduced to:
[TABLE]
Moreover, we can use relation (3) and the assumptions of the cross section and the kernel to estimate the inner product of the right-hand side of (19b) as follows:
[TABLE]
Consequently, we add up (19a) and times (19b), then we use (20), (21), and the discrete integration by parts of lemma 3.4 to get our preliminary energy estimate:
[TABLE]
Step 2.
In this step, we show how the term can be eliminated in (22). First, it is useful to write in the right-hand side of (22) as : indeed, the terms and in the left and right-hand sides cancel out and we obtain:
[TABLE]
Now, we use the following Young inequality:
[TABLE]
Then the terms cancel out in (23) if and we get
[TABLE]
Step 3.
Here, we work on the inner product of (25) to show that the terms can also be eliminated. First, we insert in this inner product to get:
[TABLE]
and we rewrite terms and as follows. For , we use the centered form of the upwind operator (lemma 3.1) and the discrete integration by parts of lemma 3.4 to get:
[TABLE]
For , we also use the discrete integration by parts of lemma 3.4 to get:
[TABLE]
Then we apply the inequality of lemma 3.3 to to get
[TABLE]
Therefore, using (25), (26), (27) and (29), we see that the terms cancel out in (25) if , and we get
[TABLE]
Step 4.
Now, we show how all the and the terms can be controlled by . First, note that the term of the left-hand side of (30) can be estimated as follows:
[TABLE]
since . Moreover, using lemma 3.5 and a change of indices shows that the last term of the right-hand side of (30) satisfies
[TABLE]
Finally, we use these two estimates in (30) to obtain:
[TABLE]
Now, taking the positive part of the factor of the right-hand side of (33), we have the estimate
[TABLE]
where we have used and the estimate of lemma 3.2.
Step 5.
Finally, estimates (33) and (34) show that
[TABLE]
This means that we have the final energy estimate
[TABLE]
if is such that
[TABLE]
Since , an equivalent condition is , which gives the sufficient condition
[TABLE]
which proves the theorem.
Remark 3.3*.*
As explained at the beginning of this section, when the absorption term is non zero and is discretized implicitly, its contribution to the energy estimate is non-positive and plays no role in the previous analysis. However, if we use instead an explicit discretization, then our analysis has to be modified. The difference now is that there is the additional term in the right-hand side of (22). The idea of step 2 can be applied to this term (replace by and use a Young inequality) so that the terms cancel out, but now with . The other steps are the same, except that some coefficients are different. In order to shorten the paper, these details are left to the reader.
4 Error estimates
In this section, we simplify the presentation by taking constant total cross section and kernel , no absorption (), and no source term (). These assumptions are not restrictive at all, and our analysis could be directly applied in the general case.
Let be some finite time. For this study, we assume that the exact solution of (5) has the following regularity:
[TABLE]
Note that this assumption implies that is uniformly bounded with respect to , which is quite strong. In particular, this excludes the case of initial or transition layers. Indeed, if, for instance, is not isotropic at , then , and hence cannot be uniformly bounded with respect to .
With this assumption, we can obtain the following result.
Theorem 4.1**.**
If satisfies the following condition
[TABLE]
then for every time , there exists a constant independent of , , and , such that the numerical solution obtained by scheme (6) satisfies the following error estimate
[TABLE]
This theorem is proved in the following sections: in section 4.1, we first derive the truncation error of the scheme, then in section 4.2, we apply the same analysis as for the stability result to prove the theorem.
4.1 Truncation error
Let and be the truncation errors of scheme (6), that is to say the reminders obtained by inserting the exact solution of (5) in relations (6):
[TABLE]
We can prove the following estimate of these truncation errors:
Lemma 4.1**.**
There exists a constant independent of , and , such that
[TABLE]
for every
This lemma is proved by using standard simple techniques (Taylor-Lagrange formula of different orders). But to simplify the paper, the proof—which is a bit long—is given in appendix A.
Now, let and be the convergence errors, that is to say the sequences defined by
[TABLE]
Then these sequences satisfy the ”perturbed” scheme, written in the following compact form:
[TABLE]
with the homogeneous initial data and for every .
4.2 Analysis of the convergence error
In this section, we apply the same analysis as for the stability result to prove that and can be controlled by the truncation errors.
Step 1.
We multiply (38a) by and take the sum over to get
[TABLE]
Finally, we add up (39a) and times (39b), we use (20) and lemma 3.4 to get
[TABLE]
Step 2.
Here, we can copy the steps 2 to 4 of the stability analysis (see section 3) for relation (40). Therefore, skipping the details, we just give the resulting energy estimate:
[TABLE]
Step 3.
We estimate the scalar products of the right-hand side of (41) by using two different Young inequalities:
[TABLE]
Moreover, by taking the positive part of the factor