Next Article in Journal
Asymptotic and Finite-Time Synchronization of Fractional-Order Memristor-Based Inertial Neural Networks with Time-Varying Delay
Next Article in Special Issue
The Construction of High-Order Robust Theta Methods with Applications in Subdiffusion Models
Previous Article in Journal
Novel Fractional Swarming with Key Term Separation for Input Nonlinear Control Autoregressive Systems
Previous Article in Special Issue
Supervised Neural Network Procedures for the Novel Fractional Food Supply Model
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Local Discontinuous Galerkin Method Coupled with Nonuniform Time Discretizations for Solving the Time-Fractional Allen-Cahn Equation

1
School of Mathematical Sciences, Jiangsu University, Zhenjiang 212013, China
2
School of Sciences, Lanzhou University of Technology, Lanzhou 730050, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2022, 6(7), 349; https://doi.org/10.3390/fractalfract6070349
Submission received: 28 May 2022 / Revised: 15 June 2022 / Accepted: 20 June 2022 / Published: 22 June 2022

Abstract

:
This paper aims to numerically study the time-fractional Allen-Cahn equation, where the time-fractional derivative is in the sense of Caputo with order α ( 0 , 1 ) . Considering the weak singularity of the solution u ( x , t ) at the starting time, i.e., its first and/or second derivatives with respect to time blowing-up as t 0 + albeit the function itself being right continuous at t = 0 , two well-known difference formulas, including the nonuniform L1 formula and the nonuniform L2- 1 σ formula, which are used to approximate the Caputo time-fractional derivative, respectively, and the local discontinuous Galerkin (LDG) method is applied to discretize the spatial derivative. With the help of discrete fractional Gronwall-type inequalities, the stability and optimal error estimates of the fully discrete numerical schemes are demonstrated. Numerical experiments are presented to validate the theoretical results.

1. Introduction

The classical Allen-Cahn equation, originally proposed by Allen and Cahn [1] to describe the motion of antiphase boundaries in crystalline solids, has subsequently been used in a wide variety of problems such as vesicle membranes, nucleation of solids, and a mixture of two incompressible fluids [2]. It has become a fundamental model equation for diffusion interface methods in materials science to study phase transitions and interface dynamics [3]. Since the Allen-Cahn equation is a nonlinear equation and it is not easy to obtain its analytical solution, various numerical methods have been proposed to solve it, for example, finite difference methods [4], finite element methods [5], local discontinuous Galerkin (LDG) methods [6], and so on. Most of these studies focused on integer-order phase-field models, implicitly assuming that the motion of the underlying particles is normal diffusion and that the spatial interactions between them are local. However, in the original formulation of the physical model [7], nonlocal interactions were part of the phase-field model, and thus in the following decades, the phase-field model was approximated by the local model by assuming slow spatial variations. Meanwhile, it has been reported that the presence of nonlocal operators in time [8] or space [9] in the phase-field model may significantly change the diffusion dynamics.
In this paper, we consider the LDG method for the following time-fractional Allen-Cahn equation
C D 0 , t α u ε 2 Δ u = F ( u ) = : f ( u ) , x Ω , 0 < t T , u ( x , 0 ) = u 0 ( x ) , x Ω ¯ u ( x , t ) = 0 , x Ω , 0 < t T ,
where ε is an interface width parameter and Ω = ( 1 , 1 ) d is a bounded domain of R d with d = 1 , 2 . The operator C D 0 , t α denotes the Caputo-type fractional derivative of order α ( 0 , 1 ) in time, which is a typical example of nonlocal operators and defined as [10]
C D 0 , t α u ( x , t ) = 1 Γ ( 1 α ) 0 t ( t s ) α u s d s .
The nonlinear term F ( u ) is the interficial (or potential) energy. To facilitate the mathematical and numerical analysis of phase-field model, the following Ginzburg-Landau double-well potential has often been used [11,12]
F ( u ) = 1 4 ( 1 u 2 ) 2 .
This is a relatively simple phenomenological double-well potential that is commonly used in physical and geometrical applications. It was first shown in [13] that the time-fractional Allen-Cahn equation satisfies the following energy law
E ( u ( t ) ) E ( u 0 ) ,
where E ( u ( t ) ) is the total energy defined by
E ( u ) : = Ω ε 2 2 | u | 2 + F ( u ) d x .
For the time-fractional Allen-Cahn Equation (1), several numerical studies have been done. In [8], Liu et al. proposed an efficient finite-difference scheme and a Fourier spectral scheme for the time-fractional Allen-Cahn and Cahn-Hilliard phase-field equations, but there was no stability analysis or error estimate in this paper. In [13], Tang et al. proposed a class of finite difference schemes for the time-fractional phase-field equation. They also proved for the first time that the fractional phase-field model does admit an integral-type energy dissipation law. In [14], Liu et al. considered a fast algorithm based on a two-mesh finite element format for numerically solving the nonlinear spatial-fractional Allen-Cahn equation with smooth and nonsmooth solutions. In [11], Du et al. first studied the well-posedness and regularity of the time-fractional Allen-Cahn equation, and then developed several unconditionally solvable and stable numerical schemes to solve it. In [15], Huang and Stynes presented a numerical scheme to solve the time-fractional Allen-Cahn equation, which is based on the Galerkin finite element method in space and the nonuniform L1 formula in time. In [16], Hou et al. constructed a first-order scheme and a ( 2 α ) th-order scheme for the time-fractional Allen-Cahn equation. In [17], Jiang et al. considered the Legendre spectral method for the time-fractional Allen-Cahn equation. In a series of works [18,19,20], Liao et al. proposed several efficient finite difference schemes to solve the time-fractional phase-field type models.
The LDG method is a special class of discontinuous Galerkin (DG) methods, introduced first by Cockburn and Shu [21]. This type of method not only inherits the advantages of DG methods, but it can easily handle meshes with hanging nodes, cells of general shape, and different types of local spaces, so it is flexible for h p -adaptivity [22,23]. In addition, the LDG scheme is locally solvable, i.e., the auxiliary variables of the derivatives of the approximate solution can be eliminated locally. Therefore, we would like to extend the LDG method to the numerical calculation of the time-fractional Allen-Cahn Equation (1) and further enrich the numerical methods for solving such an equation. Specifically, we construct two fully discrete numerical schemes for problem (1). For the first scheme, we utilize the nonuniform L1 formula to compute the time-fractional derivative and apply the LDG method to approximate the spatial derivative. With the aid of the discrete fractional Gronwall inequality, we show that the constructed scheme is numerically stable and the optimal error estimate is proved detailedly (i.e., ( 2 α ) th-order accurate in time and ( k + 1 ) th-order accurate in space when piecewise polynomials of up to k are used). If the solution of Equation (1) has better regularity in the time direction, we approximate the time-fractional derivative by the nonuniform L2- 1 σ formula and still use the LDG method to approach the spatial derivative. The stability and convergence analysis of the scheme are also carefully investigated, and it is proved that this scheme can achieve second-order accuracy in the time direction.
The rest of the paper is organized as follows. In Section 2, we will introduce some necessary notations, projections, and corresponding interpolation properties. In Section 3 and Section 4, we consider the LDG method for the time-fractional Allen-Cahn Equation (1). The stability and optimal convergence results are obtained. In Section 5, we perform some numerical experiments to verify the theoretical statements. A brief concluding remark is given in Section 6.

2. Preliminaries

Let us start by presenting some notations for the mesh, function space, and norm. We also present some projections and certain corresponding interpolation properties for the finite element spaces which will be used for the convergence analysis.

2.1. Finite Element Space and Notations

Let T h be a shape-regular subdivision of Ω with elements K, Γ denotes the union of the boundary of elements K T h , i.e., Γ = K T h K . Let e be a face shared by the “left” and “right” elements K L and K R . Define the normal vectors ν L and ν R on e pointing exterior to K L and K R , respectively. If φ is a function on K L and K R , but possibly discontinuous across e, let φ L denote ( φ | K L ) | e and φ R denote ( φ | K R ) | e , the left and right trace, respectively. The associated finite element space is defined as
V h = v L 2 ( Ω ) : v | K Q k ( K ) , K T h , Σ h = q = ( q 1 , , q d ) T | K ( L 2 ( Ω ) ) d : q l | K Q k ( K ) , l = 1 , , d , K T h ,
where Q k ( K ) denotes the space of polynomials of degrees at most k 0 defined on K. In particular, for one-dimensional case, we have Q k ( K ) = P k ( K ) .
We define the inner product over the element K by
( u , v ) K = K u v d K , u , v K = K u v d s , ( p , q ) K = K p · q d K , p , q K = K p · q d s ,
for scalar variables u, v and vector variables p , q respectively. The inner products on Ω are defined as
( u , v ) Ω = K ( u , v ) K , ( p , q ) Ω = K ( p , q ) K .
Furthermore, the L 2 norm on the domain Ω and the boundary Γ are given by
u Ω 2 = ( u , u ) Ω , u Γ 2 = u , u Γ ,
p Ω 2 = ( p , p ) Ω , p Γ 2 = p , p Γ .
For any nonnegative integer m, H m ( Ω ) denotes the standard Sobolev space with its associated norm · m , Ω and seminorm | · | m , Ω .

2.2. Projections and Interpolation Properties

