Processing math: 100%

Feb 7, 2021

What is an Asymptotic Preserving (AP) scheme? A conceptual journey!

The term of Asymptotic Preserving has been coined by Shi Jin, a well-known Chinese mathematician. However, it has been rooted in USSR (as lots of other things in mathematics). In this post, I am going to review AP schemes, in a simplified language..

Let's right start with an example: Assume that you want to solve this simplified advection-diffusion equation: νu+u=0 over [0,1]such that u(0)=0,u(1)=1, with two Dirichlet (fixed values) boundary conditions. One can simply confirm (believe me, it's really simple!) that the function u(x)=1ex/ν1e1/ν satisfies this equation. If we plot this exact solution with different diffusivity constant ν, we will get this:
As one can see, the solution develops a so-called "boundary layer" near the left boundary, which gets sharper and sharer as ν0. So far so good, hein? But what happens if you want to obtain this solution numerically? This is what Il'in tried to do in 1969, in a paper titled "Differencing scheme for a differential equation with a small parameter affecting the highest derivative", and he found out that the answer is not that easy!
First, he tried a very simple finite difference discretization of the second and first-order terms, and he got the numerical solution as uhh=1(2νh2ν+h)k1(2νh2ν+h)N which gives the following plot with h0.01:
The solution does not make any sense when νh. It is not crystal clear to me the method he used here (old Soviet style paper-writing!) but one may guess that a second-order central difference for the advection term would produce a similar effect, which you can confirm in my jupyter notebook.

Investigating this issue, he then succeeded to find another discretization (probably upwind method) which provided a reasonable solution uhk=1(νν+h)k1(νν+h)N:
In summary: Depending on the discretization one uses for the each term, the numerical solution may get inaccurate (or even unstable) if ν gets much smaller than your grid size! In other words, the solution may look good for ν=1 but it is not uniformly accurate when ν0.

This paper, as well as a couple of others published in USSR, founded the methods that are known today as AP or Asymptotic Preserving methods. As the name implies, AP methods are defined to "preserve the asymptotic". To understand it better, consider the famous AP diagram:
Mε is the ε-dependent equation we want to solve, like the advection-diffusion example. We know that as ε0 (or ν in our example) this equation will converge to its asymptotic limit M0. Now, consider Δ as the discretization parameter (like grid size h in our example). Then, the numerical deiscrete model MεΔ:
  • Converges to the continuous equation Mε, for a fixed ε when the grid gets refined Δ0
  • Converges to the numerical asymptotic solution M0Δ, for a fixed discretization when the parameter vanishes ε0
As we observed in the advection-diffusion example, the MεΔM0Δ convergence did not hold unless the grid get refined as ε0. This poses a big issue in practice, as refining the grid increases the computational cost of the method. Sometimes, this convergence holds, but M0Δ is not consistent with the continous asymptotic limit M0 perhaps because of an artificial O(1/ε) diffusion term which does not make the asymptotic method unstable but incosistent with the real model. One can still find lots of other interesting examples to explain AP schemes. I did a brief introduction here with another example of van der Pol system in my SlideShare:

No comments:

Post a Comment