Sharp Decay Estimates in Local Sensitivity Analysis for Evolution Equations with Uncertainties: from ODEs to Linear Kinetic Equations
Anton Arnold, Shi Jin, Tobias W\"ohrer

TL;DR
This paper develops sharp decay estimates for evolution equations with uncertainties by extending Lyapunov functional methods, providing uniform long-term behavior analysis for systems including ODEs, convection-diffusion, BGK, and Fokker-Planck equations.
Contribution
It introduces explicit Lyapunov functionals for defective systems and applies them to derive uniform decay estimates in uncertain evolution equations.
Findings
Derived sharp decay estimates of order (1+t^M)e^{-or systems with uncertainties.
Extended Lyapunov functional method to defective ODE systems.
Proved uniform decay behavior in the non-defective limit.
Abstract
We review the Lyapunov functional method for linear ODEs and give an explicit construction of such functionals that yields sharp decay estimates, including an extension to defective ODE systems. As an application, we consider three evolution equations, namely the linear convection-diffusion equation, the two velocity BGK model and the Fokker-Planck equation. Adding an uncertainty parameter to the equations and analyzing its linear sensitivity leads to defective ODE systems. By applying the Lyapunov functional construction, we prove sharp long time behavior of order , where is the defect and is the spectral gap of the system. The appearance of the uncertainty parameter in the three applications makes it important to have decay estimates that are uniform in the non-defective limit.
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.
11institutetext: Institute for Analysis and Scientific Computing, TU Vienna,
Wiedner Hauptstraße 8–10, 1040 Vienna, Austria,
11email: [email protected],
website: https://www.asc.tuwien.ac.at/~arnold/ 22institutetext: School of Mathematical Sciences, Institute of Natural Sciences, MOE-LSC, Shanghai Jiao Tong University,
Shanghai 200240, China,
22email: [email protected]
33institutetext: Institute for Analysis and Scientific Computing, TU Vienna,
Wiedner Hauptstraße 8–10, 1040 Vienna, Austria,
33email: [email protected]
Sharp Decay Estimates in Local Sensitivity Analysis for Evolution Equations with Uncertainties: from ODEs to Linear Kinetic Equations
Anton Arnold 11
Shi Jin 22
Tobias Wöhrer 33
Abstract
We review the Lyapunov functional method for linear ODEs and give an explicit construction of such functionals that yields sharp decay estimates, including an extension to defective ODE systems. As an application, we consider three evolution equations, namely the linear convection-diffusion equation, the two velocity BGK model and the Fokker–Planck equation.
Adding an uncertainty parameter to the equations and analyzing its linear sensitivity leads to defective ODE systems. By applying the Lyapunov functional construction, we prove sharp long time behavior of order , where is the defect and is the spectral gap of the system. The appearance of the uncertainty parameter in the three applications makes it important to have decay estimates that are uniform in the non-defective limit.
00footnotetext: The first author was partially supported by the FWF (Austrian Science Fund) funded SFB #F65. The first and the third authors were partially supported by the FWF-doctoral school W 1245 as well as the University of Madison-Wisconsin, where part of this work was carried out. The second author was partially supported by NSFC grants Nos. 31571071 and 11871297.
keywords:
long time behavior, defective ODEs, kinetic equations, BGK models, Lyapunov functionals, uncertainty quantification, sensitivity analysis, non-defective limit, Fokker–Planck equations
Contents
-
3 Linear convection-diffusion equations with uncertain coefficients
-
4.2 Sharp decay estimates for the parameter sensitivity equations
-
5.2 Sharp decay estimate for the parameter sensitivity equations
1 Introduction
Kinetic models arise from mesoscopic approximations of particle systems, as such, they are not first principle equations, thus contain empirical coefficients such as collision kernels in the Boltzmann equation, scattering coefficients in transport equations, forcing or source terms, and measurement errors in initial and boundary data, etc. Such errors can be modeled by uncertainties, or random inputs. Quantifying these uncertainties have important industrial and practical applications, in order to identify the sensitivities of input parameters, validate the models, conduct risk management, and ultimately improve these models.
In recent years one has seen activities in conducting uncertainty quantifications (UQ) for kinetic equations, see [15] for a recent review. One of the important analysis in UQ is the so-called local sensitivity analysis, in which one aims to understand how sensitive the solution depends on the input parameters [27]. For kinetic equations, a major tool to conduct sensitivity analysis for random kinetic equations has been the coercivity, or more generally, hypocoercivity, which originated in the study of long-time behavior of kinetic equations (see [29, 12, 10, 24]). In such analysis, by using the hypocoercivity of the kinetic operator, in a perturbative setting, namely, considering solutions near the global equilibrium (see [14]), one can establish the long time convergence toward the local equilibrium with an exponential time decay rate. Such analysis has been extended to kinetic equations with random inputs, in both linear (see [16, 21]) and nonlinear (see [18, 22, 26]) settings. For stochastic Galerkin methods, hypocoercivity analysis even leads to exponential decay of numerical errors [22, 26], while in classical numerical analysis one often obtains errors that grow exponentially in time. In these works, however, the decay rates were not sharp.
Over the last two decades, entropy methods have become an important and robust tool to prove exponential convergence to equilibrium in kinetic and parabolic equations (see [28, 7, 11, 20, 12]). But sharpness of the decay rate is only known in few cases (see [7] for the situation in Fokker–Planck equations). For linear finite dimensional ODEs, however, a method of constructing Lyapunov functionals to reveal optimal decay rates has been known for a long time, see [8], §22.4.
More recently in [6], such strategies were transferred to Fokker-Planck (FP) equations on and used to estimate the decay behavior of their solutions. For both, the ODE and the FP setting, one obtains the sharp exponential decay rate, as long as none of the eigenvalues determining the spectral gap of the generator is defective111An eigenvalue is defective, if its algebraic multiplicity is strictly greater than its geometric multiplicity.. Recently this method was applied to PDEs that allow for a modal decomposition, like kinetic BGK models on the torus (see [2, 3]). They are relaxation-type models for collisional gases, introduced by the physicists Bhatnagar, Gross and Krook in [9].
In the defective case, however, the sharp decay behavior is of the form of a polynomial times an exponential, and different strategies have to be applied.
In order to catch the sharp decay behavior in the case of a defective FP equation, one can use the spectral properties of the FP operator to split the solution into two subspace-invariant parts: The first one corresponds to the spectral gap and is finite dimensional; there the sharp (defective) decay behavior can be computed explicitly. The second part of the solutions corresponds to a subspace “away” from the spectral gap, and it has a faster exponential decay. This approach gives sharp decay functions for defective FP equations for various entropies as shown in [5].
Alternatively, one can extend the Lyapunov functional by allowing it to be time dependent, see [23]. In §2 of this paper we will translate that strategy from linear Fokker–Planck equations in (as in Corollary 12 of [23]) to the ODE setting. We shall also refine the method such that it can yield uniform decay bounds in the non-defective limit. This extension will be crucial for our PDE-applications presented in §3–§5: a convection-diffusion equation, a BGK model and a linear Fokker–Planck equation on respectively. There we shall allow for uncertainty in the model coefficients and carry out a first (and for the convection-diffusion equations also second) order sensitivity analysis. In a local sensitivity analysis one tries to estimate the behavior of the (higher order) derivatives of the solution with respect to the input variables [27]. Estimates of such derivatives are not only important to assess the sensitivity of the solution on the input parameters, they also provide regularity of the solution in the parameter space which is important to determine the convergence order of numerical approximations in the random space [13, 16, 17]. In the Fourier space, the resulting evolution equations for the parametric derivatives are mostly defective systems for which the sharp decay estimates can be obtained by using the Lyapunov functional approaches for defective deterministic systems. We would also like to point out that for the case of linear Fokker-Planck equation with a random drift, studied in §5, the global equilibrium is also random, while in previous sensitivity analysis for uncertain kinetic equations the global equilibria were all deterministic [18, 22].
2 Lyapunov functionals for defective ODEs
In this section we first review (from [2]) the Lyapunov functional method for non-defective ODEs and then extend it to the defective case. This is based on constructing a norm adapted to the problem that allows to recover the sharp decay behavior.
2.1 Construction of Lyapunov fuctionals
Let the matrix be positive stable, i.e. its eigenvalues satisfy for , and let . We want to find a Lyapunov functional for the equation
[TABLE]
that allows to deduce the sharp decay rate of solutions with energy-type estimates. For the construction of this functionals we consider the Jordan transformation of the matrix , denoting the Hermitian transpose of the matrix (with eigenvalues ). We shall distinguish different cases of eigenvalue defectiveness:
[TABLE]
where for are the Jordan blocks of with length . A Jordan block of length one is an eigenvalue as a diagonal element, and a Jordan block of length corresponds to a chain of generalized eigenvectors of of order satisfying
[TABLE]
where is an eigenvector of , corresponding to . We denote the (semi-)
norm
[TABLE]
for a Hermitian positive (semi-)definite matrix to be defined.
Case 1: is a Jordan block of length with .
We define the rank 1 matrix222For we denote where is the matrix-matrix multiplication. and get (cf. (2.51) in [6])
[TABLE]
Case 2: is a Jordan block of length with .
As in the proof of Lemma 4.3 in [6], we choose the coefficients as
[TABLE]
where , for and . Then the matrix
[TABLE]
satisfies
[TABLE]
and, as in (2.4), one gets
[TABLE]
Case 3: is a Jordan block of length with .
A translation of the strategy of Corollary 12 in [23] to the ODE setting leads to the following construction. For each , define the vector function
[TABLE]
For we have
[TABLE]
from which it follows (using (2.3)) that
[TABLE]
Next we define the time dependent Hermitian positive semi-definite matrix
[TABLE]
Notice that . So for the computation for the estimate of is the same as in (2.4) (with equality since ). For we use the identity (2.8), and compute
[TABLE]
and directly obtain
[TABLE]
For arbitrary , define
[TABLE]
We have for all , since the transformation matrix between these two sets is given by . Hence, the matrix is positive definite on the subspace . In the corresponding semi-norm the solution satisfies
[TABLE]
For later convenience, we denote
[TABLE]
to collect all indices with non-trivial Jordan blocks corresponding to , i.e. corresponding to the above Case 3.
Combining the three cases:
Now let us define
[TABLE]
where and are chosen, depending on the above Cases 1–3 of the corresponding Jordan block . The weights are arbitrary in Cases 1–2, and the (arbitrary) pertain to Case 3. The matrix is positive definite for every , since it has full rank by construction and it is the sum of positive semi-definite matrices. It satisfies
[TABLE]
and by applying Gronwall’s lemma, we conclude:
Lemma 2.1**.**
Let be positive stable and let be the smallest real part of all eigenvalues. Let be the Jordan normal form of , where for is a Jordan block of length with eigenvalue .
If all eigenvalues with real part equal to are non-defective, i.e. , then there exists a time-independent Hermitian positive definite matrix , such that the solutions to (2.1) satisfy
[TABLE] 2. 2.
If at least one eigenvalue with real part equal to is defective, i.e. , then there exists a time-dependent matrix , which is Hermitian positive definite for all such that the solutions to (2.1) satisfy
[TABLE]
For further details on the algebraic interpretation of the time-independent matrix , we refer to the remarks following Lemma 4.3 in [6]. See Example 2.2 in [4] (with ) for an ODE example and the relevance of the modified (time-independent) -norm for the trajectories of the ODE.
Remark 2.2**.**
The matrix is — with the construction described above — not unique. For one, arbitrary coefficients in the definition of in (2.13) are admissible. Secondly, the construction depends on the specific choice of (generalized) eigenvectors fixed in (2.3).
Remark 2.3**.**
The matrix can also be written as a matrix product:
[TABLE]
with and from (2.2),
[TABLE]
with notation for each and corresponding and
[TABLE]
This representation of directly implies that (cf. Fig. 3).
In the following remark and in Example 2.5, we investigate the geometry of the modified norms of Lemma 2.1.
Remark 2.4**.**
For an ODE (2.1), we distinguish different eigenvalue settings of the matrix , in order to isolate the interesting phenomena.
- •
Case 1: is in Case 1 of Lemma 2.1:* Due to Lemma 2.1, there exists a time-independent -norm such that solutions decay as (2.15). The geometric reason for the strict decay is the following: This specific norm is modified such that the trajectories of solutions to the ODE are never tangential to the -norm level curves (cf. Fig. 2).*
To prove this, denote . Then, the normal vector of the -norm level curve at point is given as the -norm gradient of , i.e. (see, e.g. (2.1.13) in **[19]** for gradients of Riemannian manifolds). The (backwards-in-time facing) solution tangent vector at point is given as . Due to the matrix inequality (2.5), and are never perpendicular, i.e. the -norm angle between them is bounded from below:
[TABLE]
where denotes the matrix norm induced by the vector norm .
- •
Case 2: is in Case 2 of Lemma 2.1**: First, for the time-independent matrix , as defined in **[6*]**, Lemma 4.3, the analogous result as for the above case is true. The calculation is identical, up to replacing by (cf. Example 2.5). Thus, also in the defective case, the **solutions are never tangential to the level curves of the -norm. ***
The -norm of Case 2 in Lemma 2.1 has a different geometric effect on solutions due to its time-dependency. In fact, a solution can even be tangential to the -norm level curves for all times, while still maintaining sharp exponential decay, as Example 2.5 below shows.
- •
Case 3: All eigenvalues of have real part (defective or non-defective)**: For , the -angle between and stays constant, i.e.
[TABLE]
Indeed, in this case, (2.14) becomes an equality (with , if all eigenvalues are non-defective), and hence for all . In the following computation we use the polarization identity in the first and last step. The second identity follows from the fact that, if is a solution to (2.1), so is and (with initial conditions and , respectively):
[TABLE]
for all .
Example 2.5**.**
Consider the IVP , , with matrix
[TABLE]
which has the defective eigenvalue and spectral gap and the (generalized) eigenvectors
[TABLE]
Our goal is to obtain a better geometric understanding of the necessity of a time-dependent norm for sharp decay estimates of solutions. To this end, we compare the here presented Lyapunov functional constructions with functionals considered in [6].
The naive approach of using the Euclidean norm of the solution exhibits non strict decay (the dashed curve in Fig. 1 has a horizontal tangent at ). The time-independent norm , as defined in [6], Lemma 4.3, with the matrix
[TABLE]
yields uniform exponential decay, but the rate is not sharp. See Fig. 1 for the decay plot and Fig. 2 for a geometric reasoning why a modified norm can yield exponential decay.
The -norm, with matrix
[TABLE]
as defined in (2.13) (with weights ), provides the sharp exponential decay
[TABLE]
See Figures 3–4 for the geometric evolution of the -norm.
Choosing the initial condition , yields the solution that is tangential to the -norm level curve for each , while the exponential decay of the solution in -norm is still sharp, see Figure 5.
**
Lemma 2.1 shows that the -norm of any solution to (2.1) decays exponentially. But due to the time dependence of the norm itself, it is not evident that this is an appropriate functional to capture the sharp decay rate of solutions. Hence, we shall next compare the -norm to the Euclidean norm.
An arbitrary Hermitian positive definite matrix satisfies
[TABLE]
where is the smallest and is the largest eigenvalue of . Using this inequality for , and the decay estimate (2.16), leads to the Euclidean decay estimate
[TABLE]
But here the decay behavior is “hidden” in the smallest eigenvalue of . The true qualitative behavior of will be derived next.
The following technical Lemma 2.6 allows us, in the subsequent step, to estimate the time-dependency of the -semi-norm. The strategy of the proof has already been used for Corollary 12 of [23] in the setting of Fokker–Planck equations on . However, our refined estimate here, for one, provides an upper bound for the time-dependence of a more general class of modified norms. And additionally, the constants appearing in the estimate are explicit, depending on and a parameter which, later on, allows to optimize the constants in the decay estimate of solutions to the ODE (2.1).
Lemma 2.6**.**
For linearly independent vectors define
[TABLE]
where for are (arbitrary) real-valued polynomials in , and . Furthermore let
[TABLE]
Then, the following inequality holds for every , and
[TABLE]
Notice that the second (-dependent) term of the r.h.s. involves only the semi-norms .
The technical proof is deferred to Appendix A.1.
Remark 2.7**.**
Lemma 2.6 is formulated in a general form, to be applicable also to §4 below. Here, we use it to estimate the time-dependency of the -semi-norms (as defined in (2.9)) for arbitrary and corresponding . In notation of Lemma 2.6, choose and for , which leads to . Then, Lemma 2.6 yields
[TABLE]
for every , all corresponding , , and .
In the next step, we combine the exponential decay in -norm of solutions, (2.16) with the lower bound (2.20). This allows to estimate the -norm decay of solutions and, consequently, the decay behavior in the Euclidean norm. In contrast to the result stated in [23] for the FP setting, we obtain an multiplicative constant in the estimate depending explicitly on the maximal defect associated to and the choice of the weights of .
The freedom of choice in the weights and their influence on the constant is of great importance in §3–§5, as will need to stay bounded in the non-defective limit (see Example 2.11 below).
Theorem 2.8**.**
Let be positive stable and let be the smallest real part of all eigenvalues. Let be the maximal size of a Jordan block associated to (i.e. the maximal defect associated to is ). Then there exists a constant , such that the solutions to (2.1) satisfy
[TABLE]
The constant can be chosen as
[TABLE]
where is the smallest and is the largest eigenvalue of the matrix (with for ), which is defined in (2.13). The constants for are given as:
[TABLE]
The technical proof of this result is deferred to Appendix A.2.
Remark 2.9**.**
If, for all , the weights of the matrix are monotonically decreasing in , i.e. for , then
[TABLE]
Remark 2.10**.**
Note that we could calculate the solution to the ODE system (2.1) directly, by means of its Jordan transformation, and get qualitatively the same decay behavior as in (2.21), but possibly with a different multiplicative constant: Using , , we obtain
[TABLE]
where denotes the matrix norm induced by the vector norm , is the transformation matrix from (2.2), the corresponding Jordan matrix, and depends only on the largest Jordan block. So what is the gain of the result in Theorem 2.8?
Firstly, the construction of the matrix and the method of estimating the -norm decay of the solution can be translated almost directly to the infinite dimensional setting of the Fokker–Planck equation with linear drift, where a direct way of calculating the decay (as in the finite dimensional ODE case) is not possible (see [6] for the exponential decay in the non-defective case and [23] for an improved decay in the defective case). In the Fokker–Planck setting on , the place of the -norm is taken by the modified Fisher information involving .
Secondly, the result also makes it possible to systematically calculate the multiplicative constant from (2.21), which we will use in §3–§5, and which can be further exploited to get decay results for infinite dimensional ODE systems (see [2], §4.3).
2.2 Uniform decay estimates in non-defective limits
The advantage of the -norm estimation compared to (2.23) can be seen in the following example.
Example 2.11**.**
Consider the matrix
[TABLE]
with arbitrary . Its corresponding Jordan transformation matrix reads
[TABLE]
and . For the factor in (2.23) becomes unbounded of order (even though the true decay of the solution improves to in the limit). This is due to the discontinuity of the Jordan transformation at the transition from defectiveness to non-defectiveness. We apply Theorem 2.8 to the ODE system , with the following eigenvectors of :
[TABLE]
When using and in (2.13), we get , and hence the constant
[TABLE]
stays bounded in the non-defective limit .
This example shows that, while the method presented here is still relying on the Jordan transformation (as is constructed with generalized eigenvectors), the additional weights in the matrix allow for estimates more closely related to the actual behavior of the solutions. As sketched in Example 2.11 this can allow for (but does not guarantee) an estimate that is uniform in the non-defective limit. In §3–§5 we will see further examples of specific choices of the weights that lead to uniform estimates in the non-defective limit.
Remark 2.12**.**
While the proof of Theorem 2.8 is formulated to work for arbitrarily large defects, more careful estimations can improve the decay estimate. We shall now show an improvement for defect one. For any the inequality (A.2) with and yields
[TABLE]
where we used (2.10) with .
For with the decay estimate for follows as
[TABLE]
We can use this estimate to get an improved upper bound for solutions from Example 2.11 in the Euclidean norm (compared to (2.21) with (2.24)): With the same matrix choice as in Example 2.11, it follows that solutions to satisfy
[TABLE]
This estimate not only yields a bounded multiplicative constant for , but also yields a sharp decay rate — namely purely exponential — for the non-defective limit case . In comparison, the solution propagator norm estimate for all is given as
[TABLE]
*This shows that (2.25) is rather accurate. *
Remark 2.13**.**
Consider an ODE (2.1) with matrix that has a Jordan block in Case 2 from §2.1, i.e. and . Then, the construction of Case 2 can be replaced with the one of Case 3. This means, exchanging the time-constant matrix , which has predetermined weights , by a time-dependent matrix , which allows for arbitrary weights . For simplicity let us assume . With the appropriate (straight forward) modifications of Lemma 2.1 and Theorem 2.8 (treating as Case 3), this yields the decay estimate (2.21) with the modified constant
[TABLE]
where is the matrix defined by (2.13), but with instead of .
For ODE families and their non-defective limits , this modification can be beneficial: The additional weights of provide further possibilities to obtain a multiplicative constant that is bounded for . In §5.2 (Case ), we will see an example of an ODE family where Theorem 2.8 yields an unbounded constant (for all possible weights) but a bounded constant for (with the correct choice of weights).
2.3 Uniform decay for a family of ODEs
We shall consider now an extension of Example 2.11 which will be relevant for the PDEs discussed in §3–§5: We consider the matrix family with parameter
[TABLE]
with a given function and . For simplicity let be the unique global point of minimum (infimum if ) of .
We are now interested in a uniform-in- estimate on the matrix propagator with , based on the estimate (2.25). To this end we have to consider the interplay of two effects: On the one hand the parameter value yields the smallest exponential decay rate but it is without defect, since makes a diagonal matrix. On the other hand the parameters yield a larger decay, but with a defect (as long as ). Hence we shall be interested in the question, whether or not the typical defective decay of the form persists for the uniform estimate of for . In the subsequent examples we shall illustrate that both scenarios are in fact possible.
Example 2.14**.**
Let with some , and hence . From Example 2.11 with (2.25) (using , ) we obtain the uniform decay estimate
[TABLE]
with
[TABLE]
An elementary computation yields
[TABLE]
with the asymptotic behavior as . Hence, estimate (2.29) exhibits the typical defective decay behavior, and the term cannot be dropped in the estimate.
Example 2.15**.**
Let with some and with . Here, . Then (2.25) yields the uniform decay estimate
[TABLE]
with
[TABLE]
Since and for every , , we conclude
[TABLE]
Hence, this example shows a purely exponential decay behavior, which is rather typical for the non-defective case.
We remark that we could not find an example of a parameter function with a minimum at for which the algebraic factor vanishes in the uniform estimate.
In the following sections §3–§5 we investigate parabolic and kinetic evolution equations in which equation coefficients depend on an uncertainty variable . After a Fourier decomposition, the sensitivity analysis leads to families of defective ODE systems of type similar to (2.28), for which we are interested in uniform-in- decay estimates of solutions with sharp rate. Sharpness is understood here in the sense that in the class of parameter functions satisfying , the decay estimate is of type for large , with minimal . As Example 2.14 illustrates, is necessary to cover arbitrary parameter functions.
With the three examples of §3–§5 we shall illustrate the various challenges of this procedure to obtain estimates: uniformity in the Fourier modes and in the non-defective limit(s).
3 Linear convection-diffusion equations with uncertain coefficients
First we consider the parabolic equation on the 1D torus
[TABLE]
for with the space variable , convection coefficient and diffusion coefficient satisfying . We are interested in the sensitivity of solutions with respect to the uncertainty parameter contained in the coefficients. We assume that the coefficients satisfy . For each , the equation is mass conserving (in time), i.e. , and the unique normalized steady state is given as . Correspondingly we shall also assume that the initial condition is normalized as for all .
A Fourier expansion of with respect to , allows to rewrite the PDE (for each fixed ) as a family of ODEs. With the notation , the equation for each Fourier mode , reads
[TABLE]
with the explicit solutions . Due to the above normalization we have for the mode: .
3.1 First order parameter sensitivity analysis
Now we analyze the (linear order) sensitivity of the equation with respect to the uncertainty in the coefficients and . Therefore we consider the evolution equation for , given as
[TABLE]
The Fourier modes for satisfy
[TABLE]
For the system of (3.3) and (3.5) reads
[TABLE]
Our goal is to obtain a decay estimate with sharp decay rate for solutions to (3.6), uniform in by applying Theorem 2.8.
Due to the normalization of the initial conditions , we have , and in particular for the initial condition . Hence, its steady state is ; the (expected) decay of all higher modes implies . With the notation , the unique (normalized) steady state of the system (3.1), (3.4) is .
For each Fourier mode , the double eigenvalue of the matrix is given as
[TABLE]
Hence, the matrix is positive stable and the steady state is given as . The spectral gap of the evolution operator in (3.6) is given by and the eigenvalue of is defective, if and only if .
If we consider all Fourier modes, the spectral gap for the whole sequence is given as
[TABLE]
and it is realized by the modes . The steady state is given by the sequence , with denoting the Kronecker delta.
In what follows, we investigate the decay rate of solutions to the system of equations (3.1) and (3.4) towards the steady state with a sharp rate, uniform in the uncertainty variable .
The solution vector is equivalent to by Parseval’s identity. As the ODE system for each Fourier mode can be defective for certain values in , we expect a uniform-in- decay rate that is not purely exponential. In fact, for non-constant and , defectiveness is the more typical behavior of the matrix .
For each fixed , we proceed with a case distinction between the defective and non-defective case.
3.1.1 Case 1; , such that :
The matrix is diagonal and the solutions are given as . Hence, for each and , the decay of solutions to (3.6) is given as
[TABLE]
3.1.2 Case 2; , such that :
In this case the eigenvalue of is defective of order 1, i.e. , for . Hence we shall apply Theorem 2.8 to get a sharp decay estimate for solutions to (3.6).
To denote the dependence on the Fourier mode , we shall use the subscript , e.g., we use for the matrix , defined in (2.13), that corresponds to . Similarly, we denote ’s weights in (2.13) by .
For , the matrix is positive stable and the eigenvector and generalized eigenvector of , corresponding to , are given as
[TABLE]
In analogy to Example 2.11 we choose and , leading to
[TABLE]
An appropriate choice of is essential here, in order to make the matrix (and hence the constant below) uniformly bounded for , i.e. for the non-defective limit.
Now we can apply Theorem 2.8 (for the rescaled time ) to get the following decay estimate for solutions to the system (3.6) for each and :
[TABLE]
with the constant defined in (2.22), given as
[TABLE]
Combining Case 1 and Case 2, we infer a decay estimate for the first order parameter sensitivity equations by applying Parseval’s identity:
Theorem 3.1**.**
Let where and . Then, there exists a constant , such that normalized solutions of the system (3.1), (3.4) with steady state satisfy
[TABLE]
for .
Proof 3.2**.**
Combining both estimates (3.7) and (3.8) leads to
[TABLE]
with the constant
[TABLE]
independent of and . With Parseval’s identity we obtain
[TABLE]
where we used the estimate
[TABLE]
with . Taking the supremum over completes the proof.∎
3.2 Second order parameter sensitivity analysis
Next we shall extend the above analysis to second order. This will also illustrate the challenges involved in obtaining uniform decay estimates in defective limits.
We assume and denote . By differentiation of (3.4) with respect to , the second order sensitivity equation is given as
[TABLE]
The system for the Fourier mode of , with , is given as
[TABLE]
As before, , and in particular for the initial condition . Hence the unique (normalized) steady state of the second order sensitivity system is .
The triple eigenvalue is , with and its defectiveness for depends on the values of and , i.e.
[TABLE]
As in the first order analysis, we need to discuss the decay behavior of these three cases separately:
Case 1; such that :
In this case, the eigenvalue is non-defective and the solutions are given as from which we obtain the decay
[TABLE]
Case 2; , such that and :
In this case the eigenvalue is defective of order one, i.e. . To obtain a sharp decay estimate of solutions, we construct according to (2.13): , , , and choosing , and . The (generalized) eigenvectors of are given as
[TABLE]
This leads to
[TABLE]
We can now apply Theorem 2.8 (for the rescaled time ) and get the decay estimate
[TABLE]
with the the constant , defined in (2.22), given as
[TABLE]
Note that this constant is uniformly bounded in the non-defective limit (from defect 1 to non-defective), but it does not reduce to (3.13), hence it is not uniformly sharp.
Case 3; , such that :
The eigenvalue is defective of order two with , and . The (generalized) eigenvectors of are given as
[TABLE]
For this case the previous strategy of finding weights for (as defined in (2.13)) that give a uniform in decay estimate for solutions via Theorem 2.8 does not work directly. All choices of weights for lead to constants (defined in (2.22)) that are not bounded uniformly in . The problem arises for the defective limit from defect 2 to defect 1, more precisely, for sequences such that in combination with as . All weight choices of lead to due to the three different powers of that appear in the (generalized) eigenvectors of .
However, this problem can be fixed with small adjustments to the proof of Theorem 2.8, which yield a uniform in decay estimate.
Define
[TABLE]
which is our replacement for , with for from (2.7). It satisfies
[TABLE]
which eliminates the problematic factor present in . The corresponding semi-norm matrix is
[TABLE]
Similar to definition (2.13), let
[TABLE]
which is positive definite for all , , and satisfies .
As definition (2.13) is modified, we cannot directly use Theorem 2.8 to get a decay estimate in the Euclidean norm. The idea of the proof of Theorem 2.8 is to estimate each -semi-norm decay separately, see (A.3). Combining them yields a decay estimate in the -norm. We will now follow the idea of the proof of Theorem 2.8 but have to carefully modify each step to work for .
First, one can easily verify that for the estimate (A.3) remains true, if we replace by :
[TABLE]
and (using )
[TABLE]
for , .
Next we shall derive a similar estimate for the semi-norm .
Lemma 3.3**.**
Let be a solution of the ODE (3.12) and , such that . Then,
[TABLE]
for , .
The technical proof is deferred to Appendix A.3.
Finally, we can estimate solutions to (3.12) in Euclidean norm with the help of (3.15):
[TABLE]
Using (3.16) for and (3.17) for allows to estimate the first two terms. For the third term including , we use (3.18) to get
[TABLE]
for , . Most notably, as , the multiplicative constant
[TABLE]
is uniformly bounded in . This includes the problematic limit in combination with (defect 2 to defect 1), which is our desired result for Case 3.
Combining Cases 1–3 for leads to:
Theorem 3.4**.**
Let where and . Then, there exists a constant , such that normalized solutions to the system of equations (3.1), (3.4) and (3.11) with steady state satisfy
[TABLE]
for .
Proof 3.5**.**
Analogous to the first order sensitivity equations, combining the three above cases of defects of , leads to a decay estimate uniform in . Due to the estimates (3.13), (3.14) and (3.19), there exists an independent of and such that
[TABLE]
With Parseval’s identity (in analogy to the proof of Theorem 3.1) the desired result follows.∎
3.3 Decay estimates with Duhamel’s formula
Another method to get decay estimates with sharp rate for sensitivity equations is to use Duhamel’s formula instead of the above presented Lyapunov functional method.
In the case of the Fourier transformed linear heat-convection equation (3.3), the solution is given explicitly as . We can interpret the Fourier transformed first order sensitivity equation (3.5) as an inhomogeneous equation of form
[TABLE]
with . By Duhamel’s formula we get
[TABLE]
By using the solution propagator norm (2.26) with , this yields the decay estimate for each Fourier-mode , :
[TABLE]
By iteration, Duhamel’s formula gives a decay estimate for sensitivity equations of arbitrary order. A similar method of iteratively deducing decay estimates was used e.g. in [16] (see Theorems 4.1 and 4.2) and [22] (see Theorems 2.1 and 4.4).
4 Two velocity BGK model with uncertain coefficients
Our starting point is the linear one-dimensional BGK-model for the probability density . This kinetic equation reads
[TABLE]
for , velocities , and the Maxwell distribution , with given temperature . Exponential decay towards the equilibrium for this -continuous model was proved in §4.3 of [2]. We reduce the model drastically and allow only for two discrete velocities , denoting . This leads to the system of equations
[TABLE]
called Goldstein-Taylor model with the relaxation coefficient . These equations serve as a toy model that still exhibits many features of (4.1). For , an explicit exponential decay rate of the two velocity model by means of Lyapunov functionals was shown in §1.4 of [12]. The sharp decay estimate was found in [2], §4.1 with a refined functional. We are interested here in augmenting the large-time analysis with a sensitivity analysis.
4.1 First order parameter sensitivity analysis
Similarly to §3 we allow the relaxation coefficient to contain uncertainty and denote it by . Throughout §4, assume , , , and . This leads to the following equations for , the parameter and :
[TABLE]
with initial condition
[TABLE]
For each assume .
The model is conserving total mass (in time), i.e. for all . The unique normalized steady state for the system is given as . Correspondingly, we shall also assume that the initial total mass is normalized, as .
To analyze the (linear order) sensitivity of the equation with respect to the relaxation function , we investigate the corresponding family of sensitivity equations for . For each , they are given as
[TABLE]
For each , this system (4.3) is also conserving total mass (in time), i.e. Due to the normalization of , we have with the corresponding steady state given as .
To analyze the decay behavior of solutions of the above system (4.2)–(4.3), we consider the Fourier series . It is convenient to introduce the following linear combinations of the Fourier modes :
[TABLE]
For each they satisfy the decoupled ODE system
[TABLE]
For , the matrix has the eigenvalues
[TABLE]
Note that the discriminant is always positive for , due to our assumption .
The eigenvectors are given by
[TABLE]
Similarly to (4.4), the Fourier modes
[TABLE]
with , satisfy the ODE systems
[TABLE]
Combining the two ODE systems for and leads to the following -systems describing the first order sensitivity equations for the model (4.2) in Fourier space:
[TABLE]
Due to the block triangular form of the matrix , the eigenvalues of are not affected by :
[TABLE]
where both eigenvalues have algebraic multiplicity two.
For the matrix is defective, if and only if : For only the eigenvalue is defective of order one, and for both eigenvalues are defective of order one.
4.2 Sharp decay estimates for the parameter sensitivity equations
The reasons for the assumptions from §4.1 imposed on will become evident in the following analysis: The lower bound is needed in order to get a uniform in decay rate. The assumptions and are necessary for the multiplicative constant in the decay estimate (obtained by Theorem 2.8) to be bounded for all .
The decay rate of each mode is determined by the size of the spectral gap of , which we denote by , and its defectiveness. For the eigenvalues are and . Hence, the spectral gap for the zeroth mode is . The zeroth mode of the steady state in our transformed setting is given as . This implies that any solution to for , fulfills the decay estimate
[TABLE]
with the constant
[TABLE]
that can be computed in analogy to Case 2 in §3.1. Note that Theorem 2.8 can only be applied here to the two-dimensional subspace of that pertains to . In the orthogonal subspace corresponding to , we have , where ‘’ denotes the elements of .
For the modes the matrix is positive stable and the spectral gap is independent of (in contrast to the examples in §3 and §5):
[TABLE]
Moreover, the steady state is given as .
In the next step, we apply Theorem 2.8 to the system (4.9) to get a sharp decay estimate for each Fourier mode of type
[TABLE]
A summation over the estimates for all Fourier modes will allow us to apply Parseval’s identity on the left-hand side. In order to apply it also on the right-hand side one requires a uniform in and bound of the multiplicative decay constant . We shall derive this bound now.
For each , the matrix of Theorem 2.8 has to be chosen depending on the defectiveness of the matrix , which is determined by the value of .
Case 1; such that :
The matrix is non-defective, and we construct the matrix according to (2.13): , with for , , i.e. each is in Case 1 of §2. Choosing leads to
[TABLE]
and the eigenvectors of corresponding to (i.e. satisfying the equation for ) are given as
[TABLE]
For each fixed value , we have
[TABLE]
as well as
[TABLE]
where we used the notations for . Denoting , it follows that
[TABLE]
For each and , the four vectors and are linearly independent and hence, the matrix is positive definite. As all entries of are continuous in and the eigenvalues are continuous with respect to the matrix entries, we get
[TABLE]
Similarly, we get
[TABLE]
Because of (4.11) we have for , and therefore
[TABLE]
We summarize Case 1: For all such that is non-defective, Theorem 2.8 yields the decay estimate
[TABLE]
with a uniform bound for the constants (defined in (2.22)), i.e.
[TABLE]
for and .
Case 2; such that :
The two eigenvalues of are both defective. The eigenvectors and generalized eigenvectors of corresponding to (i.e. the generalized eigenvectors satisfy ) are given as
[TABLE]
Now we construct the matrix according to (2.13): , with , i.e. both are in Case 3 of §2. Choosing and , leads to
[TABLE]
As mentioned in §3 the specific choice of weights is crucial in order to get a uniformly bounded constant in the non-defective limit .
Abbreviating , for each value (with notation in analogy to Case 1), we have
[TABLE]
and
[TABLE]
It follows that
[TABLE]
For each , the four vectors and are linearly independent. This can be checked by considering the last two components of : They have the same form as the last two components of from Case 1 above, up to a multiplicative factor that is non-zero for all due to .
Hence, the matrix is positive definite on . Due to the specific choice of all entries of are continuous with respect to . With the same argument as in Case 1, we get
[TABLE]
and
[TABLE]
The limit (4.13) implies
[TABLE]
We summarize Case 2: For all such that is defective, Theorem 2.8 yields the decay estimate
[TABLE]
Here, the constants from (2.22), using , are uniformly bounded since :
[TABLE]
for all and .
Now, we have all the necessary ingredients to estimate the decay of solutions to the system (4.2)–(4.3). Denote
[TABLE]
Theorem 4.1**.**
Let where , and . Then, there exists a constant , such that normalized solutions of the system (4.2)–(4.3) satisfy
[TABLE]
for .
Proof 4.2**.**
Applying Parseval’s identity and the decay estimates (4.10), (4.12) and (4.14), where the constants are uniformly bounded in , , one obtains
[TABLE]
for all . ∎
5 Fokker–Planck equations with uncertain coefficients
In this section we consider the Fokker–Planck equation (FPE) with the spatial variable ,
[TABLE]
with initial condition
[TABLE]
The drift parameter depends only on the uncertainty parameter and we assume with . As in §3–§4, we want to analyze the sensitivity of the decay for solutions to the steady state w.r.t. . Contrary to the previous examples, the steady state here also depends on .
For each the unique normalized steady state of the equation, i.e. with , is given as
[TABLE]
Denoting , the first order linear sensitivity equation is given as
[TABLE]
for each fixed . The corresponding steady state is given as which satisfies .
A direct approach to estimate the decay of via Duhamel’s formula (cf. §3.3) is not (easily) feasible: While a decay estimates with sharp rate for is available, the decay behavior of the term is not immediate. In [18], the Duhamel approach was taken to obtain decay estimates for nonlinear Vlasov–Fokker–Planck equations, but those estimates were not sharp.
We choose to expand and into eigenfunctions of . This allows us to use a recursive relation of the eigenfunctions and for .
5.1 Eigenfunctions of the FP-operator
The normalized eigenfunctions of on the weighted space (with the inner product ) are rescaled Hermite functions. The probabilists’ Hermite polynomials are defined as
[TABLE]
and satisfy the recursion
[TABLE]
The Hermite functions are given as
[TABLE]
satisfying (due to (5.3)) . We further denote the Hermite functions rescaled by as
[TABLE]
This rescaling is chosen such that the Hermite functions are normalized in for all . Notice that and .
For later use we note that, due to (5.3), the rescaled Hermite functions satisfy
[TABLE]
for . Using (5.3) again, this implies
[TABLE]
for .
The spectrum of , with fixed, is given as
[TABLE]
An orthonormal basis of eigenfunctions for the FP-operator on is given by the rescaled Hermite functions defined in (5.5) (see e.g. [25], §5.5.1, §10.1.4), i.e. for fixed:
[TABLE]
5.2 Sharp decay estimate for the parameter sensitivity equations
Let us assume , where is a probability density, , and does not carry any mass, i.e. . The eigenfunction expansions for the corresponding solutions of (5.1) and of (5.2) are given as
[TABLE]
for and . Due to (5.1), each eigenmode evolves as
[TABLE]
and hence . Plugging the eigenfunction expansion for into (5.2) leads to
[TABLE]
Applying identity (5.7) gives
[TABLE]
Separating the eigenmodes then yields
[TABLE]
In contrast to , the th modes of do not decouple for . They are rather coupled as the pair , respectively the triples for . For the evolution equation for , can be written as the ODE system
[TABLE]
for , , with the notation
[TABLE]
For , equation (5.9) can be written as
[TABLE]
with , since . The corresponding system of equations is given as
[TABLE]
for , . Since the matrices are defective, if and only if , we shall now distinguish these cases.
Case and such that :
The matrices are diagonal and the solutions of the eigenmodes are given explicitly as
[TABLE]
The decay estimate
[TABLE]
follows.
Case and such that :
The matrices are defective of order 1 and we apply Theorem 2.8 to get a uniform-in- decay estimate. The construction of the matrices resembles Example 2.11 (with and rescaling ). It yields the decay estimate
[TABLE]
with the uniform in bounded constant (for )
[TABLE]
Notice that by definition of the decay implies . This concludes the analysis for the modes .
For our goal to get a decay estimate with sharp uniform-in- decay rate of the system (5.1)–(5.2) as formulated in Theorem 5.2 below, it is important to get a “precise” decay estimate for the modes . Only these two modes have the spectral gap of the system of equations (5.1)–(5.2). The other modes have larger spectral gaps and decay much faster. On the level of the modal equations for all we need are “sufficient” decay estimates, namely rates at least as good as the ones of the modes . This is in contrast to §4 where every Fourier mode has the spectral gap of the sensitivity equations and needs “precise” treatment.
For the modes , the equation for corresponds to
[TABLE]
for , , denoting
[TABLE]
For each , the eigenvalues of are and , where is defective of order 1, if and only if . The (non-defective) spectral gap of is given as
[TABLE]
5.2.1 Case and such that :
The matrix is diagonal and the solutions for the eigenmodes are given explicitly as
[TABLE]
The decay estimate
[TABLE]
follows.
5.2.2 Case and such that :
In this case the eigenvalue is defective, but this eigenvalue does not correspond to the spectral gap .
The matrix corresponds to two Jordan blocks. In notation from §2 this means: , , and . We use Theorem 2.8 with the modification of Remark 2.13 for . The (generalized) eigenvectors of are given as
[TABLE]
With the modifications described in Remark 2.13, the matrix is constructed with three arbitrary weights: We choose them as , and , which leads to
[TABLE]
Then, Remark 2.13 (with the rescaling ) leads to the decay estimate
[TABLE]
with the constant
[TABLE]
Denoting , the eigenvalues of are given as
[TABLE]
with and . Since
[TABLE]
the constant is uniformly bounded in by
[TABLE]
We arrive at
[TABLE]
for .
5.2.3 Case and :
In this case the equations for the th mode (5.15) does not correspond to the spectral gap of the system (5.1)–(5.2). In fact, the exponential decay rate of , is at least , which is double the rate of the slowest modes . Thus, there is more freedom of choice for the matrix for . This is important in order to get a uniform in and estimate for . The additional difficulty compared to is the uniform bound for . Indeed, even Remark 2.13 would not give a matrix with uniform condition number for fixed and , and therefore a decay estimate constant that is unbounded in .
The following lemma builds on the fact that the Euclidean norm, i.e. using , yields already a “sufficient” decay estimate as long as is small enough. An appropriate rescaling of the third coordinate via a modified norm does the trick for all .
Lemma 5.1**.**
For and solutions to (5.15) satisfy the decay estimate
[TABLE]
with the constant .
The elementary but technical proof is deferred to Appendix A.4.
Combining the above five cases for and leads to the desired uniform-in- decay estimate for arbitrary initial conditions on with sharp rate:
Theorem 5.2**.**
Let where and . Then, there exists a constant , such that normalized solutions of the system (5.1)–(5.2) with steady state satisfy
[TABLE]
for with an explicit constant only depending on and , as given in (5.20) below.
Proof 5.3**.**
With Parseval’s identity and the collected decay estimates (5.12), (5.13), (5.16), (5.18) and (5.19), we obtain
[TABLE]
Using the fact that for , leads to
[TABLE]
for each fixed , with the constant
[TABLE]
∎
Remark 5.4**.**
Similar to §3.3, Duhamel’s formula would also yield a decay estimate here. The eigenfunction modes of are given explicitly due to (5.8). This allows us to use Duhamel’s formula for the evolution equation (5.9), providing the eigenfunction modes of in explicit form.
5.3 Uncertain diffusion coefficient
As an alternative to (5.1) we consider now the following Fokker–Planck equation on with uncertainty in the diffusion term:
[TABLE]
for , and a diffusion coefficient satisfying . For the first order linear sensitivity equation is given as
[TABLE]
for . A strategy similar to the one used in §5.2 can also be applied here: The rescaled Hermite functions
[TABLE]
with defined in (5.4) are an orthonormal basis of of eigenfunctions of , i.e.
[TABLE]
which determines the whole (-independent) spectrum
[TABLE]
It follows that the unique normalized steady state of and the corresponding steady state for (5.22) are given as
[TABLE]
respectively. An eigenfunction expansion leads to the non-defective ODE systems for the eigenfunction modes :
[TABLE]
and , . The matrix , , has the eigenvalues and , and hence, is not defective. Contrary to the models previously investigated, the FPE with added uncertainty in the diffusion term does not result in the typical defective decay behavior for . The decay behavior of solutions of the system (5.21)–(5.22) can hence be estimated easily by
[TABLE]
with , a constant and .
To sum up, we observe that the FPE (5.1) with uncertainty in the drift term gives rise to a more complicated and interesting decay behavior.
6 Conclusion
In this paper we perform a sensitivity analysis for several linear PDEs with uncertainty by a Lyapunov functional method, obtaining sharp decay rates to the global equilibrium.
First, a systematic derivation of Lyapunov functionals – in the form of modified norms – for arbitrary linear ODE systems is given. The Lyapunov functional approach has a simple geometric interpretation: In the deformed metric, the angle between any trajectory and the level curves of the -norm is uniformly bounded away from zero (for constant in ). The novelty here is the inclusion of defective ODEs, which demand time-dependence in the norms in order to obtain sharp decay estimates of order . This approach is realized via a matrix , which is constructed from the explicit (generalized) eigenvectors of the system matrix accompanied by arbitrary weights. In the presence of an uncertainty parameter , we obtain decay estimates that are uniform in , which includes non-defective limits. In such cases, the matrix has to be constructed more carefully, taking advantage of the non-uniqueness of in the above method.
This method is applied to three PDEs, a convection-diffusion equation, a two-velocity BGK equation, and a Fokker-Planck equation, where each of these equations feature uncertainty in the equation parameters. A linear sensitivity analysis is performed, where for the convection-diffusion equation a second order sensitivity is also included. The analysis works well with PDEs that allow for a Fourier mode decomposition, since each mode evolves according to an ODE. Hence, the decay estimates have to be uniform in the eigenmodes . In the presented examples (with the exception of §5.3) defects appear in the resulting ODEs.
Sharp decay estimates which are uniform in the uncertainty parameter were obtained for these PDEs. The technical difficulty here is the possible appearance of non-defective limits due to the -dependence of the ODEs, when one considers derivatives of solutions with respect to . This problem is solved with a careful choice of the matrix , exploiting the fact that its construction (and in particular its weights) is not unique.
Let us point out an aspect of the sensitivity analysis of the Fokker–Planck equation in §5 distinct from the other investigated PDEs: The equilibrium that solutions converge to, depends itself on the uncertainty parameter.
The method could be helpful even for nonlinear PDEs with uncertainties. For those problems, usually perturbative solutions, namely solutions near global equilibria, are studied, in which the exponential decay due to the linear(-ized) hypocoercivity dominates the nonlinear growth. See e.g. [24, 29, 10, 14, 3, 2] for deterministic settings and [22, 18, 26] for inclusion of uncertainty quantification. One expects that our analysis can lead to sharper decay rates than previously used energy estimates in Sobolev spaces.
Appendix A Appendix
A.1 Proof of Lemma 2.6
Proof A.1**.**
For arbitrary and
[TABLE]
holds true, as can be directly validated in matrix representation.
We estimate from below by using inequality (A.1) for the double sum:
[TABLE]
We reorder the double sum and notice that each term depends on only one of the two indices:
[TABLE]
For the first coefficient to be positive, we need . Moreover one has and therefore
[TABLE]
which yields the desired result for .∎
A.2 Proof of Theorem 2.8
If there are no defective eigenvalues with real part . In this case, the result follows from (2.15) and the estimates (2.18) with the corresponding matrix .
For , we fix an arbitrary and first estimate the -semi-norm decay for the corresponding . To achieve this, we combine the decay estimate (2.10) and (2.20) that gives a lower bound on the -semi-norm with terms only depending on -semi-norms (). This yields
[TABLE]
Rearranging and dividing by leads to
[TABLE]
By induction we shall show that, for arbitrary but fixed and all corresponding , there exists a constant only depending on , such that
[TABLE]
where by definition (2.11).
For , the matrix is not time-dependent and (2.10) immediately yields (A.3) with .
For the inductive step, we assume the claim is true for all with some and constants monotonically increasing in and start from (A.2), written for :
[TABLE]
where (A.3) with was used in the second estimate.
In order to combine both of the terms in (A.4) into one summation, we compute . For , one has . For , the coefficient has its minimum at with value . As , one gets
In total
[TABLE]
Applying this estimate to (A.4) and, additionally, using the upper bound for all , one gets
[TABLE]
which concludes the induction and hence the proof of (A.3) for .
The constant for is given as
[TABLE]
By definition (2.13) the matrix is given as
[TABLE]
The first term, , covers the Cases 1–2. Applying Gronwall’s lemma directly to the inequalities (2.4) and (2.6) yields
[TABLE]
Now, we take a closer look at the decay behavior of solutions with respect to the -semi-norm that corresponds to Case 3.
[TABLE]
The first term includes only semi-norms that are time-independent, i.e. , and using (2.10) directly gives the decay behavior. For the second term in (A.6), we apply (A.3) and get
[TABLE]
Now, using (2.18) for , the decay behavior in the Euclidean norm follows as
[TABLE]
where the constant \mathscr{C}:=2(\lambda_{\min}^{P(0)})^{-1}\lambda_{\max}^{P(0)}c_{M}\displaystyle\max_{n\in I_{\mu}}\Big{[}\sum_{m=1}^{l_{n}}\frac{\beta_{n}^{m}}{\min_{k\in\{1,\ldots,m\}}\beta_{n}^{k}}\Big{]} depends only on the matrix .∎
A.3 Proof of Lemma 3.3
Proof A.2**.**
Since satisfy (2.8) with and , their linear combination satisfies
[TABLE]
The computation leading to (2.10) also applies here (with rescaled time ) and results in
[TABLE]
Now, our goal is an estimate in the -semi-norm with help of Lemma 2.6. By definition
[TABLE]
with the polynomials
[TABLE]
Lemma 2.6 yields
[TABLE]
for any (fixed) , , . Replace by a solution to (3.12) (rescaling to to account for the prefactor in the ODE). Then (in analogy to the estimate (A.2)), using (A.7) leads to
[TABLE]
with as in (A.2). Minimizing in with estimate (A.5) yields
[TABLE]
*Next we use the estimates (3.16), (3.17) and the fact that to proceed with (A.9): *
[TABLE]
∎
A.4 Proof of Lemma 5.1
Proof A.3**.**
To show that the matrix
[TABLE]
satisfies
[TABLE]
we show that
[TABLE]
is positive definite.
As , the first two leading minors are positive. The third minor is positive, if
[TABLE]
for all , . For all , we distinguish the following two cases:
For such that * the condition is equivalent to*
[TABLE]
The function , is monotonously increasing in and but monotonously decreasing in , hence
[TABLE]
For such that * the condition is equivalent to*
[TABLE]
The function is monotonously increasing in and monotonously decreasing in and , hence
[TABLE]
This proves the matrix inequality (A.11). With a similar calculation as (2.4) (and the rescaling ), this implies
[TABLE]
With , , we obtain
[TABLE]
from which the desired result follows.∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[2] Achleitner, F., Arnold, A. and Carlen, E.A.: On linear hypocoercive BGK models. In: From particle systems to partial differential equations. III, Springer Proc. Math. Stat., vol. 162, 1–37. Springer (2016).
- 3[3] Achleitner, F., Arnold, A. and Carlen, E.A.: On multi-dimensional hypocoercive BGK models. Kinetic & Related Models, vol. 11 (4) 953–1009 (2018).
- 4[4] Achleitner, F., Arnold, A. and Stürzer, D.: Large-Time Behavior in Non-Symmetric Fokker–Planck Equations. Rivista di Matematica della Università di Parma, vol. 6, 1–68, (2015).
- 5[5] Arnold, A., Einav, A. and Wöhrer, T.: On the rates of decay to equilibrium in degenerate and defective Fokker–Planck equations. J. Differential Equations, vol. 264 (11), 6843–6872, (2018).
- 6[6] Arnold, A. and Erb, J.: Sharp Entropy Decay for Hypocoercive and Non-Symmetric Fokker-Planck Equations With Linear Drift. Preprint, ar Xiv:1409.5425 (2014).
- 7[7] Arnold, A., Markowich, P., Toscani, G. and Unterreiter, A.: On convex Sobolev inequalities and the rate of convergence to equilibrium for Fokker–Planck type equations, Comm. Partial Differential Equations, vol. 26, 43–100, (2001).
- 8[8] Arnold, V.I.: Ordinary differential equations. MIT Press, Cambridge, Mass.-London, Translated from the Russian and edited by Richard A. Silverman, (1978).