In this subsection, we follow [24] to define the projections in one- and two-dimensional space, respectively.
One-dimensional case. Assume that the mesh consisting of cells K j = ( x j 1 2 , x j + 1 2 ) , for 1 j N , where 1 = x 1 2 < x 3 2 < < x N + 1 2 = 1 , covers Ω ¯ = [ 1 , 1 ] . Denote x j = ( x j 1 2 + x j + 1 2 ) / 2 , h j = x j + 1 2 x j 1 2 , and h = max 1 j N h j . We assume T h is quasi-uniform mesh in this case; namely, there exists a fixed positive constant ν independent of h such that ν h h j h for j = 1 , , N , as h goes to zero. We introduce the standard L 2 projection of a function u L 2 ( Ω ) into the finite element space V h , denoted by P h u , which is a unique function in V h satisfying
K j P h u u v h d x = 0 , v h P k ( K j ) , j = 1 , , N .
For any given function u H 1 ( Ω ) and an arbitrary element K j , the special Gauss-Radau projection of u, denoted by P h ± u , is the unique function in V h satisfying, for each j,
K j P h + u u v h d x = 0 , v h P k 1 ( K j ) , ( P h + u ) j 1 2 + = u ( x j 1 2 + ) ,
K j P h u u v h d x = 0 , v h P k 1 ( K j ) , ( P h u ) j + 1 2 = u ( x j + 1 2 ) .
Two-dimensional case. Let T h = { K i j } i = 1 , , N x j = 1 , , N y denote a subdivision of Ω = ( 1 , 1 ) 2 with rectangular element K i j = I i × J j , where I i = ( x i 1 / 2 x i + 1 / 2 ) and J j = ( y j 1 / 2 , y j + 1 / 2 ) , with the length h i x = x i + 1 / 2 x i 1 / 2 and width h j y = y j + 1 / 2 y j 1 / 2 . Let h i j = max { h i x , h j y } and denote h = max K i j T h h i j . We also assume T h is quasi-uniform in this case; namely, there exists a fixed positive constant ν independent of h such that ν h min { h i x , h j y } h for i = 1 , , N x and j = 1 , , N y . Similar to the one-dimensional case, we need to introduce a suitable projection P h ± . The projection for the scalar function is defined as
P h = P h , x × P h , y ,
where the subscripts x and y indicate that the one-dimensional projection P h defined by (5) is applied with respect to the corresponding variable.
Let P h , x and P h , y be the standard L 2 projections in the x and y directions, respectively. The projection Π h + for vector-valued function q = q 1 ( x , y ) , q 2 ( x , y ) [ H 1 ( Ω ) ] 2 is defined by
Π h + q = P h , x + × P h , y : [ H 1 ( Ω ) ] 2 [ Q k ( I i × J j ) ] 2 ,
which satisfies
I i J j Π h + q q · w d x d y , w Q k ( I i × J j ) , J j Π h + q ( x i 1 / 2 , y ) q ( x i 1 / 2 , y ) · n w ( x i 1 / 2 + , y ) d y = 0 , w Q k ( I i × J j ) , I i Π h + q ( x , y j 1 / 2 ) q ( x , y j 1 / 2 ) · n w ( x , y j 1 / 2 + ) d x = 0 , w Q k ( I i × J j ) ,
where n is the outward unit normal vector of the domain integrated.
Interpolation properties. The projections defined above have the following approximation properties. If u H k + 1 ( Ω ) , we have (see Lemma 2.4 in [25])
P h ± u u Ω C h k + 1 u H k + 1 ( Ω ) ,
Π h + q q Ω C h k + 1 q H k + 1 ( Ω ) .
The projection P h on the Cartesian meshes has the following superconvergence property (see Lemma 3.7 in [25]).
Lemma 1.
Assume u H k + 2 ( Ω ) , q Σ h , then the projection defined by (6) satisfies
( u P h u , · q ) Ω ( u P h u ^ , q · n ) Γ C h k + 1 u H k + 2 ( Ω ) q Ω ,
where the “hat" term is the numerical flux.

3. Nonuniform L1–LDG Scheme

In this section, Equation (1) is first transformed into a first-order system of differential equations. Then the L1 method on nonuniform meshes is applied to the time-fractional derivative and the spatial derivative is approximated by the LDG method, and a fully discrete numerical scheme is obtained. The stability analysis and error estimate of the scheme is given by choosing suitable numerical fluxes.

3.1. The Fully Discrete Numerical Scheme and Its Stability Analysis

The usual notations of the nonuniform L1 formula are introduced here. Let M be a positive integer. Set t n = T ( n / M ) r for n = 0 , 1 , , M , where the temporal mesh grading parameter r 1 is chosen by the user. Denote τ n = t n t n 1 , n = 1 , , M be the time mesh sizes. It is easy to see that when r = 1 , the mesh is uniform.
For n 1 , we approximate the Caputo fractional derivative C D 0 , t α u ( x , t n ) by the well-known L1 formula [26]
C D 0 , t α u ( x , t n ) Υ t α u ( x , t n ) : = d n , 1 Γ ( 2 α ) u n d n , n Γ ( 2 α ) u 0 + 1 Γ ( 2 α ) i = 1 n 1 u n i ( d n , i + 1 d n , i ) ,
where d n , i = [ ( t n t n i ) 1 α ( t n t n i + 1 ) 1 α ] / τ n i + 1 for i = 1 , , n . For simplicity, if there is no confusion, we denote u n = u ( x , t n ) .
Set a n k ( n ) = d n , n k + 1 / Γ ( 2 α ) for k = 1 , , n and
P n k ( n ) = 1 a 0 ( k ) 1 , k = n , j = k + 1 n ( a j k 1 ( j ) a j k ( j ) ) P n j ( n ) , 1 k n 1 .
Therefore, the approximate scheme (10) can be written as Υ t α u n = i = 1 n a n i ( n ) ( u i u i 1 ) for n = 1 , , M . It follows from Lemma 2.1 in the literature [27] that the coefficient coefficients { P n k ( n ) } satisfies
k = 1 n P n k ( n ) ( t n ) α / Γ ( 1 + α ) .
Denote the truncation error R 1 n as
R 1 n = C D 0 , t α u ( x , t n ) Υ t α u ( x , t n ) .
Lemma 2
([26]). Assume that l u ( x , t ) / t l Ω C t l α for l = 0 , 1 , 2 . Then the following identity holds
R 1 n Ω C n min { 2 α , r α } .
Lemma 3
([27]). Assume that u ( x , · ) C 2 ( ( 0 , T ] ) and l u ( x , t ) / t l Ω C t l α for l = 0 , 1 , 2 . Then the following identity holds
j = 1 n P n j ( n ) | R 1 j | C α 1 T α M r α + r 2 1 α 4 r 1 T α M min { r α , 2 α } , n 1 .
As the usual treatment, we would like to introduce the auxiliary variable p = u and consider the equivalent first-order system
C D 0 , t α u ϵ 2 · p f ( u ) = 0 ,
p u = 0 .
Then the weak formulation of (13) at t n can be written as
( C D 0 , t α u n , v ) K + ϵ 2 ( p n , v ) K ϵ 2 p n · n , v K ( f ( u n ) , v ) K = 0 ,
( p n , w ) K + ( u n , · w ) K u n , w · n K = 0 ,
where v, w are test functions.
Let ( U h n , P h n ) ( V h , Σ h ) be the approximation of u n and p n , respectively. Based on (14), a fully discrete nonuniform L1–LDG method is: find ( U h n , P h n ) ( V h , Σ h ) such that for all test functions ( v h , w h ) ( V h , Σ h ) ,
( Υ t α U h n , v h ) K + ϵ 2 ( P h n , v h ) K ϵ 2 P h n ^ · n , v h K ( f ( U h n ) , v h ) K = 0 ,
( P h n , w h ) K + ( U h n , · w h ) K U h n ^ , w h · n K = 0 .
All the “hat” terms are numerical fluxes which are yet to be determined. The freedom in choosing numerical fluxes can be utilized for designing a scheme that enjoys a certain stability property. Here alternative flux is chosen
U h n ^ | e = U h , L n , P h n ^ | e = P h , R n ,
or
U h n ^ | e = U h , R n , P h n ^ | e = P h , L n .
Summing Equation (15) over all elements yields
( Υ t α U h n , v h ) Ω + ϵ 2 ( P h n , v h ) Ω ϵ 2 P h n ^ · n , v h Γ ( f ( U h n ) , v h ) Ω = 0 ,
( P h n , w h ) Ω + ( U h n , · w h ) Ω U h n ^ , w h · n Γ = 0 .
Next, we study the stability of scheme (18) using the numerical flux (16). The case of choosing numerical flux (17) is almost the same, so is omitted here. Firstly, we state a discrete fractional Gronwall inequality and a property of the nonuniform L1 scheme.
Lemma 4
([28]). For any finite time t M = T > 0 and a given nonnegative sequence ( λ l ) l = 0 M 1 , assume that there exists a constant λ, independent of time-steps, such that λ l = 0 M 1 λ l . Suppose that the grid function { u n | n 0 } satisfies
Υ t α ( u n ) 2 l = 1 n λ n l ( u l ) 2 + ϕ n u n + ( ψ n ) 2 , 1 n M ,
where { ϕ n , ψ n | 1 n M } are nonnegative sequences. If the maximum time-step τ M ( 2 Γ ( 2 α ) λ ) 1 α , it holds that, for 1 n M ,
u n 2 E α , 1 ( 2 λ t n α ) u 0 + max 1 k n j = 1 k P k j ( k ) ϕ j + Γ ( 1 α ) max 1 k n { t k α / 2 ψ k } .
Lemma 5
([29]). Let the functions u n = u ( x , t n ) be in L 2 ( Ω ) for n = 0 , 1 , , M . Then, one has the following inequality
( Υ t α u n , u n ) Ω 1 2 Υ t α u n Ω 2 .
Theorem 1.
The solution U h n of the fully discrete nonuniform L1–LDG scheme (18) satisfies
U h n Ω 2 E α , 1 ( 4 t n α ) U h 0 Ω , n = 1 , , M .
Proof. 
Taking the test functions in scheme (18) as v h = U h n and w h = ϵ 2 P h n , we obtain
( Υ t α U h n , U h n ) Ω + ϵ 2 ( P h n , U h n ) Ω ϵ 2 P h n ^ · n , U h n Γ + ( U h n ) 3 U h n , U h n Ω = 0 ,
ϵ 2 ( P h n , P h n ) Ω + ϵ 2 ( U h n , · P h n ) Ω ϵ 2 U h n ^ , P h n · n Γ = 0 .
Adding the two equations in (21) and using (16), we have that
( Υ t α U h n , U h n ) Ω + ϵ 2 P h n Ω 2 + ( U h n ) 2 Ω 2 = U h n Ω 2 ,
which indicates that
( Υ t α U h n , U h n ) Ω U h n Ω 2 .
Invoking Lemma 5, we derive that
Υ t α U h n Ω 2 2 U h n Ω 2 .
Therefore, applying Lemma 4 with u n = U h n Ω , ϕ n = ψ n = 0 , λ 0 = 2 , and λ j = 0 for 1 j M 1 , we have
U h n Ω 2 E α , 1 ( 4 t n α ) U h 0 Ω .
It completes the proof. □
Remark 1.
(i)
We point out that the stability analysis in Theorem 1 can be further improved by mathematical induction. Following the discussions given in (Theorem 4.4 in [30]), we deduce that
U h n Ω U h 0 Ω .
(ii)
It could be interesting to check the energy stability (i.e., E ( U h n ) E ( U h 0 ) for all n 1 , where E ( U h n ) = Ω ϵ 2 2 | P h n | 2 + F ( U h n ) d x ) of the fully discrete numerical scheme (18), although we cannot give the theoretical analysis at present. As seen in [19], the main difficulty is to prove the positive semi-definite of the quadratic form ( Υ t α U h n , U h n U h n 1 ) Ω . In fact, with the help of Lemma 3.1 in [13], we can show the energy stability for the uniform case (i.e., the L1 formula on uniform meshes for the time-fractional derivative and the LDG method for the space approximation).
(iii)
The stability mentioned in Theorem 1 is about the initial value, so we can regard this stability as a priori stability.

