Stability of explicit Runge-Kutta methods for high order finite element approximation of linear parabolic equations
Weizhang Huang, Lennard Kamenski, Jens Lang

TL;DR
This paper analyzes the stability of explicit Runge-Kutta methods in high order finite element approximations of linear parabolic equations, providing bounds on the system matrix eigenvalues that influence time step size.
Contribution
It introduces new bounds on the eigenvalues of the system matrix, linking stability to mesh geometry, basis functions, and diffusion matrix properties.
Findings
Bounds on eigenvalues depend on matrix entry ratios and mesh geometry.
The tightness of bounds varies with problem parameters and mesh configuration.
Results offer insights into stability constraints for explicit schemes on nonuniform meshes.
Abstract
We study the stability of explicit Runge-Kutta methods for high order Lagrangian finite element approximation of linear parabolic equations and establish bounds on the largest eigenvalue of the system matrix which determines the largest permissible time step. A bound expressed in terms of the ratio of the diagonal entries of the stiffness and mass matrices is shown to be tight within a small factor which depends only on the dimension and the choice of the reference element and basis functions but is independent of the mesh or the coefficients of the initial-boundary value problem under consideration. Another bound, which is less tight and expressed in terms of mesh geometry, depends only on the number of mesh elements and the alignment of the mesh with the diffusion matrix. The results provide an insight into how the interplay between the mesh geometry and the diffusion matrix affects…
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.
Stability of explicit Runge-Kutta methods
for high order finite element approximation of linear parabolic equations111The work was supported in part by the NSF (U.S.A.) under Grant DMS-1115118, the Excellence Initiative of the German Federal and State Governments, and the Graduate School of Engineering at the Technische Universität Darmstadt.
Weizhang Huang
Lennard Kamenski
Jens Lang
Department of Mathematics, University of Kansas, Lawrence, KS 66045, USA
Weierstrass Institute for Applied Analysis and Stochastics, Berlin, Germany
Department of Mathematics, Graduate School of Computational Engineering, and Center of Smart Interfaces, TU Darmstadt, Germany
Abstract
We study the stability of explicit Runge-Kutta methods for high order Lagrangian finite element approximation of linear parabolic equations and establish bounds on the largest eigenvalue of the system matrix which determines the largest permissible time step. A bound expressed in terms of the ratio of the diagonal entries of the stiffness and mass matrices is shown to be tight within a small factor which depends only on the dimension and the choice of the reference element and basis functions but is independent of the mesh or the coefficients of the initial-boundary value problem under consideration. Another bound, which is less tight and expressed in terms of mesh geometry, depends only on the number of mesh elements and the alignment of the mesh with the diffusion matrix. The results provide an insight into how the interplay between the mesh geometry and the diffusion matrix affects the stability of explicit integration schemes when applied to a high order finite element approximation of linear parabolic equations on general nonuniform meshes.
keywords:
finite element method, anisotropic mesh, stability condition, parabolic equation
MSC:
[2010] 65M60, 65M50, 65F15
This is a preprint of a contribution to A. Abdulle et al. (eds.), Numerical Mathematics and Advanced Applications — ENUMATH 2013, Lecture Notes in Computational Science and Engineering, vol. 103.
© Springer International Publishing Switzerland 2015. The final version is available at https://doi.org/10.1007/978-3-319-10705-9_16.
††journal: Numerical Mathematics and Advanced Applications — ENUMATH 2013
1 Introduction
We consider the initial-boundary value problem (IBVP)
[TABLE]
where () is a bounded polygonal or polyhedral domain, , , is a given function, and is the diffusion matrix, which is assumed to be time-independent, symmetric and uniformly positive-definite on . If u^{0}\in H^{1}_{D}(\Omega)=\set{v\in H^{1}(\Omega):\text{v=0\Gamma_{D}}} and is sufficiently smooth, then the solution of the IBVP satisfies the stability estimates
[TABLE]
where is the energy norm. We are interested in the stability conditions so that the numerical approximation preserves these stability estimates.
The stability of explicit Runge-Kutta methods depends on the largest eigenvalue of the corresponding system matrix, which, in turn, depends on the mesh and the coefficients of the IBVP. For our model problem this means that we need to estimate the largest eigenvalue of , where and are the mass and stiffness matrices for the finite element discretization of the IBVP 1 [4, Theorem 3.1]. For the Laplace operator on a uniform mesh it is well known that , where is the number of mesh elements. For general meshes and diffusion coefficients, estimates have been derived recently in Huang et al. [4] and Zhu and Du [6, 7] (see also [1, 2, 3, 5] for estimates on and ). All of these works allow anisotropic diffusion coefficients and anisotropic meshes, while the former employs a more accurate measure for the interplay between the mesh geometry and the diffusion matrix and gives a sharper estimate on than the latter. On the other hand, [4] considers only linear finite elements whereas the estimates in [7] are valid for both linear and higher order finite elements.
The purpose of this paper is to extend the result of [4] to high order Lagrangian finite elements as well as provide a mathematical understanding of how the interplay between the mesh geometry and the diffusion matrix affects the stability condition. We show that the main result of [4, Theorem 3.3] holds for high order finite elements as well. The analysis is based on bounds on the mass and stiffness matrices. We follow the approach in [4, 5] and derive simple but accurate bounds for the case of high order Lagrangian finite elements on simplicial meshes (Lemmas 2, 3, 4 and 5). We also consider the more general case of surrogate mass matrices . The main result (Theorem 1) shows that is proportional to the maximum ratio between the corresponding diagonal entries of the stiffness and surrogate mass matrices. Moreover, is bounded by a term depending only on the number of the mesh elements and the alignment of the shape of the mesh elements with the inverse of the diffusion matrix.
2 Stability condition for explicit time stepping
Let be a family of simplicial meshes for and the Lagrangian () finite element space associated with . Let be an arbitrary element of , the reference element, and the element patch of the vertex (Fig. 1); element and patch volumes are denoted by and . For each let be an invertible affine mapping and its Jacobian matrix which is constant and satisfies (for simplicity, we assume that ). We further assume that the mesh is fixed for all time steps.
With , the finite element solution , , is defined by
[TABLE]
subject to the initial condition
[TABLE]
Let be the dimension of the finite element space and denote a nodal basis of by , then can be expressed as
[TABLE]
Using , 2 and 3 can be written into a matrix form
[TABLE]
where the mass and stiffness matrices and are defined by
[TABLE]
for all . We further assume that surrogate mass matrices considered throughout the paper satisfy
- (M1)
The reference element matrix is symmetric positive definite. 2. (M2)
The element matrix satisfies .
For example, (M1) and (M2) are satisfied for any mass lumping by means of numerical quadrature with positive weights.
Lemma 1** ([4, Theorem 3.1]).**
For a given explicit RK method with the polynomial stability function and a symmetric positive definite surrogate matrix that satisfies222In the following, the less-than-or-equal-to sign for matrices means that the difference between the right-hand side and left-hand side terms is positive semidefinite. for some positive constants and , the finite element approximation at satisfies
[TABLE]
if the time step is chosen such that
[TABLE]
This lemma is proven in [4] for the linear finite element discretization. However, from the proof one can see that it is valid for any system in the form of 4 with symmetric positive definite matrices and . Particularly, it can be used for the system 4 resulting from the finite element discretization. In the following, we establish a series of lemmas for bounds on the stiffness and mass matrices and and then develop bounds for .
Lemma 2**.**
Let be the maximal number of basis functions per element. Then the stiffness matrix and its diagonal part for finite elements satisfy
[TABLE]
Proof.
Notice that for any positive semi-definite matrix and any vectors and we have
[TABLE]
From this,
[TABLE]
Lemma 3**.**
Let be the basis functions on the reference element that correspond to and
[TABLE]
Then the diagonal entries of the stiffness matrix are bounded by
[TABLE]
Proof.
From the definition of the stiffness matrix we have
[TABLE]
Let be the gradient operator in . The chain rule yields and together with we obtain
[TABLE]
Lemma 4**.**
Let be a surrogate finite element mass matrix, and be the largest and smallest eigenvalues of the surrogate mass matrix on the reference element and
[TABLE]
Then
[TABLE]
Proof.
We have
[TABLE]
The lower bound can be obtained similarly. ∎
Lemma 5**.**
Let and be two surrogate mass matrices for finite elements. Then
[TABLE]
Proof.
Use Lemma 4 by applying 5 to and . ∎
Corollary 1**.**
Let and be the condition numbers of the full and the surrogate reference element mass matrices. Under the assumptions of Lemma 1 we have
[TABLE]
and
[TABLE]
Proof.
Use and in Lemma 5 and apply Lemma 1. ∎
Corollary 2**.**
The surrogate mass matrix for finite elements and its diagonal part satisfy
[TABLE]
Proof.
Using 5 with the canonical basis vector implies
[TABLE]
which gives
[TABLE]
Since and are diagonal matrices, this leads to
[TABLE]
The statement now follows from Lemma 5 with and . ∎
Having obtained the preliminary bounds on the stiffness and mass matrices and , we can now give the estimate for the largest eigenvalue of the system matrix for finite elements.
Theorem 1**.**
The eigenvalues of are real and positive and the largest eigenvalue is bounded by
[TABLE]
where is the maximal number of basis functions per element. Further,
[TABLE]
Proof.
Since and are symmetric positive definite, the eigenvalues of are real and positive. The lower bound in 7 is obtained by using the canonical basis vectors and the upper bound follows from Lemmas 2 and 2,
[TABLE]
The geometric bound 8 is a direct consequence of Lemmas 2, 3 and 4,
[TABLE]
∎
Theorem 1 can be used in combination with Lemma 1 or Corollary 1 to derive the stability condition of a given explicit Runge-Kutta scheme, as shown in the next example.
Example 1** (Explicit Euler method).**
The stability region of the explicit Euler method includes the real interval . Lemma 1 implies that the method is stable if
[TABLE]
Using Theorem 1, we conclude that the method is stable if the time step satisfies
[TABLE]
or, in terms of mesh geometry,
[TABLE]
Remark 1**.**
Lemmas 2, 3 and 2 are very general and valid for any mesh, any and any surrogate mass matrix satisfying (M1) and (M2). More accurate bounds can be obtained if more information is available about the mesh or the stiffness and mass matrices.
For example, if is an M-matrix, then the Gershgorin circle theorem yields [4, Remark 2.2] and therefore in Theorem 1 can be replaced by .
If (no mass lumping), then, instead of estimating through 6, a direct calculation for the standard finite elements yields
[TABLE]
and
[TABLE]
resulting in a slighly more accurate bound in Corollary 2. For simplicity, in Lemma 3 we used . A slightly more accurate bound can be derived if we use
[TABLE]
3 Summary and conclusion
Theorem 1 states that the largest eigenvalue of the system matrix and, thus, the largest permissible time step can be bounded by a term depending only on the number of mesh elements and the alignment of the mesh with the diffusion matrix.
The bound in terms of matrix entries is tight within a small factor which depends only on the dimension and the choice of the reference element and basis functions but is independent of the mesh or the coefficients of the IBVP. This is valid for any Lagrangian finite elements with .
A similar result is obtained by Zhu and Du [7, Theorem 3.1]. In our notation, it can be written as
[TABLE]
The significant difference between the new bound 8 and the bound 9 is the factor which represents the interplay between the mesh geometry and the diffusion matrix,
[TABLE]
vs.
[TABLE]
For isotropic or isotropic meshes both terms are comparable. However, the former is smaller than the latter in general. In particular, if both and are anisotropic, then the difference between 8 and 9 can be very significant (see [4, Sect. 4.4] for a numerical example in case of finite elements). In this sense, Theorem 1 can be seen either as a generalization of [4] to () finite elements or as a more accurate version of [7] for anisotropic meshes and general diffusion coefficients.
Finally, we would like to point out that a similar result can be established for -adaptive finite elements without major modifications.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Q. Du, D. Wang, and L. Zhu, On mesh geometry and stiffness matrix conditioning for general finite element spaces , SIAM J. Numer. Anal., 47 (2009), pp. 1421–1444, https://doi.org/10.1137/080718486 . · doi ↗
- 2[2] I. Fried, Bounds on the spectral and maximum norms of the finite element stiffness, flexibility and mass matrices , Internat. J. Solids and Structures, 9 (1973), pp. 1013–1034, https://doi.org/10.1016/0020-7683(73)90013-9 . · doi ↗
- 3[3] I. G. Graham and W. Mc Lean, Anisotropic mesh refinement: the conditioning of Galerkin boundary element matrices and simple preconditioners , SIAM J. Numer. Anal., 44 (2006), pp. 1487–1513, https://doi.org/10.1137/040621247 . · doi ↗
- 4[4] W. Huang, L. Kamenski, and J. Lang, Stability of explicit time integration schemes for finite element approximation of linear parabolic equations on anisotropic meshes , WIAS Preprint No. 1869 (2013). Appeared in SIAM J. Numer. Anal., 54 (2016), pp. 1612–1634, as Stability of explicit one-step methods for P 1-finite element approximation of linear diffusion equations on anisotropic meshes , https://doi.org/10.1137/130949531 , https://arxiv.org/abs/1602.08055 . · doi ↗
- 5[5] L. Kamenski, W. Huang, and H. Xu, Conditioning of finite element equations with arbitrary anisotropic meshes , Math. Comp., 83 (2014), pp. 2187–2211, https://doi.org/10.1090/S 0025-5718-2014-02822-6 , https://arxiv.org/abs/1201.3651 . · doi ↗
- 6[6] L. Zhu and Q. Du, Mesh-dependent stability for finite element approximations of parabolic equations with mass lumping , J. Comput. Appl. Math., 236 (2011), pp. 801–811, https://doi.org/10.1016/j.cam.2011.05.030 . · doi ↗
- 7[7] L. Zhu and Q. Du, Mesh dependent stability and condition number estimates for finite element approximations of parabolic problems , Math. Comp., 83 (2014), pp. 37–64, https://doi.org/10.1090/S 0025-5718-2013-02703-2 . · doi ↗
