Home Discontinuous Galerkin Methods for the Vlasov–Stokes System
Article Publicly Available

Discontinuous Galerkin Methods for the Vlasov–Stokes System

  • Harsha Hutridurga , Krishan Kumar and Amiya K. Pani ORCID logo EMAIL logo
Published/Copyright: January 30, 2024

Abstract

This paper develops and analyses a semi-discrete numerical method for the two-dimensional Vlasov–Stokes system with periodic boundary condition. The method is based on the coupling of the semi-discrete discontinuous Galerkin method for the Vlasov equation with discontinuous Galerkin scheme for the stationary incompressible Stokes equation. The proposed method is both mass and momentum conservative. Since it is difficult to establish non-negativity of the discrete local density, the generalized discrete Stokes operator become non-coercive and indefinite, and under the smallness condition on the discretization parameter, optimal error estimates are established with help of a modified the Stokes projection to deal with the Stokes part and, with the help of a special projection, to tackle the Vlasov part. Finally, numerical experiments based on the dG method combined with a splitting algorithm are performed.

MSC 2020: 65N30; 65M60; 65M12; 65M15; 82D10

1 Introduction

In this paper, we study a mathematical model describing sprays and aerosols, bubbly flows or suspension and sedimentation phenomena in two dimensions. It is the following coupled system of 2D incompressible steady generalized Stokes equation and a Vlasov type equation:

(1.1) { t f + v x f + v ( ( u v ) f ) = 0 in ( 0 , T ) × Ω x × R 2 , f ( 0 , x , v ) = f 0 ( x , v ) in Ω x × R 2 ,
(1.2) { Δ x u + ρ u + x p = ρ V in Ω x , x u = 0 in Ω x .
Here, Ω x denotes the two-dimensional torus T 2 . The fluid velocity of the background medium is denoted by u ( t , x ) , and the pressure is denoted by p ( t , x ) , which are functions of space and time variables. The distribution function f ( t , x , v ) describing the particle distribution depends on the time variable t > 0 , the spatial variable x Ω x and the velocity variable v R 2 . The local density of the particles is given by ρ := R 2 f d v . The coupling between the two systems is due to a drag force which is proportional to the relative velocity ( u v ) . This system is also important in biological applications, such as transport in the respiratory tract [14, 6].

The Vlasov–Stokes system has been rigorously derived from the dynamics of a system of particles in a fluid by Jabin and Perthame [23]. The existence of solution with its large time behaviour of a similar system has been studied by Hamdache [18]. In this work, the authors take the unsteady incompressible Stokes equation as the fluid equation for the background medium. The main idea of the existence proof in [18] is to first regularize the main problem, followed by an application of the Schauder fixed point theorem, to arrive at a solution of the regularized problem. Finally, the regularized solution in the limiting case yields the existence of a weak solution to the original problem. One of the crucial steps in the proof is the use of non-negativity of 𝜌, which makes the generalized Stokes system into a damped Stokes problem, leading to an application of the inf-sup condition. Based on the Banach fixed point argument and using ρ 0 in a crucial way, Höfer [20] has proved the existence of a unique weak solution to problem (1.1)–(1.2). In [22], the authors proved the existence of a unique strong solution in 3D using the Banach fixed point argument. In [22], the authors consider the unsteady Stokes equation for the background medium. For some regularity result, see [13].

In this paper, we develop discontinuous Galerkin methods for both the equations (dG-dG). Our work is inspired by the works [5, 11] which dealt with the Vlasov–Poisson system. Recently, in [21], a discontinuous Galerkin method for the Vlasov–viscous Burgers system is developed. In those three papers, the authors have analysed conservation and stability properties of the discrete system and have also derived optimal error estimates with the help of a special projection operator. The Vlasov equation is a form of transport problem which conserves total mass. Out of the several numerical methods, the discontinuous Galerkin method has the property to preserve the total mass of the discrete system, and hence we propose dG for the Vlasov equation. One can also choose local discontinuous Galerkin or any conforming numerical method for the Stokes system. One of the main difficulties in proving results like existence and uniqueness as well as optimal error estimates for the semi-discrete system is the currently unavailable results demonstrating the non-negativity of the discrete local density ρ h , and hence the corresponding generalized discrete Stokes problem becomes non-coercive and indefinite. This creates serious difficulties in the analysis, and therefore, a more refined analysis is needed to derive results under smallness condition on the discretizing parameter ℎ. In the literature, there have been some numerical works for a similar type of models in [16, 17].

Our major contributions in this paper are as follows.

  • Conservation properties and stability of the discrete system are analysed.

  • Since the generalized discrete Stokes operator fails to satisfy the inf-sup condition, a more in-depth analysis helps to achieve the result under a smallness assumption on the discretizing parameter ℎ.

  • Based on a modified generalized Stokes projection and a special projection, optimal error estimates are derived for the semi-discrete system.

  • Existence of a unique pair of solutions for the discrete system is established.

  • Finally, using a splitting algorithm, we perform some numerical experiments.

The paper is structured as follows. In Section 2, we describe some properties of the continuum model. In Section 3, we introduce a semi-discrete numerical method followed by proving certain properties of the discrete solution. The error analysis for the semi-discrete method is detailed in Section 4. Finally, in Section 5, some computational results are given.

2 Qualitative and Quantitative Aspects of the Model Problem

Through out this paper, we use standard notation for Sobolev spaces. Denote by W m , p the L p -Sobolev space of order m 0 . Set

L 0 2 ( Ω x ) = { g L 2 ( Ω x ) : Ω x g d x = 0 } , W m , p = ( W m , p ( Ω x ) ) 2 , u L = u [ L ( Ω x ) ] 2 , u W m , p = u [ W m , p ( Ω x ) ] 2 for all m 0 ,  1 p .

We further denote a special class of divergence-free (in the sense of distribution) vector fields by

J 1 = { z W 1 , 2 : x z = 0 , z is periodic } .

Set the local macroscopic velocity 𝑉 as

V ( t , x ) = 1 ρ R 2 f ( t , x , v ) v d v .

We define some physical quantities, mass and momentum, respectively as

R 2 Ω x f ( t , x , v ) d x d v and R 2 Ω x v f ( t , x , v ) d x d v ;

the energy and the velocity moments m k f for k 0 , respectively, as

R 2 Ω x | v | 2 f ( t , x , v ) d x d v and m k f ( t , x ) := R 2 | v | k f ( t , x , v ) d v .

Throughout this manuscript, any function defined on Ω x is assumed to be periodic in the 𝑥-variable.

The following properties hold for the solution ( f , u , p ) of the Vlasov–Stokes equations (1.1)–(1.2), whose proof can be found in [18].

  • (Positivity preserving) For any given non-negative initial datum f 0 , the solution 𝑓 is also non-negative, i.e., if f 0 ( x , v ) 0 , then f ( t , x , v ) 0 . Further, the local density is ρ ( t , x ) 0 .

  • (Mass conservation) The distribution function 𝑓 conserves mass in the sense that

    (2.1) Ω x R 2 f ( t , x , v ) d v d x = Ω x R 2 f 0 ( x , v ) d v d x for all t [ 0 , T ] .

  • (Total momentum conservation) The distribution function 𝑓 conserves momentum in the sense that

    (2.2) Ω x R 2 v f ( t , x , v ) d v d x = Ω x R 2 v f 0 ( x , v ) d v d x for all t [ 0 , T ] .

  • (Energy dissipation) The energy of the system dissipates, i.e.,

    (2.3) d d t R 2 Ω x | v | 2 f ( t , x , v ) d x d v 0 for any f 0 ( x , v ) 0 .

Multiplying equation (1.1) by | v | 2 and equation (1.2) by 2 u , followed by an integration by parts, shows

R 2 Ω x | v | 2 f ( t , x , v ) d x d v + 2 0 t Ω x | x u | 2 d x d t + 2 0 t R 2 Ω x | u v | 2 f d x d v d t = R 2 Ω x | v | 2 f 0 d x d v .

This is referred to as the energy identity. As f 0 , the third term on the left-hand side becomes non-negative, and hence

R 2 Ω x | v | 2 f ( t , x , v ) d x d v + 2 0 t Ω x | x u | 2 d x d t R 2 Ω x | v | 2 f 0 d x d v .

Moreover, if Ω x R 2 | v | 2 f 0 ( x , v ) d v d x < , then the above inequality yields u L 2 ( 0 , T ; J 1 ) . A use of the Sobolev inequality yields u L 2 ( 0 , T ; L p ) for all 2 p < .

The following result shows integrability estimates on the local density and on the momentum. As these appear as source terms in the Stokes equation, these estimates are crucial in deducing the regularity of a solution to the Stokes problem. The proof of the following result can be found in [18, Lemma 2.2, p. 56].

Lemma 1

Let p 1 . Let u L 2 ( 0 , T ; L p + 2 ) , f 0 L ( Ω x × R 2 ) L 1 ( Ω x × R 2 ) and let

R 2 Ω x | v | p f 0 d x d v < .

Then the local density 𝜌 and the momentum ρ V satisfy the following:

ρ L ( 0 , T ; L p + 2 2 ( Ω x ) ) and ρ V L ( 0 , T ; L p + 2 3 ( Ω x ) ) .

Remark 1

Taking p = 4 in Lemma 1 yields ρ L ( 0 , T ; L 3 ( Ω x ) ) and ρ V L ( 0 , T ; L 2 ( Ω x ) ) . These integrability properties of 𝜌 and ρ V in the Stokes equation (1.2) guarantee that u L 1 ( 0 , T ; L ) , which plays a crucial role in arriving at an L estimate on 𝜌.

The following lemma gives the L estimate in time and space variable for the local density. The proof of this can be found in [19, Proposition 4.6, p. 44].

Lemma 2

Let u L 1 ( 0 , T ; L ) and let sup C t , v r f 0 L loc ( R + ; L 1 ( R 2 ) ) , where C t , v r := Ω x × B ( e t v , r ) for all r > 0 , and B ( e t v , r ) denotes a ball of radius 𝑟 with centre at e t v . Then the following estimate holds:

ρ ( t , x ) L ( ( 0 , T ) × Ω x ) e 2 T sup t [ 0 , T ] sup C t , v r f 0 L 1 ( R 2 ) .

3 Discontinuous Galerkin Approximations

In this section, we design and analyse a discontinuous Galerkin scheme to approximate solutions to the continuum model (1.1)–(1.2). Note that a compactly supported (in the 𝑣 variable) initial datum results in a compactly supported (in the 𝑣 variable) solution f ( t , x , v ) to the Vlasov equation (1.1), provided t [ 0 , T ] , where 𝑇 depends on the size of f 0 and the magnitude of the background fluid velocity 𝒖. So, if we restrict ourselves to compactly supported (in the 𝑣 variable) data, we can assume without loss of generality that there exist constants L > 0 and T > 0 such that supp f ( t , x , ) Ω v = : [ L , L ] 2 for all t [ 0 , T ] and x Ω x .

Let T h x and T h v be two shape regular and quasi-uniform families of Cartesian partitions of Ω x and Ω v , respectively. Let { T h } be defined as the Cartesian product of these two partitions, i.e.,

T h = { R = T x × T v : T x T h x , T v T h v } .

The mesh sizes ℎ, h x and h v relative to these partitions are defined as follows:

h x := max T x T h x diam ( T x ) , h v := max T v T h v diam ( T v ) , h := max ( h x , h v ) .

We denote by Γ x and Γ v the set of all edges of the partitions T h x and T h v , respectively, and we set Γ = Γ x × Γ v . The sets of interior and boundary edges of the partition T h x (respectively, T h v ) are denoted by Γ x 0 (respectively, Γ v 0 ) and Γ x (respectively, Γ v ) so that Γ x = Γ x 0 Γ x (respectively, Γ v = Γ v 0 Γ v ).

Our objective is to develop a discontinuous Galerkin scheme to approximate solutions to the continuum model. We will consider the following broken polynomial spaces:

X h := { ψ L 2 ( Ω x ) : ψ | T x P k ( T x ) for all T x T h x } , V h := { ψ L 2 ( Ω v ) : ψ | T v P k ( T v ) for all T v T h v } , Z h := { ϕ L 2 ( Ω x × Ω v ) : ϕ | R P k ( T x ) × P k ( T v ) for all R = T x × T v T h } , U h := { ψ L 2 : ψ | T x ( P k ( T x ) ) 2 for all T x T h x } , P h := { ψ L 0 2 ( Ω x ) : ψ | T x P k ( T x ) for all T x T h x } ,

where P k ( T ) is the space of scalar polynomials of degree at most 𝑘 in each variable. More precisely, we will approximate the background velocity 𝒖 by u h U h , the fluid pressure 𝑝 by p h P h , the distribution function 𝑓 by f h Z h .

Let n and n + be the outward and inward unit normal vectors on the element 𝑇. The interior trace ψ of 𝜓 and the outer trace ψ + of 𝜓 on Γ x are defined by

ψ ± ( x , ) = lim ϵ 0 ψ ( x ± ϵ n , ) for all x Γ x .

Following [4, 28], we set the average and jump of a scalar function 𝜓 and a vector-valued function Ψ at the edges as follows:

{ ψ } = 1 2 ( ψ + ψ + ) , ψ = ψ n + ψ + n + on Γ r 0 , r = x or v , { Ψ } = 1 2 ( Ψ + Ψ + ) , Ψ = Ψ n + Ψ + n + on Γ r 0 , r = x or v .

For 0 δ 1 , the weighted average of a vector-valued function Ψ is defined by

{ Ψ } δ := δ Ψ + + ( 1 δ ) Ψ .

Note that, for a fixed edge, n = n + . For boundary edges, the jump and average are taken to be ψ = ψ n and { ψ } = ψ .

We will be considering the following discrete spaces:

W m , p ( T h ) = { ψ L p ( Ω ) : ψ | R W m , p ( R ) for all R T h } , m 0 ,  1 p .

We further denote W m , 2 ( T h ) by H m ( T h ) for m 1 . We define the following discrete norms:

w m , T h = ( R T h w m , R 2 ) 1 2 for all w H m ( T h ) , m 0 , w L p ( T h ) = ( R T h w L p ( R ) p ) 1 p for all w L p ( T h )

for all 1 p < and w L ( T h ) = ess sup w T h | w | . For F Γ x , w h X h ,

w h 0 , F 2 = F w h F w h F d s ( x ) .

For all ( w h , q h ) U h × P h ,

| | | w h | | | 2 = w h 0 , T h x 2 + F Γ x h x 1 w h L 2 ( F ) 2 , | | | ( w h , q h ) | | | 2 = | | | w h | | | 2 + q h 0 , T h x 2 + F Γ x h x q h L 2 2 .

Next, we recall certain function inequalities in the aforementioned discrete function spaces. These inequalities will be used in our subsequent analysis.

  • Inverse inequality (see [12, Lemma 1.44, p. 26]): For any w h X h , there exists a constant C > 0 such that

    x w h 0 , T x C h x 1 w h 0 , T x for all T x T h x .

  • Trace inequality (see [12, Lemma 1.46, p. 27]): If w h X h , then for all F Γ x and T x T h x , we have

    w h 0 , F C h x 1 2 w h 0 , T x .

  • Norm comparison (see [12, Lemma 1.50, p. 29]): Let 1 p , q and w h X h . Then, for all T x T h x ,

    (3.1) w h L p ( T x ) C h x 2 p 2 q w h L q ( T x ) .

  • A Poincaré–Friedrichs type inequality is proved in [3, Lemma 2.1, p. 744], which says that

    v h 0 , Ω x C | | | v h | | | for all v h H 1 ( Ω x ) .

  • Projection operators: Let k 0 . Let P x : L 2 ( Ω x ) X h , P x : L 2 U h , P v : L 2 ( Ω v ) V h and P h : L 2 ( Ω ) Z h be the standard L 2 -projections onto the spaces X h , U h , V h and Z h , respectively. Note that P h = P x P v (see [8, 1]).

    By definition, P h is stable in L 2 , and it can be further shown to be stable in all L p -norms (see [10] for details). Let 1 p . Then, for any w L p ( Ω ) , P h ( w ) L p ( T h ) C w L p ( Ω ) .

Next, we give a result which relates L bounds with L 2 bounds while approximating functions in aforementioned broken polynomial spaces.

Lemma 3

Let g W 1 , ( Ω x ) H k + 1 ( Ω x ) . Then

g g h L ( T h x ) h x g W 1 , ( Ω x ) + h x k g H k + 1 ( Ω x ) + h x 1 g g h 0 , T h x for all g h X h .

Proof

Observe that

g g h L ( T h x ) g P x g L ( T h x ) + P x g g h L ( T h x ) h x g W 1 , ( Ω x ) + h x 1 P x g g h 0 , T h x h x g W 1 , ( Ω x ) + h x 1 g P x g 0 , T h x + h x 1 g g h 0 , T h x h x g W 1 , ( Ω x ) + h x k g H k + 1 ( Ω x ) + h x 1 g g h 0 , T h x .

Here, in the second step, we have employed the projection estimate [29] for the first term, and the norm comparison estimate (3.1) is employed for the second term. In the last step, the projection estimate is used for the second term. ∎

Remark 2

A similar result to Lemma 3 also holds for functions on the phase space Ω. More precisely, let g ̃ W 1 , ( Ω ) H k + 1 ( Ω ) . Then

g ̃ g ̃ h L ( T h ) h g ̃ W 1 , ( Ω ) + h k g ̃ H k + 1 ( Ω ) + h 1 g ̃ g ̃ h 0 , T h for all g ̃ h Z h .

3.1 Semi-discrete dG Formulation

Our approximations scheme is to find ( f h , u h , p h ) ( t ) Z h × U h × P h for t [ 0 , T ] such that

(3.2) ( t f h , ψ h ) + R T h B h , R ( u h ; f h , ψ h ) = 0 for all ψ h Z h ,
(3.3) a h ( u h , ϕ h ) + b h ( ϕ h , p h ) + ( ρ h u h , ϕ h ) = ( ρ h V h , ϕ h ) for all ϕ h U h ,
(3.4) b h ( u h , q h ) + s h ( p h , q h ) = 0 for all q h P h ,
with the initial datum f h ( 0 ) = P h ( f 0 ) Z h . Here, similar to the continuum setting, we have set the discrete local density ρ h and the discrete local macroscopic velocity V h associated with f h as follows:

(3.5) ρ h = T v T h v T v f h d v and V h = 1 ρ h T v T h v T v v f h d v .

In the above formulation, (3.2) corresponds to the Vlasov equation and (3.3)–(3.4) correspond to the incompressible Stokes equations.

In (3.2), we have used the following notation:

(3.6) B h , R ( u h ; f h , ψ h ) := R f h v x ψ h d v d x + T v T x v n f h ̂ ψ h d s ( x ) d v R f h ( u h v ) v ψ h d v d x + T x T v ( u h v ) n f h ̂ ψ h d s ( v ) d x ,

wherein the numerical fluxes are taken to be

(3.7) { v n f h ̂ = { v f h } α n := ( { v f h } + | v n | 2 f h ) n on Γ x 0 × T v , ( u h v ) n f h ̂ = { ( u h v ) f h } β n := ( { ( u h v ) f h } + | ( u h v ) n | 2 f h ) n on T x × Γ v 0 ,

with n = n , α = 1 2 ( 1 ± sign ( v n ± ) ) and β = 1 2 ( 1 ± sign ( ( u h v ) n ± ) ) . For more details about the weighted average, see [7]. On the boundary edges e Γ r , r = x , v , we impose periodicity for v n f h ̂ and the compactness of support for ( u h v ) n f h ̂ .

In (3.3), the bilinear form a h ( u h , ϕ h ) stands for

(3.8) a h ( u h , ϕ h ) = i = 1 2 a h , i ( u h , i , ϕ h , i ) ,

where u h , 1 , u h , 2 and ϕ h , 1 , ϕ h , 2 denote the Cartesian components of u h and ϕ h , respectively, with

a h , i ( u h , i , ϕ h , i ) = T x T h x T x u h , i ϕ h , i d x + F Γ x F ϑ h x u h , i ϕ h , i d s ( x ) F Γ x F ( { u h , i } ϕ h , i + u h , i { ϕ h , i } ) d s ( x ) .

Here, ϑ > 0 is a penalty parameter. In (3.3)–(3.4), b h ( , ) stands for

(3.9) b h ( u h , q h ) = T x T h x T x q h u h d x + F Γ x F u h { q h } d s ( x ) ,

and the stabilization term in (3.4) is given by

(3.10) s h ( p h , q h ) = F Γ x h x F p h q h d s ( x ) .

Note that (3.3)–(3.4) is equivalent to

(3.11) A h ( ( u h , p h ) , ( ϕ h , q h ) ) + ( ρ h u h , ϕ h ) = ( ρ h V h , ϕ h ) for all ( ϕ h , q h ) U h × P h ,

where

(3.12) A h ( ( u h , p h ) , ( ϕ h , q h ) ) = a h ( u h , ϕ h ) + b h ( ϕ h , p h ) b h ( u h , q h ) + s h ( p h , q h ) .

We call (3.11) the discrete generalized Stokes system due to the presence of the term involving ρ h .

It turns out that the bilinear form a h ( u h , ϕ h ) is coercive in | | | | | | -norm (for proof, see [12, Lemma 4.12, p. 129]), i.e., there exists a constant β > 0 , independent of ℎ, such that β | | | u h | | | 2 a h ( u h , u h ) . Furthermore, the bilinear form A h ( ( u h , p h ) , ( ϕ h , q h ) ) satisfies the discrete inf-sup stability condition and is bounded in the | | | ( , ) | | | -norm, i.e., there exist constants α > 0 and C > 0 , independent of ℎ, such that

α | | | ( u h , p h ) | | | sup ( ϕ h , q h ) U h × P h { ( 0 , 0 ) } A h ( ( u h , p h ) , ( ϕ h , q h ) ) | | | ( ϕ h , q h ) | | |

(see [12, Lemma 6.13, p. 253]) and

(3.13) | A h ( ( u h , p h ) ( ϕ h , q h ) ) | C | | | ( u h , p h ) | | | | | | ( ϕ h , q h ) | | | .

Remark 3

At present, we are unable to show that the discrete local density is non-negative, i.e., ρ h 0 . Hence we are unable to demonstrate that the bilinear form on the left-hand side of the discrete generalized Stokes system (3.11), that is, A h ( ( u h , p h ) , ( ϕ h , q h ) ) + ( ρ h u h , ϕ h ) , satisfies the inf-sup condition. This makes the existence proof more involved. Hence, in Section 4.5, we revisit the existence and uniqueness result for the discrete system, where we show that (3.2) and (3.11) has a unique solution provided ℎ is small enough.

3.2 Qualitative Properties of the Discrete Solution

Lemma 4

Let ( f h , u h , p h ) C 1 ( [ 0 , T ] ; Z h × U h × P h ) be the dG-dG approximation obtained by solving the discrete system (3.2) and (3.11) with initial datum f h ( 0 ) = P h ( f 0 ) . Then, for all t 0 ,

(3.14) Ω f h ( t , x , v ) d x d v = Ω f 0 ( x , v ) d x d v when k 0 ,
(3.15) Ω v f h ( t , x , v ) d x d v = Ω v f 0 ( x , v ) d x d v when k 1 ,
(3.16) = 1 2 Ω | v | 2 f 0 ( x , v ) d x d v when k 2 .

Identities (3.14) and (3.15) are the discrete version of the mass and momentum conservation properties (2.1) and (2.2), respectively, that hold true in the continuum setting. Identity (3.16) is the discrete version of the energy identity (2.3) from the continuum setting. However, unlike the continuum setting, we are unable to prove that the discrete system (3.2) and (3.11) has the positive preserving property. Hence we do not, at present, have a discrete version of energy dissipation (2.3).

The proof of the identities in Lemma 4 are quite straightforward. A similar set of identities was proved for a dG scheme approximating solutions to the Vlasov–viscous Burgers system. Please consult [21, Lemmas 3.3–3.5] for proofs.

Next, we prove a stability estimate for the dG scheme (3.2) approximating solutions to the Vlasov equation.

Lemma 5

Let k 0 and let f h be the dG approximation to 𝑓, satisfying (3.2). Then

max t [ 0 , T ] f h 0 , T h e T f 0 0 , T h for any T > 0 .

Proof

Choosing ψ h = f h in (3.2) yields

1 2 d d t f h 0 , T h 2 R T h ( 1 2 R ( v x f h 2 + ( u h v ) v f h 2 ) d x d v ) T v T h v T v Γ x { v f h } α f h d s ( x ) d v T x T h x T x Γ v { ( u h v ) f h } β f h d s ( v ) d x = 0 .

After applying integration by parts in the second and in the third terms and after using the identity

f h 2 = 2 { f h } f h

with periodic boundary condition in 𝑥 and compact support in 𝑣, it follows that

1 2 d d t f h 0 , T h 2 f h 0 , T h 2 + T v T h v T v Γ x 0 | v n | 2 f h f h d s ( x ) d v + T x T h x T x Γ v 0 | ( u h v ) n | 2 f h f h d s ( v ) d x = 0 .

Observe that the last two terms on the left-hand side of the above equality are non-negative and hence can be dropped. An integration in time yields the desired result. ∎

As a consequence of Lemma 5, it follows

(3.17) ρ h 0 , T h x C ( T ) L f 0 0 , T h and ρ h V h 0 , T h x C ( T ) L 2 f 0 0 , T h .

For our subsequent use, we need the following lemma.

Lemma 6

Let f h be the dG approximation to the continuum solution 𝑓, obtained by solving (3.2). Let ρ h , V h be the discrete local density, the discrete local macroscopic velocity associated with f h defined as in (3.5). Let ρ , V be the local density, the local macroscopic velocity associated with 𝑓. Then

ρ ρ h 0 , T h x 2 L f f h 0 , T h , ρ ρ h L ( T h x ) 4 L 2 f f h L ( T h ) , ρ V ρ h V h 0 , T h x 4 L 2 f f h 0 , T h .

The estimates in the above lemma are a mere consequence of the Cauchy–Schwarz inequality. A similar set of estimates was proved for a dG scheme approximating solutions to the Vlasov–viscous Burgers system. Please consult [21, Lemma 3.7] for the proofs.

4 A Priori Error Estimates

This section discusses some a priori error estimates for the discrete solution.

4.1 Error Estimates for Stokes System

The error equation for the Stokes problem is

A h ( ( u u h , p p h ) , ( ϕ h , q h ) ) + ( ρ u ρ h u h , ϕ h ) = ( ρ V ρ h V h , ϕ h ) .

To estimate u u h , we rewrite it as

u u h = u u ̃ h + u ̃ h u h = u P x u + P x u u ̃ h + u ̃ h u h .

Here, u ̃ h is the solution of an auxiliary problem (4.1) given below. A projection estimate gives the estimate of u P x u L 2 . So, to estimate u u h L 2 , it is sufficient to estimate P x u u ̃ h L 2 and u ̃ h u h L 2 . We will obtain these estimates in Lemmas 8 and 9, respectively.

We now consider the following auxiliary discrete Stokes problem for the unknown ( u ̃ h , p h ) U h × P h :

(4.1) A h ( ( u ̃ h , p ̃ h ) , ( ϕ h , q h ) ) + ( ρ u ̃ h , ϕ h ) = ( ρ V , ϕ h ) for all ( ϕ h , q h ) U h × P h ,

where A h ( ( u ̃ h , p ̃ h ) , ( ϕ h , q h ) ) is defined as in (3.12). Note that the above auxiliary problem differs from the original discrete generalized Stokes system (3.12) in that the discrete local density ρ h and discrete local momentum ρ h V h are replaced by the local density 𝜌 and the local momentum ρ V associated with the continuum solution 𝑓.

Lemma 7

The auxiliary discrete Stokes problem (4.1) satisfies the discrete inf-sup condition, i.e., there exists a constant α > 0 , independent on ℎ, such that

(4.2) α | | | ( u ̃ h , p ̃ h ) | | | sup ( ϕ h , q h ) U h × P h { ( 0 , 0 ) } A h ( ( u ̃ h , p ̃ h ) , ( ϕ h , q h ) ) + ( ρ u ̃ h , ϕ h ) | | | ( ϕ h , q h ) | | | .

Furthermore, we have

| A h ( ( u ̃ h , p ̃ h ) , ( ϕ h , q h ) ) + ( ρ u ̃ h , ϕ h ) | | | | ( u ̃ h , p ̃ h ) | | | | | | ( ϕ h , q h ) | | | .

Proof

Let the right-hand side of (4.2) be denoted by L ( u ̃ h , p ̃ h ) . Note that

(4.3) C | | | u ̃ h | | | 2 + F Γ x h x p ̃ h L 2 2 L ( u ̃ h , p ̃ h ) | | | ( u ̃ h , p ̃ h ) | | | .

Note that b h ( ϕ h , p h ) satisfies the discrete inf-sup condition (for detailed proof, see [12, Lemma 6.10, p. 251]), i.e.,

p ̃ h 0 , T h x sup ϕ h U h { 0 } b h ( ϕ h , p ̃ h ) | | | ϕ h | | | + ( F Γ x h x p ̃ h L 2 2 ) 1 2 .

Taking q h = 0 in (3.12), it follows that

b h ( ϕ h , p ̃ h ) = A h ( ( u ̃ h , p ̃ h ) , ( ϕ h , 0 ) ) a h ( u ̃ h , ϕ h ) ,

and hence, there holds

p ̃ h 0 , T h x sup ϕ h U h × P h { ( 0 , 0 ) } ( A h ( ( u ̃ h , p ̃ h ) , ( ϕ h , 0 ) ) | | | ( ϕ h , 0 ) | | | a h ( u ̃ h , ϕ h ) | | | ϕ h | | | ) + ( F Γ x h x p ̃ h L 2 2 ) 1 2 sup ϕ h U h { 0 } | a h ( u ̃ h , ϕ h ) | | | | ϕ h | | | + sup ϕ h U h { 0 } | ( ρ u ̃ h , ϕ h ) | | | | ϕ h | | | + L ( u ̃ h , p ̃ h ) + ( F Γ x h x p ̃ h L 2 2 ) 1 2 | | | u ̃ h | | | + L ( u ̃ h , p ̃ h ) + ( F Γ x h x p ̃ h L 2 2 ) 1 2 .

Squaring on both sides yields

p ̃ h 0 , T h x 2 L 2 ( u ̃ h , p ̃ h ) + | | | u ̃ h | | | 2 + F Γ x h x p ̃ h L 2 2 L 2 ( u ̃ h , p ̃ h ) + L ( u ̃ h , p ̃ h ) | | | ( u ̃ h , p ̃ h ) | | | ,

where we have used (4.3).

This along with (4.3) yields

| | | ( u ̃ h , p ̃ h ) | | | 2 L 2 ( u ̃ h , p ̃ h ) + L ( u ̃ h , p ̃ h ) | | | ( u ̃ h , p ̃ h ) | | | ,

from which (4.2) follows. A use of (3.13) with the fact that ρ L ( Ω x ) (Lemma 2) shows the boundedness result. This completes the proof. ∎

Note that the local density is ρ 0 . Thanks to the inf-sup condition and the boundedness property proved in Lemma 7, an application of the Lax–Milgram lemma demonstrates the existence of a unique solution ( u ̃ h , p ̃ h ) U h × P h for the auxiliary problem (4.1).

To estimate u u ̃ h , we use the following identity:

(4.4) A h ( ( u u ̃ h , p p ̃ h ) , ( ϕ h , q h ) ) + ( ρ ( u u ̃ h ) , ϕ h ) = 0 .

Using L 2 -projections, we rewrite

(4.5) u u ̃ h = ( u P x u ) + ( P x u u ̃ h ) = θ u η u , p p ̃ h = ( p P x p ) + ( P x p p ̃ h ) = θ p η p ,

where

θ u = P x u u ̃ h , η u = P x u u , θ p = P x p p ̃ h , η p = P x p p .

Using (4.5), we rewrite (4.4) as

(4.6) A h ( ( θ u , θ p ) , ( ϕ h , q h ) ) + ( ρ θ u , ϕ h ) = A h ( ( η u , η p ) , ( ϕ h , q h ) ) + ( ρ η u , ϕ h ) .

Lemma 8

Let ( u , p ) denote the unique solution of the Stokes equation (1.2). Let ( u ̃ h , p ̃ h ) U h × P h be the solution of the auxiliary problem (4.1). Assume ( u , p ) L ( [ 0 , T ] ; H k + 1 ) × L ( [ 0 , T ] ; H k ) . Then there exists a positive constant 𝐶, independent of ℎ, such that

u u ̃ h L 2 + h x | | | u u ̃ h | | | + h x p p ̃ h 0 , T h x C h x k + 1 .

Proof

Note that | | | u u ̃ h | | | | | | θ u | | | + | | | η u | | | . A projection estimate yields | | | η u | | | C h k . Hence it suffices to estimate | | | θ u | | | . Employing the discrete inf-sup condition and the boundedness property(proved in Lemma 7) in equation (4.6), we obtain α | | | ( θ u , θ p ) | | | | | | ( η u , η p ) | | | . A use of the projection estimate yields

(4.7) | | | ( θ u , θ p ) | | | C h x k .

Similarly, as u u ̃ h L 2 η u L 2 + θ u L 2 and as we have η u L 2 C h x k + 1 from the projection estimate, it is enough to estimate θ u L 2 .

Let ( ζ , ξ ) [ H 1 L 0 2 ] × L 2 denote the solution of the Stokes problem (1.2) with forcing term θ u L 2 . Then, owing to Stokes regularity [15, 2, 24], we have

(4.8) ζ H 2 + ξ H 1 C θ u L 2 .

Moreover, since ζ H 2 L 0 2 , ζ = 0 , ζ i = 0 , i = 1 , 2 , across all F Γ x 0 and ζ = 0 across all F Γ x , we obtain

a h ( θ u , ζ ) = a h ( ζ , θ u ) = ( Δ x ζ , θ u ) Ω x , b h ( ζ , θ p ) = 0 .

Since ξ H 1 ( Ω x ) , ξ n = 0 across all F Γ x 0 , we obtain

b h ( θ u , ξ ) = ( θ u , x ξ ) Ω x , s h ( θ p , ξ ) = 0 .

Hence

θ u L 2 2 = ( ( Δ x ζ + x ξ + ρ ζ ) , θ u ) Ω x = A h ( ( θ u , θ p ) , ( ζ , ξ ) ) + ( ρ θ u , ζ ) .

Note that A h ( ( θ u , θ p ) , ( P x ζ , P x p ) ) + ( ρ θ u , P x ζ ) = 0 .

Using the boundedness property and the projection estimates, we obtain

θ u L 2 2 = A h ( ( θ u , θ p ) , ( ζ P x ζ , ξ P x ξ ) ) + ( ρ θ u , ζ P x ζ ) | | | ( θ u , θ p ) | | | | | | ( ζ P x ζ , ξ P x ξ ) | | | h x | | | ( θ u , θ p ) | | | ( ζ H 2 + ξ H 1 ) h x | | | ( θ u , θ p ) | | | θ u L 2 ,

where we have used (4.8) in the final step. Hence we get

u u ̃ h L 2 C h x k + 1 .

Observe that

p p ̃ h 0 , T h x θ p 0 , T h x + η p 0 , T h x .

From the projection estimate, we have η p 0 , T h x C h x k , and from (4.7), we have θ p 0 , T h x C h x k . This completes the proof. ∎

Now, to find the estimate on the term u ̃ h u h , we use

(4.9) A h ( ( u ̃ h u h , p ̃ h p h ) , ( ϕ h , q h ) ) + ( ρ u ̃ h ρ h u h , ϕ h ) = ( ρ V ρ h V h , ϕ h ) .

For the rest of this paper, we assume that there are positive constants 𝐾, h 0 and K * , with K * 2 K such that

u L ( [ 0 , T ] ; L ) K

and

(4.10) u h L ( [ 0 , T ] ; L ) K * for 0 < h h 0 .

Lemma 9

Let ( u ̃ h , p ̃ h ) U h × P h be the solution of the auxiliary problem (4.1) and let ( u h , p h ) U h × P h be the solution to the discrete generalized Stokes problem (3.11). Then

(4.11) | | | u ̃ h u h | | | + p ̃ h p h 0 , T h x C ( K * ) f f h 0 , T h .

Proof

Equation (4.9) can be rewritten as

A h ( ( u ̃ h u h , p ̃ h p h ) , ( ϕ h , q h ) ) + ( ρ ( u ̃ h u h ) , ϕ h ) = ( ( ρ h ρ ) u h , ϕ h ) + ( ρ V ρ h V h , ϕ h ) .

Then (4.11) is a consequence of the discrete inf-sup condition and the boundedness property proved in Lemma 7 and the 0 , T h bounds of ( ρ ρ h ) and ( ρ V ρ h V h ) from Lemma 6. The dependence of the constant in (4.11) on K * is due to our assumption (4.10). ∎

Putting together the estimate of Lemma 8 and Lemma 9 gives the following estimate.

Theorem 1

Let ( u , p ) denote the unique solution of the Stokes equation (1.2) and let ( u h , p h ) U h × P h solve the discrete generalized Stokes problem (3.11). Assume that ( u , p ) L ( [ 0 , T ] ; H k + 1 ) × L ( [ 0 , T ] ; H k ( Ω x ) ) . Then there exists a positive constant 𝐶, independent of ℎ, such that

u u h L 2 + h x | | | u u h | | | + h x p p h 0 , T h x C h x k + 1 + C ( K 0 * ) f f h 0 , T h .

4.2 Error Estimates for Vlasov Equation

The error equation for the Vlasov equation is

( t ( f f h ) , ψ h ) + R T h ( B h , R ( u ; f , ψ h ) B h , R ( u h ; f h , ψ h ) ) = 0 for all ψ Z h ,

where B h , R ( ; , ) is defined in (3.2).

Setting e f = f f h , we rewrite the above equation as

(4.12) ( t e f , ψ h ) + a h 0 ( e f , ψ h ) + N ( u ; f , ψ h ) N h ( u h ; f h , ψ h ) = 0 for all ψ h Z h ,

where

a h 0 ( e f , ψ h ) = R T h R e f v x ψ h d v d x + T v T h v T v Γ x { v e f } α ψ h d s ( x ) d v , N ( u ; f , ψ h ) = R T h R f ( u v ) v ψ h d v d x + T x T h x T x Γ v f ( u v ) ψ h d s ( v ) d x , N h ( u h ; f h , ψ h ) = R T h R f h ( u h v ) v ψ h d v d x + T x T h x T x Γ v { ( u h v ) f h } β ψ h d s ( v ) d x .

4.3 Special Projection

To define the projection operator, first we define a one-dimensional projection operator π ± whose definition is based on the projection defined in [26, Section 3.1]. Let π + : H 1 2 + ϵ X h be the projection operator defined by

(4.13) T x ( π + ( w ) w ) q h d x = 0 for all q h P k 1 ( T x ) ,

together with the matching condition π + ( w ( x + ) ) = w ( x + ) , and let π : H 1 2 + ϵ X h be the projection operator defined as

(4.14) T x ( π ( w ) w ) q h d x = 0 for all q h P k 1 ( T x ) ,

together with the matching condition π ( w ( x ) ) = w ( x ) . The projection estimates for π ± are available (see [26])

w π ± ( w ) 0 , T x C h k + 1 | w | k + 1 , T x ,

where 𝐶 is a constant depending only on the shape regularity of the mesh and the polynomial degree.

Inspired by the projection operator defined in [5, 11], we define a projection operator Π h : C 0 ( Ω ) Z h as follows. Let R = T x × T v be an arbitrary element of T h and let w C 0 ( R ) . The restriction of Π h ( w ) to 𝑅 is defined by

(4.15) Π h ( w ) = { ( Π ̃ x Π ̃ v ) ( w ) if sign ( ( u v ) n ) = constant , ( Π ̃ x P ̃ v ) ( w ) if sign ( ( u v ) n ) constant ,

where Π ̃ x : C 0 ( Ω x ) X h and Π ̃ v : C 0 ( Ω v ) V h are the 2-dimensional projection operators as follows (similar to [25, 9]). Taking v = [ v 1 , v 2 ] t and u = [ u 1 , u 2 ] t ,

Π ̃ x ( w ) = { π x , 1 π x , 2 if v 1 > 0 , v 2 > 0 , π x , 1 + π x , 2 if v 1 < 0 , v 2 > 0 , π x , 1 + π x , 2 + if v 1 < 0 , v 2 < 0 , π x , 1 π x , 2 + if v 1 > 0 , v 2 < 0 ,
Π ̃ v ( w ) = { π v , 1 π v , 2 if u 1 v 1 > 0 , u 2 v 2 > 0 , π v , 1 + π v , 2 if u 1 v 1 < 0 , u 2 v 2 > 0 , π v , 1 π v , 2 + if u 1 v 1 > 0 , u 2 v 2 < 0 , π v , 1 + π v , 2 + if u 1 v 1 < 0 , u 2 v 2 < 0 ,
where the subscript 𝑖 in π r , i ± ( r = x or 𝑣) refers to the fact that projection is along the 𝑖-th component in the 𝑟 space.

In (4.15), P ̃ v : L 2 ( Ω v ) V h , which accounts for the cases where ( u v ) n changes sign across any single element T x × T v , is given by

P ̃ v ( w ) = { [ P v , 1 π v , 2 ± ] ( w ) if sign ( u 1 v 1 ) constant and sign ( u 2 v 2 ) = constant , [ π v , 1 ± P v , 2 ] ( w ) if sign ( u 1 v 1 ) = constant and sign ( u 2 v 2 ) constant , [ P v , 1 P v , 2 ] ( w ) if sign ( u 1 v 1 ) constant and sign ( u 2 v 2 ) constant ,

where P v , i , i = 1 , 2 , stands for the standard one-dimensional projection along the v i direction.

The following lemma deals with the approximation properties of projection operator Π h , whose proof is similar to [11, Lemma 4.1, p. 19].

Lemma 10

Let w H k + 1 ( R ) , s 0 , and let Π h be the projection operator defined through (4.13)–(4.15). Then, for all e ( T x × T v ) ( T x × T v ) , there holds

(4.16) w Π h ( w ) 0 , R + h 1 2 w Π h ( w ) 0 , e C h k + 1 w k + 1 , R .

Summing estimates (4.16) from Lemma 10, over elements of the partition T h , we obtain

(4.17) w Π h ( w ) 0 , T h + h 1 2 w Π h ( w ) 0 , Γ x × T h v + h 1 2 w Π h ( w ) 0 , T h x × Γ v C h k + 1 w k + 1 , Ω .

Using the special projection, split f f h as

(4.18) e f := f f h := ( Π h ( f ) f h ) ( Π h ( f ) f ) := θ f η f ,

where θ f = Π h ( f ) f h and η f = Π h ( f ) f .

Lemma 11

Let u C 0 ( Ω x ) , f C 0 ( Ω ) and f h Z h with k 0 . Then the following identity holds:

N ( u ; f , θ f ) N h ( u h ; f h , θ f ) = T x T h x T x Γ v | ( u h v ) n | 2 | θ f | 2 d s ( v ) d x + R T h R ( ( u u h ) v f θ f θ f 2 ) d v d x + K 2 ( u h v , f , θ f ) ,

where

(4.19) K 2 ( u h v , f , θ f ) = R T h R η f ( u h v ) v θ f d v d x T x T h x T x Γ v { ( u h v ) η f } β θ f d s ( v ) d x .

The proof of the above lemma is similar to the proof of [11, Lemma 4.5] by replacing E = u v and E h = u h v .

After choosing ψ h = θ f in error equation (4.12) and a use of (4.18) and Lemma 11, we can rewrite our error equation as

(4.20) ( t θ f , θ f ) + T v T h v T v Γ x | v n | 2 | θ f | 2 d s ( x ) d v + T x T h x T x Γ v | ( u h v ) n | 2 | θ f | 2 d s ( v ) d x = ( t η f , θ f ) K 1 ( v , η f , θ f ) R T h R ( ( u u h ) v f θ f θ f 2 ) d v d x K 2 ( u h v , f , θ f ) ,

where

(4.21) K 1 ( v , η f , θ f ) = R T h R η f v x θ f d x d v T v T h v T v Γ x { v η f } α θ f d s ( x ) d v .

To show the estimate on e f := θ f η f , it is enough to show the estimate on θ f since, from Lemma 10, estimates on η f are known.

Let T x = e 1 ± e 2 ± with e i ± denoting the edges of T x in the x i -direction and

e i + = { e T x : v n > 0 } , e i = { e T x : v n < 0 } , i = 1 , 2 .

Similarly, T v = γ 1 ± γ 2 ± with γ i ± denoting the edges of T v in the v i -direction and

γ i + = { γ T v : ( u h v ) n > 0 } , γ i = { γ T v : ( u h v ) n < 0 } , i = 1 , 2 .

Lemma 12

Let k 1 and let f C 0 ( [ 0 , T ] ; W 1 , ( Ω ) H k + 2 ( Ω ) ) be the distribution function solution of (1.1). Let f h ( t ) Z h be its approximation satisfying (3.2) and let K 1 ( v , η f , θ f ) be defined as in (4.21). Assume that the partition T h is constructed so that none of the components of 𝑣 vanish inside any element. Then the following estimate holds:

| K 1 ( v , η f , θ f ) | C h k + 1 ( f k + 1 , Ω + L f k + 2 , Ω ) θ f 0 , T h

for all t [ 0 , T ] .

The proof of the above lemma is similar to the proof of [11, Lemma 4.2].

Lemma 13

Let T h be a Cartesian mesh of Ω, k 1 and let ( u h , f h ) U h × Z h be the solution to (3.2). Let

( u , f ) L ( [ 0 , T ] ; W 1 , H k + 1 ) × L ( [ 0 , T ] ; W 1 , ( Ω ) H k + 2 ( Ω ) )

and let K 2 be defined as in (4.19). Then the following estimate holds:

(4.22) | K 2 ( u h v , f , θ f ) | C h k u h u L f k + 1 , Ω θ f 0 , T h + C h k + 1 ( u W 1 , f k + 1 , Ω + ( L + u L ) f k + 2 , Ω ) θ f 0 , T h .

The proof of the above lemma is similar to the proof of [11, Lemma 4.3] by replacing E = u v and E h = u h v .

4.4 Optimal Error Estimates

Theorem 2

Let k 1 and let f C 1 ( [ 0 , T ] ; H k + 2 ( Ω ) W 1 , ( Ω ) ) be the solution of the Vlasov–Stokes problem (1.1)–(1.2) with u C 0 ( [ 0 , T ] ; H k + 1 W 1 , ) . Further, let ( u h , f h ) U h × Z h be the dG-dG approximation obtained by solving (3.11) and (3.2). Then

f ( t ) f h ( t ) 0 , T h C ( K * ) h k + 1 for all t [ 0 , T ] ,

where C ( K * ) depends on the final time 𝑇, the polynomial degree 𝑘, the shape regularity of the partition and the continuous solution ( u , f ) .

Proof

Note that f f h 0 , T h η f 0 , T h + θ f 0 , T h . Since, from equation (4.17), the estimate of η f 0 , T h is known, it is enough to estimate θ f 0 , T h .

It follows from (4.20) that

(4.23) 1 2 d d t θ f 0 , T h 2 + 1 2 | v n | 1 2 θ f 0 , Γ x × T h v 2 + 1 2 | ( u h v ) n | 1 2 θ f 0 , T h x × Γ v 2 = ( t η f , θ f ) R T h R ( u u h ) v f θ f d v d x K 1 ( v , η f , θ f ) K 2 ( u h v , f , θ f ) + R T h R θ f 2 d v d x = : I 1 I 2 K 1 K 2 + I 3 ,

where

I 1 := ( t η f , θ f ) , I 2 := R T h R ( u u h ) v f θ f d v d x and I 3 := R T h R θ f 2 d v d x .

Note that

(4.24) | I 1 | t η f 0 , T h θ f 0 , T h C h k + 1 t f k + 1 , T h θ f 0 , T h C h 2 k + 2 t f k + 1 , T h 2 + C θ f 0 , T h 2 ,

where we have used the projection estimate (4.17) in the second step. Note that it is here that we require 𝑓 to be C 1 in the time variable.

Observe that

(4.25) | I 2 | = | R T h R ( u u h ) v f θ f d v d x | u u h L 2 v f L ( Ω ) θ f 0 , T h u u h L 2 2 v f L ( Ω ) + v f L ( Ω ) θ f 0 , T h 2 C ( K * ) h 2 k + 2 f W 1 , ( Ω ) f k + 1 , Ω 2 + C 0 ( K * ) θ f 0 , T h 2 ,

where we have used the estimate from Theorem 1. Note that it is here in (4.25) that we require 𝑓 to be in W 1 , in the 𝑣 variable.

The estimate for K 1 in Lemma 12 yields

(4.26) | K 1 | C h 2 k + 2 ( f k + 1 , Ω + L f k + 2 , Ω ) 2 + C θ f 0 , T h 2 .

To deal with K 2 , we observe that the bound (4.22) in Lemma 13 yields

(4.27) | K 2 | C h k u u h L f k + 1 , Ω θ f 0 , T h + C h k + 1 ( u W 1 , f k + 1 , Ω + ( L + u L ) f k + 2 , Ω ) θ f 0 , T h C h k ( h u W 1 , + h k u H k + 1 + h 1 u u h L 2 ) f k + 1 , Ω θ f 0 , T h + C h k + 1 ( u W 1 , f k + 1 , Ω + ( L + u L ) f k + 2 , Ω ) θ f 0 , T h C h k ( h u W 1 , + h k u H k + 1 + h k C ( K * ) ) f k + 1 , Ω θ f 0 , T h + C h k + 1 ( u W 1 , f k + 1 , Ω + ( L + u L ) f k + 2 , Ω ) θ f 0 , T h + C ( K * ) θ f 0 , T h 2 C 1 ( K * ) h 2 k + 2 + C 2 ( K * ) θ f 0 , T h 2 .

Here, in the second step, we have used Lemma 3, which requires u W 1 , . In the third step, we employ Theorem 1 to estimate u u h L 2 .

Substituting estimates (4.24)–(4.27) into (4.23) and using the fact that the last two terms on the left-hand side are non-negative, we obtain

d d t θ f 0 , T h 2 C 3 ( K * ) h 2 k + 2 + C 4 ( K * ) θ f 0 , T h 2 .

A standard application of the Grönwall inequality shows

θ f ( t ) 0 , T h 2 C ( K * ) h 2 k + 2 ,

where C ( K * ) is now independent of ℎ and f h , and depends on 𝑡 and on the solution ( u , f ) through its norm. This completes the proof. ∎

Theorem 3

Let k 1 and let

( u , p , f ) C 0 ( [ 0 , T ] ; H k + 1 W 1 , ) × C 0 ( [ 0 , T ] ; H k ( Ω x ) ) × C 1 ( [ 0 , T ] ; H k + 2 ( Ω ) W 1 , ( Ω ) )

be the solution of the Vlasov–Stokes equation (1.1)–(1.2). Further, let

( u h , p h , f h ) C 0 ( [ 0 , T ] ; U h ) × C 0 ( [ 0 , T ] ; P h ) × C 1 ( [ 0 , T ] ; Z h )

be the dG-dG approximation solution obtained by solving (3.2)–(3.11). Then there holds

f ( t ) f h ( t ) 0 , T h + ( u u h ) ( t ) L 2 + h p p h 0 , T h x C h k + 1 for all t [ 0 , T ] ,

where 𝐶 depends on the final time 𝑇, the polynomial degree 𝑘, the shape regularity of the partition and the norm of ( u , f ) .

Proof

As a consequence of Theorems 1 and 2, we arrive at

( u u h ) ( t ) L 2 C ( K * ) h k + 1 , h p p h 0 , T h x C h k + 1 and ( f f h ) ( t ) 0 , T h C ( K * ) h k + 1 .

Now, to complete the proof, we need to show u h is indeed bounded. More precisely, we need to show (4.10). Note that, for small ℎ and k 1 , from Lemma 3, we obtain

u h L ( [ 0 , T ] ; L ) u u h L ( [ 0 , T ] ; L ) + u L ( [ 0 , T ] ; L ) C ( K * ) h + u L ( [ 0 , T ] ; L ) 2 K K * .

This completes the proof. ∎

Remark 4

Thanks to the estimate in Theorem 3, Lemma 9 yields a super-convergence result

| | | ( u ̃ h u h ) ( t ) | | | C h k + 1 for all t ( 0 , T ] .

Since, for 1 p < , the Sobolev embedding says

( u ̃ h u h ) ( t ) L p C | | | ( u ̃ h u h ) ( t ) | | | for all t ( 0 , T ] ,

we have

( u ̃ h u h ) ( t ) L p C h k + 1 for all t ( 0 , T ] .

Again, as Ω x R 2 , the Sobolev embedding (see [27, Lemma 6.4, p. 88]) implies

( u ̃ h u h ) ( t ) L C ( log ( 1 h ) ) | | | ( u ̃ h u h ) ( t ) | | | C ( log ( 1 h ) ) h k + 1 for all t ( 0 , T ] .

4.5 Existence and Uniqueness of the Discrete System (3.2) and (3.11)

Lemma 14

There exists a unique solution ( u h , p h , f h ) C 1 ( [ 0 , T ] , U h × P h × Z h ) to the discrete system (3.2) and (3.11).

Proof

From (3.17), we have that ρ h , ρ h V h L 2 ( Ω x ) . Since, for a given ρ h , (3.11) leads to a system of linear algebraic equations, it is enough to prove that the corresponding homogeneous system given by

A h ( ( u h , p h ) , ( ϕ h , q h ) ) + ( ρ h u h , ϕ h ) = 0

has identically zero solution, i.e., ( u h , p h ) ( 0 , 0 ) .

The above homogeneous system can be rewritten as

A h ( ( u h , p h ) , ( ϕ h , q h ) ) + ( ρ u h , ϕ h ) = ( ( ρ ρ h ) u h , ϕ h ) .

A use of discrete inf-sup condition (4.2), the Hölder inequality, Lemma 6 and Theorem 3 gives

α | | | ( u h , p h ) | | | sup ( ϕ h , q h ) U h × P h { ( 0 , 0 ) } A h ( ( u h , p h ) , ( ϕ h , q h ) ) + ( ρ u h , ϕ h ) | | | ( ϕ h , q h ) | | | = sup ϕ h U h { 0 } ( ( ρ ρ h ) u h , ϕ h ) | | | ϕ h | | | sup ϕ h U h { 0 } ρ ρ h 0 , T h | | | u h | | | | | | ϕ h | | | | | | ϕ h | | | f f h 0 , T h | | | u h | | | C h k + 1 | | | u h | | | C h k + 1 | | | ( u h , p h ) | | | .

Choosing ℎ small enough so that ( α C h k + 1 ) > 0 implies that ( u h , p h ) ( 0 , 0 ) , this completes the proof of existence and uniqueness of the solution ( u h , p h ) for a given f h .

Therefore, the solution map f h u h = S ( f h ) is well defined. Substituting S ( f h ) in place of u h in equation (3.2) leads to a system of non-linear ODEs. Since the non-linearity is locally Lipschitz, an application of the Picard theorem yields the existence of the unique solution f h ( t ) for t ( 0 , t n * ) for some t n * . Now, using Lemma 5 for boundedness of f h , we can extend our solution to the complete interval [ 0 , T ] using continuation arguments. This concludes the proof. ∎

Remark 5

With appropriate modifications, it is possible to extend the present analysis to a 3D Vlasov–Stokes system with order of convergence

f ( t ) f h ( t ) 0 , T h + ( u u h ) ( t ) L 2 = O ( h k + 1 ) for k 2 .

To expand it a bit in 3D, the norm comparison inequality becomes

(4.28) w h L p ( T x ) C h x 3 p 3 q w h L q ( T x ) .

Hence, on using (4.28), it follows that

u u h L u P x u L + P x u u h L
h x u W 1 , + h x 3 2 P x u u h L 2
h x u W 1 , + h x 3 2 u P x u L 2 + h x 3 2 u u h L 2
h x u W 1 , + h x k 1 2 u H k + 1 + h x 3 2 u u h L 2 .
Then the changes in (4.27) as follows:

| K 2 | C h k u u h L f k + 1 , Ω θ f 0 , T h + C h k + 1 ( u W 1 , f k + 1 , Ω + ( L + u L ) f k + 2 , Ω ) θ f 0 , T h C h k ( h u W 1 , + h k 1 2 u H k + 1 + h 3 2 u u h L 2 ) f k + 1 , Ω θ f 0 , T h + C h k + 1 ( u W 1 , f k + 1 , Ω + ( L + u L ) f k + 2 , Ω ) θ f 0 , T h C h k ( h u W 1 , + h k 1 2 u H k + 1 + h k 1 2 C ( K * ) ) f k + 1 , Ω θ f 0 , T h + C h k + 1 ( u W 1 , f k + 1 , Ω + ( L + u L ) f k + 2 , Ω ) θ f 0 , T h + C ( K * ) h k 3 2 θ f 0 , T h 2 C 1 ( K * ) h 4 k 1 + C 2 ( K * ) h k 3 2 θ f 0 , T h 2 + C h 2 k + 2 + C θ f 0 , T h 2 .

Note the term C 2 ( K * ) h k 3 2 θ f 0 , T h 2 is bounded by C 2 ( K * ) θ f 0 , T h 2 for k 2 , and the rest of the analysis follows as in Theorem 2. Hence the results of Theorem 2 hold for k 2 in 3D as well.

5 Numerical Experiments

This section deals with numerical experiments using the time splitting algorithm combined with the proposed dG methods for the following modified Vlasov–Stokes system:

(5.1) { t f + v x f + v ( ( u v ) f ) = F ( t , x , v ) in ( 0 , T ) × Ω x × Ω v , f ( 0 , x , v ) = f 0 ( x , v ) in Ω x × Ω v .
{ Δ x u + ρ u + x p = ρ V + G ( t , x ) in Ω x , x u = 0 in Ω x ,

We have used the splitting algorithm for the Vlasov equation (5.1). To achieve this, we use the Lie–Trotter splitting. Firstly, split equation (5.1) as

(5.2a) t f + v ( ( u v ) f ) = F ( t , x , v ) ,
(5.2b) t f + v x f = 0 .
We solve (5.2a) for the full time step using the given initial data f 0 to obtain a solution f * ; then (5.2b) is solved for the full time step using f * as the initial data to obtain a solution 𝑓.

For a complete discretization, let { t n } n = 0 N be a uniform partition of the time interval [ 0 , T ] and t n = n Δ t with time step Δ t > 0 . Let f h n Z h , u h n U h , p h n P h , ρ h n and ρ h n V h n denote the approximation of f n = f ( t n ) , u n = u ( t n ) , p n = p ( t n ) , ρ n = ρ ( t n ) and ρ n V n = ρ ( t n ) V ( t n ) , respectively. Find ( u h n + 1 , p h n + 1 , f h n + 1 ) U h × P h × Z h for n = 1 , , N such that

a h ( u h n + 1 , ϕ h ) + b h ( ϕ h , p h n + 1 ) + ( ρ h n u h n + 1 , ϕ h ) = ( ρ h n V h n + G n + 1 , ϕ h ) for all ϕ h U h ,
b h ( u h n + 1 , q h ) + s h ( p h n + 1 , q h ) = 0 for all q h P h ,
(5.3) ( f h * f h n Δ t , ψ h ) + B h x ( u h n + 1 ; f h n , ψ h ) = ( F n , ψ h ) for all ψ h Z h ,
(5.4) ( f h n + 1 f h * Δ t , Ψ h ) + B h v ( f h * , Ψ h ) = 0 for all Ψ h Z h ,
where a h ( u h n , ϕ h ) , b h ( ϕ h , p h n ) , s h ( p h n , q h ) are defined by (3.8)–(3.10) at t = t n . In (5.3) and (5.4), B h x ( u h n + 1 ; f h n , ψ h ) and B h v ( f h n , Ψ h ) are defined as

B h x ( u h n + 1 ; f h n , ψ h ) := R T h B h , R x ( u h n + 1 ; f h n , ψ h ) ,

with

B h , R x ( u h n + 1 ; f h n , ψ h ) := T x T v f h n ( u h n + 1 v ) . v ψ h d v d x + T x T v ( u h n + 1 v ) n f h n ̂ ψ h d s ( v ) d x

and

B h v ( f h n , Ψ h ) := R T h B h , R v ( f h n , Ψ h )

with

B h , R v ( f h n , Ψ h ) := T v T x f h n v . x Ψ h d x d v + T v T x v n f h n ̂ Ψ h d s ( x ) d v ,

wherein the numerical fluxes are defined by (3.7) at t = t n .

For our computation, let the nodes in T h x and T h v be x l and v m , where l = 1 , , N x , m = 1 , , N v , respectively. In the Z h space, every function can be represented as g = l , m g ( x l , v m ) L x l ( x ) L v m ( v ) on 𝑅, where L x l ( x ) and L v m ( v ) are the 𝑙-th and 𝑚-th Lagrangian interpolating polynomials in T x and T v , respectively.

Under this setting, we can solve the equations for 𝑓 in the split equations (5.2a), (5.2b) in the reduced dimensions. For example, in equation (5.2a), we fix a nodal point in 𝑥-direction, say x l , then solve

t f ( x l ) + v ( ( u ( x l ) v ) f ( x l ) ) = F ( t , x l , v )

in 𝑣-direction and obtain an update of point values of f ( x l , v m ) for all v m T h v . Similarly, for equation (5.2b), we fix a nodal point in 𝑣-direction, say v m , then solve t f ( v m ) + v m x f ( v m ) = 0 by a dG method in the 𝑥-direction and obtain an update of point values of f ( x l , v m ) for all x l T h x .

For the plots, we use the notations k x and k v for degree of polynomials in 𝑥 and 𝑣-variables, respectively. Let h x and h v be the mesh sizes for T h x and T h v , respectively. In the experiments, we choose h x = h v = h . The error f f h , u u h and p p h is calculated in L 2 ( Ω ) , L 2 and L 2 ( Ω x ) , respectively, at final time 𝑇 and denoted by errL2f, errL2u and errL2p, respectively.

Example 1

This is the first example for which we test the proposed scheme. Here, the exact solution of the problem is given by

f ( t , x , y , v 1 , v 2 ) = sin ( π ( x t ) ) sin ( π ( y t ) ) e ( v 1 2 v 2 2 ) ( 1 v 1 2 ) ( 1 v 2 2 ) ( 1 + v 1 ) ( 1 + v 2 ) , u 1 ( x , y ) = cos ( 2 π x ) sin ( 2 π y ) , u 2 ( x , y ) = sin ( 2 π x ) cos ( 2 π y ) , p ( x , y ) = 2 π ( cos ( 2 π y ) cos ( 2 π x ) ) .

Note that the initial data is

f ( 0 , x , y , v 1 , v 2 ) = sin ( π x ) sin ( π y ) e ( v 1 2 v 2 2 ) ( 1 v 1 2 ) ( 1 v 2 2 ) ( 1 + v 1 ) ( 1 + v 2 ) .

With this, we calculate 𝐹 and 𝐺.

We run the simulations for the domains Ω x = [ 0 , 1 ] 2 and Ω v = [ 1 , 1 ] 2 . The penalty parameter is chosen as 10, for k x = 1 , 1 and k v = 1 , 2 , the final time taken is 0.1, and for k x = k v = 2 , the final time is 0.01.

Figure 1 
               Convergence rate of the distribution function 𝑓, the velocity 𝒖 and the pressure 𝑝 for Example 1.
Figure 1 
               Convergence rate of the distribution function 𝑓, the velocity 𝒖 and the pressure 𝑝 for Example 1.
Figure 1

Convergence rate of the distribution function 𝑓, the velocity 𝒖 and the pressure 𝑝 for Example 1.

Example 2

With exact solutions of the problem given by

f ( t , x , y , v 1 , v 2 ) = cos ( t ) sin ( 2 π x ) sin ( 2 π y ) e ( v 1 2 v 2 2 ) ( 1 v 1 2 ) ( 1 v 2 2 ) ( 1 + v 1 ) ( 1 + v 2 ) , u 1 ( x , y ) = cos ( 2 π x ) sin ( 2 π y ) + sin ( 2 π y ) , u 2 ( x , y ) = sin ( 2 π x ) cos ( 2 π y ) sin ( 2 π x ) , p ( x , y ) = 2 π ( cos ( 2 π y ) cos ( 2 π x ) ) ,

we calculate the initial data

f ( 0 , x , y , v 1 , v 2 ) = sin ( 2 π x ) sin ( 2 π y ) e ( v 1 2 v 2 2 ) ( 1 v 1 2 ) ( 1 v 2 2 ) ( 1 + v 1 ) ( 1 + v 2 ) ,

and the functions 𝐹 and 𝐺.

We run the simulations for the domains Ω x = [ 0 , 1 ] 2 and Ω v = [ 1 , 1 ] 2 . The penalty parameter is chosen as 10, for k x = 1 , 1 and k v = 1 , 2 , the final time taken is 0.1, and for k x = k v = 2 , the final time is 0.01.

Figure 2 
               Convergence rate of the distribution function 𝑓, the velocity 𝒖 and the pressure 𝑝 for Example 2.
Figure 2 
               Convergence rate of the distribution function 𝑓, the velocity 𝒖 and the pressure 𝑝 for Example 2.
Figure 2

Convergence rate of the distribution function 𝑓, the velocity 𝒖 and the pressure 𝑝 for Example 2.

Observations

  • From Figure 1 (left) and Figure 2 (left), we observe that, by taking degree of polynomials, k x = 1 , k v = 1 and k x = 1 , k v = 2 . We obtain order of convergence for distribution function 𝑓 and fluid velocity 𝒖 is min ( k x , k v ) + 1 , which is 2; for pressure 𝑝, the order of convergence is min ( k x , k v ) , which is 1.

  • If we take the degree of polynomials k x = k v = 2 , then from Figure 1 (right) and Figure 2 (right), we can see the order of convergence for distribution function 𝑓 and fluid velocity 𝒖 is min ( k x , k v ) + 1 , which is 3; for fluid pressure 𝑝, the order of convergence is min ( k x , k v ) , which is 2.

  • Note that it is difficult to solve the Vlasov equation in [ 0 , 1 ] 2 × [ 1 , 1 ] 2 for each time 𝑡. But using splitting in time and with the help of a sequence of two-dimensional problems, we compute the solution for each time level t = t n .

6 Conclusion

This paper introduces the semi-discrete numerical method (3.2)–(3.11) using discontinuous Galerkin methods for the continuum problem, and the conservation properties are stated in Lemma 4. It is difficult to prove the non-negativity of the discrete density ρ h . Due to this, the proposed scheme is not coercive, and this creates a major problem in the error estimates which is handled by a smallness condition on ℎ. The optimal rate of convergence for polynomial degrees k 1 is proved in Theorem 3. Finally, using a splitting scheme, some numerical experiments are reported.

Funding statement: K. Kumar acknowledges the financial support of the University Grants Commission (UGC), Government of India.

Acknowledgements

K. Kumar and H. Hutridurga thank Laurent Desvillettes for introducing them to the fluid-kinetic equations modelling the thin sprays during the Junior Trimester Program on Kinetic Theory organized at the Hausdorff Research Institute for Mathematics, Bonn. K. Kumar and H. Hutridurga thank the Hausdorff Institute of Mathematics, Bonn, for hosting them during the Junior Trimester Program on Kinetic Theory (Summer of 2019) where this work was initiated. The authors acknowledge the valuable comments and suggestions given by two honourable referees which help to improve our manuscript.

References

[1] S. Agmon, Lectures on Elliptic Boundary Value Problems, American Mathematical Society, Providence, 2010. 10.1090/chel/369Search in Google Scholar

[2] C. Amrouche and V. Girault, On the existence and regularity of the solution of Stokes problem in arbitrary dimension, Proc. Japan Acad. Ser. A Math. Sci. 67 (1991), no. 5, 171–175. 10.3792/pjaa.67.171Search in Google Scholar

[3] D. N. Arnold, An interior penalty finite element method with discontinuous elements, SIAM J. Numer. Anal. 19 (1982), no. 4, 742–760. 10.1137/0719052Search in Google Scholar

[4] D. N. Arnold, F. Brezzi, B. Cockburn and L. D. Marini, Unified analysis of discontinuous Galerkin methods for elliptic problems, SIAM J. Numer. Anal. 39 (2001/02), no. 5, 1749–1779. 10.1137/S0036142901384162Search in Google Scholar

[5] B. Ayuso, J. A. Carrillo and C.-W. Shu, Discontinuous Galerkin methods for the one-dimensional Vlasov–Poisson system, Kinet. Relat. Models 4 (2011), no. 4, 955–989. 10.3934/krm.2011.4.955Search in Google Scholar

[6] C. Baranger, L. Boudin, P.-E. Jabin and S. Mancini, A modeling of biospray for the upper airways, CEMRACS 2004—Mathematics and Applications to Biology and Medicine, ESAIM Proc. 14, EDP Sciences, Les Ulis (2005), 41–47. 10.1051/proc:2005004Search in Google Scholar

[7] F. Brezzi, L. D. Marini and E. Süli, Discontinuous Galerkin methods for first-order hyperbolic problems, Math. Models Methods Appl. Sci. 14 (2004), no. 12, 1893–1903. 10.1142/S0218202504003866Search in Google Scholar

[8] P. G. Ciarlet, The Finite Element Method for Elliptic Problems, Classics Appl. Math. 40, Society for Industrial and Applied Mathematics, Philadelphia, 2002. 10.1137/1.9780898719208Search in Google Scholar

[9] B. Cockburn, G. Kanschat, I. Perugia and D. Schötzau, Superconvergence of the local discontinuous Galerkin method for elliptic problems on Cartesian grids, SIAM J. Numer. Anal. 39 (2001), no. 1, 264–285. 10.1137/S0036142900371544Search in Google Scholar

[10] M. Crouzeix and V. Thomée, The stability in L p and W p 1 of the L 2 -projection onto finite element function spaces, Math. Comp. 48 (1987), no. 178, 521–532. 10.1090/S0025-5718-1987-0878688-2Search in Google Scholar

[11] B. A. de Dios, J. A. Carrillo and C.-W. Shu, Discontinuous Galerkin methods for the multi-dimensional Vlasov–Poisson problem, Math. Models Methods Appl. Sci. 22 (2012), no. 12, Article ID 1250042. 10.1142/S021820251250042XSearch in Google Scholar

[12] D. A. Di Pietro and A. Ern, Mathematical Aspects of Discontinuous Galerkin Methods, Math. Appl. (Berlin) 69, Springer, Heidelberg, 2012. 10.1007/978-3-642-22980-0Search in Google Scholar

[13] I. Gasser, P.-E. Jabin and B. Perthame, Regularity and propagation of moments in some nonlinear Vlasov systems, Proc. Roy. Soc. Edinburgh Sect. A 130 (2000), no. 6, 1259–1273. 10.1017/S0308210500000676Search in Google Scholar

[14] T. Gemci, T. E. Corcoran and N. Chigier, A numerical and experimental study of spray dynamics in a simple throat model, Aerosol Sci. Technol. 36 (2002), no. 1, 18–38. 10.1080/027868202753339050Search in Google Scholar

[15] Y. Giga and H. Sohr, Abstract L p estimates for the Cauchy problem with applications to the Navier–Stokes equations in exterior domains, J. Funct. Anal. 102 (1991), no. 1, 72–94. 10.1016/0022-1236(91)90136-SSearch in Google Scholar

[16] T. Goudon, S. Jin, J.-G. Liu and B. Yan, Asymptotic-preserving schemes for kinetic-fluid modeling of disperse two-phase flows, J. Comput. Phys. 246 (2013), 145–164. 10.1016/j.jcp.2013.03.038Search in Google Scholar

[17] T. Goudon, S. Jin, J.-G. Liu and B. Yan, Asymptotic-preserving schemes for kinetic-fluid modeling of disperse two-phase flows with variable fluid density, Internat. J. Numer. Methods Fluids 75 (2014), no. 2, 81–102. 10.1002/fld.3885Search in Google Scholar

[18] K. Hamdache, Global existence and large time behaviour of solutions for the Vlasov–Stokes equations, Jpn. J. Ind. Appl. Math. 15 (1998), no. 1, 51–74. 10.1007/BF03167396Search in Google Scholar

[19] D. Han-Kwan, E. Miot, A. Moussa and I. Moyano, Uniqueness of the solution to the 2D Vlasov–Navier–Stokes system, Rev. Mat. Iberoam. 36 (2020), no. 1, 37–60. 10.4171/rmi/1120Search in Google Scholar

[20] R. M. Höfer, The inertialess limit of particle sedimentation modeled by the Vlasov–Stokes equations, SIAM J. Math. Anal. 50 (2018), no. 5, 5446–5476. 10.1137/18M1165554Search in Google Scholar

[21] H. Hutridurga, K. Kumar and A. K. Pani, Discontinuous Galerkin methods with generalized numerical fluxes for the Vlasov-viscous Burgers’ system, J. Sci. Comput. 96 (2023), no. 1, Paper No. 7. 10.1007/s10915-023-02230-5Search in Google Scholar

[22] H. Hutridurga, K. Kumar and A. K. Pani, Periodic Vlasov–Stokes’ system: Existence and uniqueness of strong solutions, preprint (2023), https://arxiv.org/abs/2305.19576. Search in Google Scholar

[23] P.-E. Jabin and B. Perthame, Notes on mathematical problems on the dynamics of dispersed particles interacting through a fluid, Modeling in Applied Sciences, Model. Simul. Sci. Eng. Technol., Birkhäuser, Boston (2000), 111–147. 10.1007/978-1-4612-0513-5_4Search in Google Scholar

[24] O. A. Ladyzhenskaya, The Mathematical Theory of Viscous Incompressible Flow, Math. Appl. 2, Gordon and Breach Science, New York, 1969. Search in Google Scholar

[25] P. Lesaint and P.-A. Raviart, On a finite element method for solving the neutron transport equation, Publ. Mat. Inform. de Rennes S4 (1974), 1–40. Search in Google Scholar

[26] D. Schötzau and C. Schwab, Time discretization of parabolic problems by the h p -version of the discontinuous Galerkin finite element method, SIAM J. Numer. Anal. 38 (2000), no. 3, 837–875. 10.1137/S0036142999352394Search in Google Scholar

[27] V. Thomée, Galerkin Finite Element Method for Parabolic Equations, Springer Ser. Comput. Math. 25, Springer, Berlin, 2007. Search in Google Scholar

[28] K. Vemaganti, Discontinuous Galerkin methods for periodic boundary value problems, Numer. Methods Partial Differential Equations 23 (2007), no. 3, 587–596. 10.1002/num.20191Search in Google Scholar

[29] L. B. Wahlbin, Superconvergence in Galerkin Finite Element Methods, Lecture Notes in Math. 1605, Springer, Berlin, 2006. Search in Google Scholar

Received: 2023-10-28
Revised: 2023-10-29
Accepted: 2024-01-10
Published Online: 2024-01-30
Published in Print: 2025-01-01

© 2024 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 12.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/cmam-2023-0243/html
Scroll to top button