3.2. Optimal Error Estimate

Suppose the exact solution u ( x , t ) of Equation (1) has the following smoothness properties:
u L ( 0 , T ] ; H k + 2 ( Ω ) , l u ( x , t ) / t l C ( 1 + t α l ) for 0 < t T and l = 0 , 1 , 2 .
Such a regularity assumption with respect to time t is often used, see for instance [15,19,30,31,32,33,34,35,36,37,38,39]. It implies that the solution u ( x , t ) likely behaves a weak singularity at the starting time t = 0 , i.e., | u ( x , t ) / t | and /or | 2 u ( x , t ) / t 2 | blow up as t 0 + albeit u ( x , t ) is continuous on [ 0 , T ] . Since it has been shown in [13] that the time-fractional Allen-Cahn Equation (1) satisfies the maximum principle, namely,
| u ( x , t ) | 1 for t > 0 if | u ( x , 0 ) | 1 ,
we assume that the nonlinear term f ( u ) satisfies
max | f ( u ) | L ,
where L is a positive constant. For simplicity, we denote
e u n = u n U h n = u n P u n + P u n U h n = u n P u n + P e u n ,
e p n = p n P h n = p n Π p n + Π p n P h n = p n Π p n + Π e p n .
We choose the projection as follows
( P , Π ) = ( P h , P h + ) in one dimension , ( P , Π ) = ( P h , Π h + ) in two-dimensions ,
which are defined in Section 2.2.
Subtracting (18) from (14), we have the error equation
( C D 0 , t α u n Υ t α U h n , v h ) Ω + ϵ 2 ( p n P h n , v h ) Ω ϵ 2 ( p n P h n ^ ) · n , v h Γ ( f ( u n ) f ( U h n ) , v h ) Ω = 0 ,
( p n P h n , w h ) Ω + ( u n U h n , · w h ) Ω ( u n U h n ^ ) , w h · n Γ = 0 .
Now we show the error estimate for Equation (29).
Theorem 2.
Let u n be the exact solution of Equation (1) which satisfies the smoothness assumption (25), and U h n be the numerical solution of the nonuniform L1–LDG scheme (18). If f ( u ) satisfies the condition (26), then for n = 1 , 2 , , M , the following estimate holds
u n U h n Ω C M min { 2 α , r α } + h k + 1 ,
where C is a positive constant independent of M and h.
Proof. 
By taking the test functions v h = P e u n and w h = ϵ 2 Π e p n in (29) and applying (27), we arrive at
( Υ t α P e u n , P e u n ) Ω + ϵ 2 ( Π e p n , Π e p n ) Ω f ( u n ) f ( U h n ) , P e u n Ω = R H S ,
where R 1 n = C D 0 , t α u ( x , t n ) Υ t α u ( x , t n ) and
R H S = Υ t α ( u n P u n ) , P e u n Ω ( R 1 n , P e u n ) Ω ϵ 2 ( p n Π p n , P e u n ) Ω + ϵ 2 ( p n Π p n ^ ) · n , P e u n Γ ϵ 2 ( p n Π p n , Π e p n ) Ω ϵ 2 ( u n P u n , · Π e p n ) Ω + ϵ 2 ( u n P u n ^ ) , Π e p n · n Γ ϵ 2 ( Π e p n , P e u n ) Ω + ϵ 2 Π e p n ^ · n , P e u n Γ ϵ 2 ( P e u n , · Π e p n ) Ω + ϵ 2 P e u n ^ , Π e p n · n Γ .
Making use of flux (16) and the property of projections, it is obvious to see that
R H S = Υ t α ( u n P u n ) , P e u n Ω ( R 1 n , P e u n ) Ω ϵ 2 ( p n Π p n , Π e p n ) Ω ϵ 2 ( u n P u n , · Π e p n ) Ω + ϵ 2 ( u n P u n ^ ) , Π e p n · n Γ .
By using Cauchy-Schwarz inequality and Lemma 1, R H S can be estimated as follows
| R H S | = Υ t α ( u n P u n ) Ω P e u n Ω + R 1 n Ω P e u n Ω + ϵ 2 p n Π p n Ω Π e p n Ω + C h k + 1 Π e p n Ω C h k + 1 P e u n Ω + Π e p n Ω + R 1 n Ω P e u n Ω ,
where C is a positive constant dependent on u L ( ( 0 , T ] ; H k + 2 ( Ω ) ) .
Now we estimate the nonlinear term in (31). It is obvious to see that
( f ( U h n ) f ( u n ) , P e u n ) Ω = ( f ( P u n ) f ( u n ) , P e u n ) Ω ( f ( P u n ) f ( U h n ) , P e u n ) Ω = f ( ξ ) ( P u n u n ) , P e u n Ω ( f ( P u n ) f ( U h n ) , P e u n ) Ω = I + I I ,
where ξ = θ u n + ( 1 θ ) P u n with 0 θ 1 . Then, using the Cauchy-Schwarz inequality, Young’s inequality, interpolation property (8), and (26), we can derive
| I | f L ( Ω ) | P u n u n , P e u n Ω | C P e u n Ω 2 + C h 2 k + 2 .
It follows from the definition of f ( u ) (i.e., f ( u ) = u u 3 ) that
f ( u ) f ( v ) = f ( u ) ( u v ) ( u v ) 3 + 3 u ( u v ) 2 .
Therefore, I I can be rewritten as
I I = f ( P u n ) f ( U h n ) , P e u n Ω = f ( P u n ) ( P u n U h n ) ( P u n U h n ) 3 + 3 P u n ( P u n U h n ) 2 , P e u n Ω = f ( P u n ) P e u n ( P e u n ) 3 + 3 P u n ( P e u n ) 2 , P e u n Ω = ( P e u n ) 3 , P e u n Ω f ( P u n ) P e u n + 3 P u n ( P e u n ) 2 , P e u n Ω .
From (26) and the Cauchy-Schwarz inequality, it is obvious to see that
( f ( P u n ) P e u n + 3 P u n ( P e u n ) 2 , P e u n ) Ω C P e u n Ω 2 + ( P e u n ) 2 Ω 2 .
Combining Equations (31), (34), (36), (38) and (39), we have
( Υ t α P e u n , P e u n ) Ω + Π e p n Ω 2 + ( P e u n ) 2 Ω 2 C h k + 1 P e u n Ω + Π e p n Ω + R 1 n Ω P e u n Ω + C h k + 1 Π e p n Ω + C P e u n Ω 2 + ( P e u n ) 2 Ω 2 + C h 2 k + 2 C P e u n Ω 2 + Π e p n Ω 2 + ( P e u n ) 2 Ω 2 + C h 2 k + 2 + R 1 n Ω P e u n Ω .
Invoking Lemma 5, one has
Υ t α P e u n Ω 2 2 C P e u n Ω 2 + 2 C h 2 k + 2 + 2 R 1 n Ω P e u n Ω .
Letting λ 0 = 2 C , λ j = 0 for 1 j M 1 , u n = P e u n Ω , ϕ n = 2 R 1 n Ω , and ψ n = 2 C h k + 1 in Lemma 4, we can obtain from (41) that
P e u n Ω 2 E α , 1 ( 4 C t n α ) 2 max 1 k n j = 1 k P k j ( k ) R 1 j Ω + 2 C Γ ( 1 α ) max 1 k n { t k α / 2 h k + 1 } ,
provided that the maximum time-step τ M 4 C Γ ( 2 α ) 1 / α . With the help of Lemma 3 and inequality (11), we have
P e u n Ω C M min { r α , 2 α } + h k + 1 .
By using the interpolation property (8) and the triangle inequality, the desired estimate follows immediately. □
As a conclusion of this section, we present the Algorithm 1 based on the nonuniform L1–LDG scheme (15).
Algorithm 1 The nonuniform L1–LDG scheme for solving the time-fractional Allen-Cahn equation.
Input: the order of time-fractional derivative α , interface width parameter ϵ , temporal mesh grading parameter r.
Output: nodal values of numerical solution U h n at t n .
1: Construct a shape-regular subdivision T h of Ω with N x × N y elements and define basis functions { φ K i } i = 1 l .
2: Give the global number and coordinates of nodes.
3: for K T h do
4:   Compute the l × l mass and convection matrices A 1 ( K ) , A 2 ( K ) , and A 3 ( K ) on K with components
( A 1 ( K ) ) i j = ( φ K j , φ K i ) , ( A 2 ( K ) ) i j = ( φ K j , ( φ K i ) x ) , ( A 3 ( K ) ) i j = ( φ K j , ( φ K i ) y ) .
Combine the boundary conditions to calculate the l × l stiffness matrices generated by interface K with entries
( A 4 ( K ) ) i j = φ K , R j n 1 , φ K i , ( A 5 ( K ) ) i j = φ K , R j n 2 , φ K i ,
( A 6 ( K ) ) i j = φ K , L j , φ K i n 1 , ( A 7 ( K ) ) i j = φ K , L j , φ K i n 2 .
Assemble matrices A 1 ( K ) - A 7 ( K ) to A 1 - A 7 by the global number.
5: end for
6: Construct nonuniform time meshes t n = T n / M r , n = 0 , 1 , , M with time mesh sizes τ n = t n t n 1 , n = 1 , 2 , , M .
7: Introduce a vector W n = [ U n , P 1 n , P 2 n ] T with 3 l ( N x N y ) unknown coefficients (nodal values of U h n , P 1 , h n and P 2 , h n ) as components, where U n , P 1 n and P 2 n are vectors consisting of { u K n , i } i = 1 l , { p 1 , K n , i } i = 1 l and { p 2 , K n , i } i = 1 l , respectively.
8: Choose initial value W 0 .
9: for n = 1 do
10:   Set β = Γ ( 2 α ) d n , 1 .
11:   for K T h do
12:    Calculate of the l × l matrix A 8 ( K ) corresponding to nonlinear term on K at the time level t n 1 with components
( A 8 ( K ) ) i j = i = 1 l u K n 1 , i φ K i 2 φ K j , φ K i ,
then assemble A 8 according to global number.
13:   end for
14:   Define a zero matrix ( O ) i j = 0 of size l ( N x N y ) × l ( N x N y ) . Then the global stiffness matrix and the global load vector are
A = ( 1 β ) A 1 ϵ 2 β ( A 2 A 4 ) ϵ 2 β ( A 3 A 5 ) A 2 A 6 A 1 O A 2 A 7 O A 1
and
B = β d n , n Γ ( 2 α ) A 1 O O W 0 β A 8 O O W 0 .
15:   Solve
A W n = B .
16: end for
17: for n = 2 , , M do
18:   Set β = Γ ( 2 α ) d n , 1 .
19:   for K T h do
20:    Assemble the matrices A 8 and A 9 associated with the nonlinear term at moments t n 1 and t n 2 , respectively. Their components on K are
( A 8 ( K ) ) i j = i = 1 l u K n 1 , i φ K i 2 φ K j , φ K i , i , j = 1 , l ,
and
( A 9 ( K ) ) i j = i = 1 l u K n 2 , i φ K i 2 φ K j , φ K i , i , j = 1 , l .
21:   end for
22:   Assemble the global stiffness matrix and the global load vector
A = ( 1 β ) A 1 ϵ 2 β ( A 2 A 4 ) ϵ 2 β ( A 3 A 5 ) A 2 A 6 A 1 O A 2 A 7 O A 1
and
B = s = 1 n 1 β d n , s d n , s + 1 Γ ( 2 α ) A 1 O O W n s + β d n , n Γ ( 2 α ) A 1 O O W 0 2 β A 8 O O W n 1 + β A 9 O O W n 2 .
23:   Solve
A W n = B .
24: end for
From Theorem 2, it can be seen that the scheme (18) can reach the optimal convergence order O ( M ( 2 α ) ) in the time direction when the grid parameter r ( 2 α ) / α . However, the numerical solution generated by (18) will be limited to ( 2 α ) th-order accurate in time, even if the solution is sufficiently smooth. Therefore, in the next section, we will study a higher-order numerical algorithm for the time-fractional Allen-Cahn Equation (1).

4. Nonuniform L2-1 σ –LDG Scheme

In the section, we propose a fully discrete nonuniform L2-1 σ –LDG scheme for solving the time-fractional Allen-Cahn Equation (1), which is based on the L2- 1 σ approximation in the temporal direction and the LDG method in the spatial direction. The stability and the convergence of the scheme are proved rigorously.

4.1. The Fully Discrete Numerical Scheme and Its Stability Analysis

The usual notations of the nonuniform L2- 1 σ formula are introduced here. Let M be a positive integer. Set t n = T ( n / M ) r for n = 0 , 1 , , M , where the temporal mesh grading parameter r 1 is chosen by the user. Denote τ n = t n t n 1 , n = 1 , , M be the time mesh sizes. Set t n + σ = t n + σ τ n + 1 , u n + σ = u ( x , t n + σ ) , and u n , σ = σ u n + 1 + ( 1 σ ) u n for σ [ 0 , 1 ] , n = 0 , 1 , , M 1 .
The Caputo fractional derivative C D 0 , t α u can be approximated at the point t n + σ ( n = 0 , 1 , , M 1 ) by the L2- 1 σ formula [35]
C D 0 , t α u ( x , t n + σ ) = 1 Γ ( 1 α ) 0 t n + σ u ( x , s ) s d s ( t n + σ s ) α = 1 Γ ( 1 α ) k = 1 n t k 1 t k u ( x , s ) s d s ( t n + σ s ) α + 1 Γ ( 1 α ) t n t n + σ u ( x , s ) s d s ( t n + σ s ) α g n , n u n + 1 j = 0 n ( g n , j g n , j 1 ) u j : = t α u n + σ .
Here g 0 , 0 = τ 1 1 a 0 , 0 , g n , 1 = 0 , and for n 1 , it holds that
g n , j = τ j + 1 1 ( a n , 0 b n , 0 ) , j = 0 , τ j + 1 1 ( a n , j + b n , j 1 b n , j ) , 1 j n 1 , τ j + 1 1 ( a n , n + b n , n 1 ) , j = n .
a n , n = 1 Γ ( 1 α ) t n t n + σ ( t n + σ s ) α d s = σ 1 α Γ ( 2 α ) τ n + 1 1 α , n 0 , a n , j = 1 Γ ( 1 α ) t j t j = 1 ( t n + σ s ) α d s , n 1 , 0 j n 1 , b n , j = 2 Γ ( 1 α ) ( t j + 2 t j ) t j t j + 1 ( t n + σ s ) α ( s t j + 1 / 2 ) d s , n 1 , 0 j n 1 .
Define the discrete convolution kernel A n + 1 j n + 1 , σ = g n , j , t u j + 1 = u j + 1 u j for 0 j n and 0 n M 1 . Then, the L2- 1 σ discretization can be rewritten as
t α u n + σ = j = 0 n A n + 1 j n + 1 , σ t u j + 1 , n = 0 , 1 , , M 1 .
By referring to [40], the discrete convolution kernel P n + 1 j n + 1 , σ are defined as
P 1 n + 1 , σ = 1 A 1 n + 1 , σ , P n + 1 j n + 1 , σ = 1 A 1 j + 1 , σ i = j + 1 n A i j i + 1 , σ A i j + 1 i + 1 , σ P n + 1 i n + 1 , σ .
The discrete convolution kernels satisfy the following properties
j = i n P n + 1 j n + 1 , σ A j i + 1 j + 1 , σ = 1 , for 0 i n M 1 ,
and
j = 0 n P n + 1 j n + 1 , σ ω 1 + m α α ( t j + 1 ) π A ω 1 + m α ( t n + 1 ) , for 0 n M 1 and m = 0 , 1 ,
where ω β ( t ) = t β 1 / Γ ( β ) and π A is a positive constant.
Let p = u , then the weak form of the time-fractional Allen-Cahn Equation (1) at t n + σ is formulated as
( C D 0 , t α u ) n + σ , v Ω ϵ 2 ( · p n + σ , v ) + ϵ 2 ( · p n , σ , v ) + ϵ 2 ( p n , σ , v ) Ω ϵ 2 p n , σ · n , v Γ + f ( u n , σ ) f ( u n + σ ) , v Ω f ( u n , σ ) , v Ω = 0 ,
( p n , σ , w ) Ω + ( u n , σ , · w ) Ω u n , σ , w · n Γ = 0 ,
where v, w are test functions.
By using the LDG method presented in Section 3 for the spatial discretization and the nonuniform L2- 1 σ formula to time. Then we can define the fully discrete nonuniform L2- 1 σ –LDG scheme as follows: find ( U h n , σ , P h n , σ ) ( V h , Σ h ) such that for all test functions v h V h and w h Σ h
t α U h n + σ , v h Ω + ϵ 2 ( P h n , σ , v h ) Ω ϵ 2 P h n , σ ^ · n , v h Γ f ( U h n , σ ) , v Ω = 0 ,
( P h n , σ , w h ) Ω + ( U h n , σ , · w h ) Ω U h n , σ ^ , w h · n Γ = 0 .
Here the “numerical fluxes” are chosen as (16).
To show the stability of the proposed nonuniform L2- 1 σ –LDG scheme, we need some important lemmas.
Lemma 6
([28]). For any finite time t M = T > 0 and a given nonnegative sequence ( λ l ) l = 0 M 1 , assume that there exists a constant Λ, independent of time-steps, such that l = 0 M 1 λ l Λ . Let σ = 1 α / 2 and suppose that the grid function { u n + 1 | n 0 } satisfies
i = 0 n A n + 1 i n + 1 , σ t ( u i + 1 ) 2 i = 0 n λ n i ( u i , σ ) 2 + ϕ n + 1 u n , σ + ( ψ n + 1 ) 2 , 0 n M 1 ,
where { ϕ n + 1 , ψ n + 1 | 0 n M 1 } are nonnegative sequences. If the maximum time-step τ M ( 2 π A Γ ( 2 α ) Λ ) 1 / α , it holds that, for 0 n M 1 ,
u n + 1 2 E α , 1 ( 2 π A Λ t n + 1 α ) u 0 + max 0 i n j = 0 i P i j + 1 i + 1 , σ ϕ j + π A Γ ( 1 α ) max 0 j n { t j + 1 α / 2 ψ j + 1 } .
Here E α , 1 ( z ) = k = 0 z k Γ ( k α + 1 ) is the Mittag-Leffler function.
Lemma 7
([29]). Suppose σ = 1 α / 2 . For any function u n + 1 ( 0 n M 1 ) , we have the following inequality
( t α u n + σ , u n , σ ) Ω 1 2 t α ( u Ω 2 ) n + σ .
Theorem 3.
If the graded mesh satisfies the maximum time-step condition τ M 4 π A Γ ( 2 α ) 1 / α , then the solution U h n + 1 of the fully discrete nonuniform L2- 1 σ –LDG scheme (48) satisfies
U h n + 1 Ω 2 E α , 1 ( 4 π A t n + 1 α ) U h 0 Ω , n = 0 , 1 , , M 1 .
Proof. 
Taking the test functions ( v h , w h ) = ( U h n , σ , ϵ 2 P h n , σ ) in (48) and integrating by parts, we get
t α U h n + σ , U h n , σ Ω + ϵ 2 P h n , σ Ω 2 + + ( U h n , σ ) 3 U h n , σ , U h n , σ Ω = 0 .
By virtue of Lemma 7 and Cauchy-Schwarz inequality, we obtain
α U h Ω 2 n + σ 2 U h n , σ Ω 2 .
Using Lemma 6, it follows from (49) that
U h n + 1 Ω 2 E α , 1 ( 4 π A t n + 1 α ) U h 0 Ω , n = 0 , 1 , , M 1 .
The proof is completed. □

4.2. Optimal Error Estimate

In this subsection, we give the optimal error estimate for the fully discrete nonuniform L2- 1 σ –LDG scheme (48) of Equation (1). Suppose the exact solution u ( x , t ) of (1) has the following smoothness properties
u L ( 0 , T ] ; H k + 2 ( Ω ) , l u ( x , t ) / t l C ( 1 + t α l ) for 0 < t T and l = 0 , 1 , 2 , 3 .
The same as the nonuniform L1–LDG scheme, we assume that the nonlinear term f ( u ) satisfies the condition (26).
Lemma 8
([33]). Suppose σ = 1 α / 2 . Then for any function u ( t ) C 3 ( 0 , T ] , one has
( C D 0 , t α u ) n + σ Υ t α u n + σ C t n + σ α ψ u n + σ + max 1 s n { ψ u n , s } for n = 0 , 1 , , M 1 ,
where
ψ u n + σ = τ n + 1 3 α t n + σ α sup s ( t n , t n + 1 ) | u ( s ) | for n = 1 , 2 , , M 1 , ψ u n , 1 = τ 1 α sup s ( 0 , t 1 ) s 1 α | ( I 2 , 1 u ( s ) ) u ( s ) | for n = 1 , 2 , , M 1 , ψ u n , s = τ n + 1 α τ i 2 ( τ i + τ i + 1 ) t i α sup s ( t i 1 , t i + 1 ) | u ( s ) | for 2 i n M 1 ,
and I 2 , 1 u ( s ) is the quadratic polynomial that interpolates to u ( s ) at the points t s 1 , t s and t s + 1 .
Lemma 9
([33]). Suppose that u C [ 0 , T ] C 3 ( 0 , T ] satisfies the condition (50). Then we have
ψ u n + σ C M min { r α , 3 α } for n = 0 , 1 , , M 1 , ψ u n , s C M min { r α , 3 α } for s = 1 , , M 1 , n 1 .
In Section 3.2, we give the convergence analysis for the nonuniform L1–LDG scheme. The same proof idea can be extended to the nonuniform L2- 1 σ –LDG scheme. However, the proof would be somewhat more complicated. Following the similar line as before, we obtain the following error equation
( C D 0 , t α u ) n + σ t α U h n + σ , v h Ω + ϵ 2 ( e p n , σ , v h ) Ω ϵ 2 e p n , σ ^ · n , v h Γ = f ( u n , σ ) f ( U h n , σ ) , v h Ω + ( R 2 n , σ , v h ) Ω ,
( e p n , σ , w h ) Ω + ( e u n , σ , · w h ) Ω e u n , σ ^ , w h · n Γ = 0 ,
where ( v h , w h ) V h × Σ h are test functions, R 2 n + σ = ϵ 2 ( · p n + σ · p n , σ ) + f ( u n + σ ) f ( u n , σ ) , e u n , σ and e p n , σ are the errors with the decompositions
e u n + 1 = u n + 1 U h n + 1 = u n + 1 P u n + 1 + P u n + 1 U h n + 1 = u n + 1 P u n + 1 + P e u n + 1 ,
e p n + 1 = p n + 1 P h n + 1 = p n + 1 Π p n + 1 + Π p n + 1 P h n + 1 = p n + 1 Π p n + 1 + Π e p n + 1 .
Here P and Π are the projections defined in (28).
Theorem 4.
Assume that the solution u of the problem (1) satisfies the condition (50) and C D 0 , t α u L ( ( 0 , T ] ; H k + 1 ( Ω ) ) . Let U h n be the numerical solution of the fully discrete LDG scheme (48). Suppose σ = 1 α / 2 , f ( u ) satisfies the condition (26), and the nonuniform mesh satisfies the maximum time-step condition τ M 4 π A Γ ( 2 α ) 1 / α , then for n = 1 , 2 , , M , the following estimate holds
u n U h n C M min { r α , 2 } + h k + 1 ,
where C is a positive constant independent of M and h.
Proof. 
Substituting (52) into (51), we deduce that
t α ( P e u ) n + σ , v h Ω + ϵ 2 ( Π e p n , σ , v h ) Ω ϵ 2 Π e p n , σ ^ · n , v h Γ f ( u n , σ ) f ( U h n , σ ) , v h Ω = t α ( u P u ) n + σ , v h Ω ϵ 2 ( p n , σ Π p n , σ , v h ) Ω + ϵ 2 ( p n , σ Π p n , σ ^ ) · n , v h Γ ( ζ n + σ , v h ) Ω + ( R 2 n + σ , v h ) Ω ,
( Π e p n , σ , w h ) Ω + ( P e u n , σ , · w h ) Ω P e u n , σ ^ , w h · n Γ = ( p n , σ Π p n , σ , w h ) Ω ( u n , σ P u n , σ , · w h ) Ω + u n , σ P u n , σ ^ , w h · n Γ ,
where ζ n + σ = ( C D 0 , t α u ) n + σ t α u n + σ represents truncation error. Making use of the interpolation properties in Section 2.2, we obtain
t α ( P e u ) n + σ , v h Ω + ϵ 2 ( Π e p n , σ , v h ) Ω ϵ 2 Π e p n , σ ^ · n , v h Γ f ( u n , σ ) f ( U h n , σ ) , v h Ω = t α ( u P u ) n + σ , v h Ω ( ζ n + σ , v h ) Ω + ( R 2 n + σ , v h ) Ω ,
( Π e p n , σ , w h ) Ω + ( P e u n , σ , · w h ) Ω P e u n , σ ^ , w h · n Γ = ( p n , σ Π p n , σ , w h ) Ω ( u n , σ P u n , σ , · w h ) Ω + u n , σ P u n , σ ^ , w h · n Γ .
Setting ( v h , w h ) = ( P e u n , σ , ϵ 2 Π e p n , σ ) in (54) and integrating by parts, we arrive at
t α ( P e u ) n + σ , P e u n , σ Ω + ϵ 2 Π e p n , σ Ω 2 f ( u n , σ ) f ( U h n , σ ) , P e u n , σ Ω = t α ( u P u ) n + σ , P e u n , σ Ω ( ζ n + σ , P e u n , σ ) Ω + ( R 2 n + σ , P e u n , σ ) Ω , ϵ 2 ( p n , σ Π p n , σ , Π e p n , σ ) Ω ϵ 2 ( u n , σ P u n , σ , · Π e p n , σ ) Ω + ϵ 2 u n , σ P u n , σ ^ , Π e p n , σ · n Γ .
Applying the Cauchy-Schwarz inequality, interpolation property (9), and Lemma 1, we can bound the right hand side of (55) by
t α ( P e u ) n + σ , P e u n , σ Ω + ϵ 2 Π e p n , σ Ω 2 f ( u n , σ ) f ( U h n , σ ) , P e u n , σ Ω t α ( u P u ) n + σ Ω + ζ n + σ Ω + R 2 n + σ Ω P e u n , σ Ω + ϵ 2 p n , σ Π p n , σ Ω Π e p n , σ Ω + C h k + 1 Π e p n , σ Ω t α ( u P u ) n + σ Ω + ζ n + σ Ω + R 2 n + σ Ω P e u n , σ Ω + C h k + 1 Π e p n , σ Ω .
By using an analysis similar to that in (35), we can obtain the following estimate
t α ( P e u ) n + σ , P e u n , σ Ω t α ( u P u ) n + σ Ω + ζ n + σ Ω + R 2 n + σ Ω P e u n , σ Ω + C P e u n , σ Ω 2 + C h 2 k + 2 .
According to interpolation property (8), we can get
t α ( u P u ) n + σ Ω = t α ( u P u ) n + σ ( C D 0 , t α ( u P u ) ) n + σ + ( C D 0 , t α ( u P u ) ) n + σ Ω ( C D 0 , t α u ) n + σ + t α u n + σ + P ( C D 0 , t α u ) n + σ t α u n + σ Ω + ( C D 0 , t α ( u P u ) ) n + σ Ω C ζ n + σ H 1 ( Ω ) + C h k + 1 ( C D 0 , t α u ) n + σ H k + 1 ( Ω ) .
Next, we estimate max 0 n M 1 t n + σ α R 2 n + σ Ω } . When n = 0 , it follows from the assumption of u that there exists a constant C such that
t σ α R 2 n + σ Ω C t 1 α C M r α .
When n 1 , applying (50) and Lemma 9 in the literature [33], we obtain
t n + σ α R 2 n + σ Ω C t n + σ α τ n + 1 2 t n α 2 C ( n + 1 ) r α M r α M 2 r n r α 2 M r α + 2 r C ( n / M ) 2 r α 2 M 2 ,
where we have used τ n + 1 C T M r n r 1 ( n = 0 , 1 , , M 1 ) in the second inequality. As a consequence,
t n + σ α R 2 n + σ Ω C M 2 , n = 1 , 2 , , M 1 , r 1 / α , C M 2 α , n = 1 , 2 , , M 1 , 1 r < 1 / α .
Combining the above two cases, we have
max 0 n M 1 t n + σ α R 2 n + σ Ω C M min { r α , 2 } .
By using (58), (59), and Lemmas 8 and 9, we arrive at
t α ( u P u ) n + σ Ω + ζ n + σ Ω + R 2 n + σ Ω C ζ n + σ H 1 ( Ω ) + C h k + 1 ( C D 0 , t α u ) n + σ H k + 1 ( Ω ) + t n + σ α t n + σ α R 2 n + σ Ω C t n + σ α max 1 n M 1 t n + σ α ζ n + σ H 1 ( Ω ) + t n + σ α R 2 n + σ Ω + C h k + 1 C t n + σ α C max 0 n M 1 ψ u n + σ H 1 ( Ω ) + max 1 s n ψ u n , s H 1 ( Ω ) + M min { r α , 2 } + C h k + 1 C t n + σ α M min { r α , 3 α } + M min { r α , 2 } + C h k + 1 C t n + σ α M min { r α , 3 α } + C h k + 1 .
Substituting (60) into (57) and applying Lemma 7, we thus get
t α ( P e u Ω 2 ) n + σ C t n + σ α M min { r α , 3 α } + C h k + 1 P e u n , σ Ω + C P e u n , σ Ω 2 + C h 2 k + 2 .
Then, invoking Lemmas 6 and (46), one has
P e u n + 1 Ω 2 E α , 1 ( 2 C π A t n + 1 α ) ( max 0 i n j = 0 i P i j + 1 i + 1 , σ 2 C t j + σ α M min { r α , 3 α } + C h k + 1 + π A Γ ( 1 α ) max 0 j n C t j + 1 α / 2 h k + 1 ) C max 0 i n j = 0 i P i j + 1 i + 1 , σ ω 1 α ( t j + 1 ) M min { r α , 2 } + h k + 1 + C h k + 1 C M min { r α , 2 } + C h k + 1 ,
provided that the maximum time-step τ M 4 π A Γ ( 2 α ) 1 / α . By use of the triangle inequality, the interpolation properties (8) and (9), and utilizing (62) yields the desired result. This completes the proof. □

5. Numerical Examples

The purpose of this section is to numerically validate the accuracy and efficiency of proposed Schemes (18) and (48) for solving the time-fractional Allen-Cahn Equation (1) with initial singularity. All the algorithms are implemented using MATLAB R2016a, which were run in a 3.10 GHz PC having 16GB RAM and Windows 10 operating system.
Example 1.
Consider the following two-dimensional time-fractional Allen-Cahn equation with a source term f ( x , y , t )
C D 0 , t α u ( x , y , t ) Δ u ( x , y , t ) = u ( x , y , t ) u 3 ( x , y , t ) + f ( x , y , t ) , ( x , y ) Ω , t ( 0 , 1 4 ] , u ( x , y , 0 ) = 0 , ( x , y ) Ω , u ( x , y , t ) = 0 , ( x , y ) Ω , t ( 0 , 1 4 ] ,
where 0 < α < 1 , Ω = ( 1 , 1 ) × ( 1 , 1 ) , and the source term is given by
f ( x , y , t ) = Γ ( α + 1 ) + 2 t 2 α Γ ( 3 α ) ( x + 1 ) 2 ( x 1 ) 2 ( y + 1 ) 2 ( y 1 ) 2 4 ( t α + t 2 ) ( 3 x 2 1 ) ( y + 1 ) 2 ( y 1 ) 2 4 ( t α + t 2 ) ( 3 y 2 1 ) ( x + 1 ) 2 ( x 1 ) 2 ( t α + t 2 ) ( x + 1 ) 2 ( x 1 ) 2 ( y + 1 ) 2 ( y 1 ) 2 + ( t α + t 2 ) ( x + 1 ) 2 ( x 1 ) 2 ( y + 1 ) 2 ( y 1 ) 2 3 .
The analytical solution is given by u ( x , y , t ) = ( t α + t 2 ) ( x + 1 ) 2 ( x 1 ) 2 ( y + 1 ) 2 ( y 1 ) 2 .
The purpose of Example 1 is to demonstrate the effectiveness of the nonuniform L1–LDG scheme (18) with the numerical flux (16) for the time-fractional Allen-Cahn equation with weak singularity solution. The L 2 -norm errors and convergence orders of the numerical solution U h n at t = 1 4 are shown in Table 1, Table 2, Table 3 and Table 4. From Table 1 and Table 2, one can see that the convergence orders of scheme (18) in the temporal direction are close to min { 2 α , r α } . In Table 3 and Table 4, we take r = ( 2 α ) / α and α = 0.4 , 0.6 , 0.8 , and the orders of convergence for U h n are closed to ( k + 1 ) in space. These numerical results coincide with Theorem 2.
Example 2.
Consider the following two-dimensional time-fractional Allen-Cahn equation with a source term f ( x , y , t )
C D 0 , t α u ( x , y , t ) 0.1 Δ u ( x , y , t ) = u ( x , y , t ) u 3 ( x , y , t ) + f ( x , y , t ) , ( x , y ) Ω , t ( 0 , 1 4 ] , u ( x , y , 0 ) = 0 , ( x , y ) Ω , u ( x , y , t ) = 0 , ( x , y ) Ω , t ( 0 , 1 4 ] ,
where 0 < α < 1 , Ω = ( 1 , 1 ) × ( 1 , 1 ) , and the source term is given by
f ( x , y , t ) = Γ ( α + 1 ) + 2 t 2 α Γ ( 3 α ) ( x + 1 ) 2 ( x 1 ) 2 ( y + 1 ) 2 ( y 1 ) 2 0.4 ( t α + t 2 ) ( 3 x 2 1 ) ( y + 1 ) 2 ( y 1 ) 2 0.4 ( t α + t 2 ) ( 3 y 2 1 ) ( x + 1 ) 2 ( x 1 ) 2 ( t α + t 2 ) ( x + 1 ) 2 ( x 1 ) 2 ( y + 1 ) 2 ( y 1 ) 2 + ( t α + t 2 ) ( x + 1 ) 2 ( x 1 ) 2 ( y + 1 ) 2 ( y 1 ) 2 3 .
The solution u ( x , y , t ) = ( t α + t 2 ) ( x + 1 ) 2 ( x 1 ) 2 ( y + 1 ) 2 ( y 1 ) 2 solves this equation.
It is clear that the exact solution u of Example 2 satisfies the regularity assumption (50), so we use the proposed nonuniform L2- 1 σ –LDG scheme (48) to solve this problem. Table 5 and Table 6 report the numerical errors and convergence orders in the temporal direction. The data in these tables demonstrate that the temporal convergence order of the numerical solution U h n is min { 2 , r α } . In order to test the convergence order of the scheme in spatial direction, we fix sufficiently small temporal step ( M = 500 for k = 1 and M = 3000 for k = 2 ) and vary the spatial step sizes. Table 7 and Table 8 list the numerical results for different values of α , where the ( k + 1 ) -th order convergence of scheme (48) in spatial direction can be achieved.

6. Concluding Remarks

This paper focuses on the numerical algorithms for the time-fractional Allen-Cahn equation with a weak singularity solution. In the time direction, it is discretized by the nonuniform L1 scheme and the nonuniform L2- 1 σ scheme, respectively. In the spatial direction, the LDG method is utilized. By the discrete fractional Gronwall-type inequalities, the L 2 stability and optimal error estimates of these two schemes are proved in detail. Finally, the efficiency and accuracy of proposed fully discrete schemes are verified by some numerical examples. In future work, we extend the technique of coupling the LDG method with the nonuniform time discretization to solve the space-time fractional phase-field model.

Author Contributions

Conceptualization, Z.W.; methodology, Z.W.; software, Z.W.; validation, L.S. and J.C.; formal analysis, Z.W.; investigation, L.S.; resources, Z.W.; data curation, L.S.; writing—original draft preparation, Z.W.; writing—review and editing, Z.W.; visualization, L.S.; supervision, J.C.; project administration, Z.W. and J.C.; funding acquisition, Z.W. and J.C. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (NSFC) under grant Nos. 12101266 and 11901266.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

All the data were computed using our algorithms.

Conflicts of Interest

The author declares no conflict of interest. The funder had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.

References

  1. Allen, S.M.; Cahn, J.W. A microscopic theory for antiphase boundary motion and its application to antiphase domain coarsening. Acta Metall. 1979, 27, 1085–1095. [Google Scholar] [CrossRef]
  2. Yue, P.; Zhou, C.; Feng, J.; Olliviergooch, C.F.; Hu, H. Phase-field simulations of interfacial dynamics in viscoelastic fluids using finite elements with adaptive meshing. J. Comput. Phys. 2006, 219, 47–67. [Google Scholar] [CrossRef]
  3. Chen, L.Q. Phase-field models for microstructure evolution. Ann. Rev. Mater. Res. 2002, 32, 113–140. [Google Scholar] [CrossRef] [Green Version]
  4. Beneš, M.; Chalupecký, V.; Mikula, K. Geometrical image segmentation by the Allen-Cahn equation. Appl. Numer. Math. 2004, 51, 187–205. [Google Scholar] [CrossRef]
  5. Zhang, J.; Du, Q. Numerical studies of discrete approximations to the Allen-Cahn equation in the sharp interface limit. SIAM J. Sci. Comput. 2009, 31, 3042–3063. [Google Scholar] [CrossRef]
  6. Yan, F.; Xu, Y. Stability analysis and error estimates of local discontinuous Galerkin methods with semi-implicit spectral deferred correction time-marching for the Allen-Cahn equation. J. Comput. Appl. Math. 2020, 376, 112857. [Google Scholar] [CrossRef]
  7. Cahn, J.W.; Hilliard, J.E. Free energy of a nonuniform system. I. interfacial free energy. J. Chem. Phys. 1958, 28, 258–267. [Google Scholar] [CrossRef]
  8. Liu, H.; Cheng, A.; Wang, H.; Zhao, J. Time-fractional Allen-Cahn and Cahn-Hilliard phase-field models and their numerical investigation. Comp. Math. Appl. 2018, 76, 1876–1892. [Google Scholar] [CrossRef]
  9. Hou, T.; Tang, T.; Yang, J. Numerical analysis of fully discretized Crank-Nicolson scheme for fractional-in-space Allen-Cahn equations. J. Sci. Comput. 2017, 72, 1214–1231. [Google Scholar] [CrossRef]
  10. Kilbas, A.A.; Srivastava, H.M.; Trujillo, J.J. Theory and Applications of Fractional Differential Equations; Elsevier: Amsterdam, The Netherlands, 2006. [Google Scholar]
  11. Du, Q.; Yang, J.; Zhou, Z. Time-fractional Allen-Cahn equations: Analysis and numerical methods. J. Sci. Comput. 2020, 85, 42. [Google Scholar] [CrossRef]
  12. Li, Z.; Wang, H.; Yang, D. A space-time fractional phase-field model with tunable sharpness and decay behavior and its efficient numerical simulation. J. Comput. Phys. 2017, 347, 20–38. [Google Scholar] [CrossRef]
  13. Tang, T.; Yu, H.; Zhou, T. On energy dissipation theory and numerical stability for time-fractional phase field equations. SIAM J. Sci. Comput. 2019, 41, A3757–A3778. [Google Scholar] [CrossRef] [Green Version]
  14. Yin, B.; Liu, Y.; Li, H.; He, S. Fast algorithm based on TT-M FE system for space fractional Allen-Cahn equations with smooth and nonsmooth solutions. J. Comput. Phys. 2019, 379, 351–372. [Google Scholar] [CrossRef] [Green Version]
  15. Huang, C.; Stynes, M. Optimal H1 spatial convergence of a fully discrete finite element method for the time-fractional Allen-Cahn equation. Adv. Comput. Math. 2020, 46, 1–20. [Google Scholar] [CrossRef]
  16. Hou, D.; Zhu, H.; Xu, C. Highly efficient and accurate schemes for time fractional Allen-Cahn equation by using extended SAV approach. Numer. Algorithms 2021, 88, 1077–1108. [Google Scholar] [CrossRef]
  17. Jia, J.; Zhang, H.; Xu, H.; Jiang, X. An efficient second order stabilized scheme for the two dimensional time fractional Allen-Cahn equation. Appl. Numer. Math. 2021, 165, 216–231. [Google Scholar] [CrossRef]
  18. Ji, B.; Liao, H.; Gong, Y.; Zhang, L. Adaptive linear second-order energy stable schemes for time-fractional Allen-Cahn equation with volume constraint. Commun. Nonlinear Sci. 2020, 90, 105366. [Google Scholar] [CrossRef]
  19. Liao, H.; Tang, T.; Zhou, T. A second-order and nonuniform time-stepping maximum-principle preserving scheme for time-fractional Allen-Cahn equations. J. Comput. Phys. 2020, 414, 109473. [Google Scholar] [CrossRef] [Green Version]
  20. Liao, H.; Tang, T.; Zhou, T. An energy stable and maximum bound preserving scheme with variable time steps for time fractional Allen-Cahn equation. SIAM J. Sci. Comput. 2021, 43, A3503–A3526. [Google Scholar] [CrossRef]
  21. Cockburn, B.; Shu, C.-W. The local discontinuous Galerkin method for time-dependent convection-diffusion systems. SIAM J. Numer. Anal. 1998, 35, 2440–2463. [Google Scholar] [CrossRef]
  22. Zhu, S.; Shi, Y.; Ban, Z. A circuit-based wave port boundary condition for the nodal discontinuous Galerkin time-domain method. Electronics 2022, 11, 1842. [Google Scholar] [CrossRef]
  23. Yue, J.; Guo, L.; Guo, P.; Wang, X. Transient acoustic wave propagation problems in multilayered pavement using a time discontinuous Galerkin finite element method. Appl. Sci. 2022, 12, 5438. [Google Scholar] [CrossRef]
  24. Guo, R.H.; Ji, L.Y.; Xu, Y. High order local discontinuous Galerkin methods for the Allen-Cahn equation: Analysis and simulation. J. Comput. Math. 2016, 34, 135–158. [Google Scholar] [CrossRef]
  25. Dong, B.; Shu, C.-W. Analysis of a local discontinuous Galerkin method for linear time-dependent fourth-order problems. SIAM J. Numer. Anal. 2009, 47, 3240–3268. [Google Scholar] [CrossRef]
  26. Stynes, M.; O’Riordan, E.; Gracia, J.L. Error analysis of a finite difference method on graded mesh for a time-fractional diffusion equation. SIAM J. Numer. Anal. 2017, 55, 1057–1079. [Google Scholar] [CrossRef]
  27. Liao, H.; Li, D.; Zhang, J. Sharp error estimate of nonuniform L1 formula for linear reaction-subdiffusion equations. SIAM J. Numer. Anal. 2018, 56, 1112–1133. [Google Scholar] [CrossRef]
  28. Ren, J.; Liao, H.; Zhang, J.; Zhang, Z. Sharp H1-norm error estimates of two time-stepping schemes for reaction-subdiffusion problems. J. Comput. Appl. Math. 2021, 389, 113352. [Google Scholar] [CrossRef]
  29. Alikhanov, A.A. A new difference scheme for the time fractional diffusion equation. J. Comput. Phys. 2015, 280, 424–438. [Google Scholar] [CrossRef] [Green Version]
  30. Li, C.P.; Wang, Z. Numerical methods for the time fractional convection-diffusion-reaction equation. Numer. Func. Anal. Opt. 2021, 42, 1115–1153. [Google Scholar] [CrossRef]
  31. Cen, D.; Wang, Z.; Mo, Y. Second order difference schemes for time-fractional KdV-Burgers equation with initial singularity. Appl. Math. Lett. 2021, 112, 106829. [Google Scholar] [CrossRef]
  32. Cen, D.; Wang, Z. Time two-grid technique combined with temporal second order difference method for two-dimensional semilinear fractional sub-diffusion equations. Appl. Math. Lett. 2022, 129, 107919. [Google Scholar] [CrossRef]
  33. Chen, H.; Stynes, M. Error analysis of a second-order method on fitted meshes for a time-fractional diffusion problem. J. Sci. Comput. 2019, 79, 624–647. [Google Scholar] [CrossRef]
  34. Li, C.P.; Wang, Z. Non-uniform L1/discontinuous Galerkin approximation for the time-fractional convection equation with weak regular solution. Math. Comput. Simulat. 2021, 182, 838–857. [Google Scholar] [CrossRef]
  35. Liao, H.; McLean, W.; Zhang, J. A second-order scheme with nonuniform time steps for a linear reaction-subdiffusion problem. Commun. Comput. Phys. 2021, 30, 567–601. [Google Scholar] [CrossRef]
  36. Ou, C.; Cen, D.; Vong, S.; Wang, Z. Mathematical analysis and numerical methods for Caputo-Hadamard fractional diffusion-wave equations. Appl. Numer. Math. 2022, 177, 34–57. [Google Scholar] [CrossRef]
  37. Wang, Z. High-order numerical algorithms for the time-fractional convection-diffusion equation. Int. J. Comput. Math. 2022. [Google Scholar] [CrossRef]
  38. Wang, Z. Numerical analysis of local discontinuous Galerkin method for the time-fractional fourth-order equation with initial singularity. Fractal Fract. 2022, 6, 206. [Google Scholar] [CrossRef]
  39. Wang, Z.; Ou, C.; Vong, S. A second-order scheme with nonuniform time grids for Caputo-Hadamard fractional sub-diffusion equations. J. Comput. Appl. Math. 2022, 414, 114448. [Google Scholar] [CrossRef]
  40. Liao, H.; McLean, W.; Zhang, J. A discrete Gronwall inequality with applications to numerical schemes for subdiffusion problems. SIAM J. Numer. Anal. 2019, 57, 218–237. [Google Scholar] [CrossRef]
Table 1. The L 2 -norm errors and temporal convergence orders for Example 1 using scheme (18), M = N x = N y , k = 1 , T = 1 / 4 , r = 1 .
Table 1. The L 2 -norm errors and temporal convergence orders for Example 1 using scheme (18), M = N x = N y , k = 1 , T = 1 / 4 , r = 1 .
α = 0.4 α = 0.6 α = 0.8
M L 2 -Error Order L 2 -Error Order L 2 -Error Order
201.7270 × 10 2 9.4316 × 10 3 3.0600 × 10 3
401.4687 × 10 2 0.23376.7438 × 10 3 0.48401.9214 × 10 3 0.6736
601.3176 × 10 2 0.26775.4723 × 10 3 0.51531.4451 × 10 3 0.7026
801.2143 × 10 2 0.28404.6982 × 10 3 0.53011.1723 × 10 3 0.7272
1001.1372 × 10 2 0.29404.1657 × 10 3 0.53929.9365 × 10 4 0.7409
Table 2. The L 2 -norm errors and temporal convergence orders for Example 1 using scheme (18), M = N x = N y , k = 1 , T = 1 / 4 , r = ( 2 α ) / α .
Table 2. The L 2 -norm errors and temporal convergence orders for Example 1 using scheme (18), M = N x = N y , k = 1 , T = 1 / 4 , r = ( 2 α ) / α .
α = 0.4 α = 0.6 α = 0.8
M L 2 -Error Order L 2 -Error Order L 2 -Error Order
204.7878 × 10 3 3.2260 × 10 3 2.3836 × 10 3
401.5255 × 10 3 1.65011.0086 × 10 3 1.67737.4703 × 10 4 1.6739
607.2958 × 10 4 1.81914.7799 × 10 4 1.84184.9633 × 10 4 1.0084
804.2488 × 10 4 1.87943.0615 × 10 4 1.54863.6894 × 10 4 1.0310
1002.7737 × 10 4 1.91112.2904 × 10 4 1.30042.9212 × 10 4 1.0463
Table 3. The L 2 -norm errors and spatial convergence orders for Example 1 using scheme (18), M = 500 , T = 1 / 4 , r = ( 2 α ) / α , k = 1 .
Table 3. The L 2 -norm errors and spatial convergence orders for Example 1 using scheme (18), M = 500 , T = 1 / 4 , r = ( 2 α ) / α , k = 1 .
α = 0.4 α = 0.6 α = 0.8
N x × N y L 2 -Error Order L 2 -Error Order L 2 -Error Order
20 × 20 4.2289 × 10 3 3.1975 × 10 3 2.3945 × 10 3
40 × 40 1.3486 × 10 3 1.64881.0092 × 10 3 1.66377.4296 × 10 4 1.6884
60 × 60 6.4661 × 10 4 1.81304.8193 × 10 4 1.82293.5275 × 10 4 1.8371
80 × 80 3.7761 × 10 4 1.86972.8048 × 10 4 1.88162.0445 × 10 4 1.8960
100 × 100 2.4726 × 10 4 1.89761.8299 × 10 4 1.91391.3286 × 10 4 1.9316
Table 4. The L 2 -norm errors and spatial convergence orders for Example 1 using scheme (18), M = 1000 , T = 1 / 4 , r = ( 2 α ) / α , k = 2 .
Table 4. The L 2 -norm errors and spatial convergence orders for Example 1 using scheme (18), M = 1000 , T = 1 / 4 , r = ( 2 α ) / α , k = 2 .
α = 0.4 α = 0.6 α = 0.8
N x × N y L 2 -Error Order L 2 -Error Order L 2 -Error Order
10 × 10 1.8150 × 10 2 1.3377 × 10 2 9.5653 × 10 3
20 × 20 2.4770 × 10 3 2.87331.8303 × 10 3 2.86961.3144 × 10 3 2.8634
30 × 30 7.5324 × 10 4 2.93605.5713 × 10 4 2.93354.0074 × 10 4 2.9295
40 × 40 3.2169 × 10 4 2.95742.3829 × 10 4 2.95231.7180 × 10 4 2.9441
Table 5. The L 2 -norm errors and temporal convergence orders for Example 2 using scheme (48), M = N x = N y , k = 1 , T = 1 / 4 , r = 1 .
Table 5. The L 2 -norm errors and temporal convergence orders for Example 2 using scheme (48), M = N x = N y , k = 1 , T = 1 / 4 , r = 1 .
α = 0.4 α = 0.6 α = 0.8
M L 2 -Error Order L 2 -Error Order L 2 -Error Order
201.5147 × 10 2 5.3376 × 10 3 2.0856 × 10 3
401.1155 × 10 2 0.44133.4459 × 10 3 0.63137.5052 × 10 4 1.4745
609.3446 × 10 3 0.43682.6785 × 10 3 0.62145.4056 × 10 4 0.8094
808.2484 × 10 3 0.43382.2427 × 10 3 0.61724.2859 × 10 4 0.8068
1007.4915 × 10 3 0.43131.9552 × 10 3 0.61483.5808 × 10 4 0.8055
Table 6. The L 2 -norm errors and temporal convergence orders for Example 2 using scheme (48), M = N x = N y , k = 1 , T = 1 / 4 , r = ( 3 α ) / α .
Table 6. The L 2 -norm errors and temporal convergence orders for Example 2 using scheme (48), M = N x = N y , k = 1 , T = 1 / 4 , r = ( 3 α ) / α .
α = 0.4 α = 0.6 α = 0.8
M L 2 -Error Order L 2 -Error Order L 2 -Error Order
204.8695 × 10 3 2.5966 × 10 3 1.9295 × 10 3
401.4639 × 10 3 1.73407.5597 × 10 4 1.78025.4683 × 10 4 1.8190
606.9287 × 10 4 1.84483.5345 × 10 4 1.87512.5311 × 10 4 1.8998
804.0253 × 10 4 1.88782.0395 × 10 4 1.91141.4529 × 10 4 1.9296
1002.6277 × 10 4 1.91131.3256 × 10 4 1.93099.4126 × 10 5 1.9454
Table 7. The L 2 -norm errors and spatial convergence orders for Example 2 using scheme (48), M = 500 , T = 1 / 4 , r = ( 3 α ) / α , k = 1 .
Table 7. The L 2 -norm errors and spatial convergence orders for Example 2 using scheme (48), M = 500 , T = 1 / 4 , r = ( 3 α ) / α , k = 1 .
α = 0.4 α = 0.6 α = 0.8
N x × N y >L 2 -Error Order >L 2 -Error Order >L 2 -Error Order
20 × 20 3.4951 × 10 3 2.5737 × 10 3 1.9337e-03
40 × 40 1.0436 × 10 3 1.74387.4714 × 10 4 1.78445.4817 × 10 4 1.8187
60 × 60 4.9189 × 10 4 1.85513.4871 × 10 4 1.87942.5370 × 10 4 1.9001
80 × 80 2.8521 × 10 4 1.89462.0099 × 10 4 1.91531.4561 × 10 4 1.9301
100 × 100 1.8614 × 10 4 1.91231.3053 × 10 4 1.93439.4320 × 10 5 1.9460
Table 8. The L 2 -norm errors and spatial convergence orders for Example 2 using scheme (48), M = 3000 , T = 1 / 4 , r = ( 3 α ) / α , k = 2 .
Table 8. The L 2 -norm errors and spatial convergence orders for Example 2 using scheme (48), M = 3000 , T = 1 / 4 , r = ( 3 α ) / α , k = 2 .
α = 0.4 α = 0.6 α = 0.8
>N >x × >N >y >L 2 -Error Order >L 2 -Error Order >L 2 -Error Order
10 × 10 1.2098 × 10 2 7.7466 × 10 3 4.8298 × 10 3
20 × 20 1.6927 × 10 3 2.83741.1255 × 10 3 2.78307.5531 × 10 4 2.6768
30 × 30 5.1633 × 10 4 2.92833.4491 × 10 4 2.91692.3353 × 10 4 2.8950
40 × 40 2.2074 × 10 4 2.95391.4765 × 10 4 2.94921.0020 × 10 4 2.9413
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Wang, Z.; Sun, L.; Cao, J. Local Discontinuous Galerkin Method Coupled with Nonuniform Time Discretizations for Solving the Time-Fractional Allen-Cahn Equation. Fractal Fract. 2022, 6, 349. https://doi.org/10.3390/fractalfract6070349

AMA Style

Wang Z, Sun L, Cao J. Local Discontinuous Galerkin Method Coupled with Nonuniform Time Discretizations for Solving the Time-Fractional Allen-Cahn Equation. Fractal and Fractional. 2022; 6(7):349. https://doi.org/10.3390/fractalfract6070349

Chicago/Turabian Style

Wang, Zhen, Luhan Sun, and Jianxiong Cao. 2022. "Local Discontinuous Galerkin Method Coupled with Nonuniform Time Discretizations for Solving the Time-Fractional Allen-Cahn Equation" Fractal and Fractional 6, no. 7: 349. https://doi.org/10.3390/fractalfract6070349

APA Style

Wang, Z., Sun, L., & Cao, J. (2022). Local Discontinuous Galerkin Method Coupled with Nonuniform Time Discretizations for Solving the Time-Fractional Allen-Cahn Equation. Fractal and Fractional, 6(7), 349. https://doi.org/10.3390/fractalfract6070349

Article Metrics

Back to TopTop