Next Article in Journal
Normalized Ground States for the Sobolev Critical Fractional Kirchhoff Equation with at Least Mass Critical Growth
Previous Article in Journal
Joint Parameter and State Estimation of Fractional-Order Singular Systems Based on Amsgrad and Particle Filter
Previous Article in Special Issue
Numerical Analysis of a Fractional Cauchy Problem for the Laplace Equation in an Annular Circular Region
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Mixed Finite Volume Element Method for Nonlinear Time Fractional Fourth-Order Reaction–Diffusion Models

1
School of Statistics and Mathematics, Inner Mongolia University of Finance and Economics, Hohhot 010070, China
2
School of Mathematical Sciences, Inner Mongolia University, Hohhot 010030, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2025, 9(8), 481; https://doi.org/10.3390/fractalfract9080481
Submission received: 12 June 2025 / Revised: 15 July 2025 / Accepted: 16 July 2025 / Published: 23 July 2025

Abstract

In this paper, a linearized mixed finite volume element (MFVE) scheme is proposed to solve the nonlinear time fractional fourth-order reaction–diffusion models with the Riemann–Liouville time fractional derivative. By introducing an auxiliary variable σ = Δ u , the original fourth-order model is reformulated into a lower-order coupled system. The first-order time derivative and the time fractional derivative are discretized by using the BDF2 formula and the weighted and shifted Grünwald difference (WSGD) formula, respectively. Then, a fully discrete MFVE scheme is constructed by using the primal and dual grids. The existence and uniqueness of a solution for the MFVE scheme are proven based on the matrix theories. The scheme’s unconditional stability is rigorously derived by using the Gronwall inequality in detail. Moreover, the optimal error estimates for u in the discrete L ( L 2 ( Ω ) ) and L 2 ( H 1 ( Ω ) ) norms and for σ in the discrete L 2 ( L 2 ( Ω ) ) norm are obtained. Finally, three numerical examples are given to confirm its feasibility and effectiveness.

1. Introduction

Reaction–diffusion models can be used to describe many practical phenomena in scientific and engineering fields [1,2,3]. For example, in population biology applications, the reaction term captures growth dynamics, and the diffusion term characterizes migration processes [4]. Specifically, fourth-order reaction–diffusion models have an important role in some specialized fields, such as wave propagation in beams, brain warping, the generation of grooves on a flat surface, strain gradient elasticity, fluids in lungs, pattern formation in bistable systems, and so on. One can refer to references [5,6,7,8,9,10] for the corresponding applications. However, some anomalous diffusion phenomena no longer follow Gauss’s statistical law or Fick’s law [11,12], and cannot be adequately simulated by classical diffusion or reaction–diffusion models, which require the adoption of fractional models. Based on the above background and practical applications, in the current work, our goal is to numerically solve the following nonlinear time fractional fourth-order reaction–diffusion (FORD) models:
u ( x , t ) t α Δ u ( x , t ) t α Δ u ( x , t ) + Δ 2 u ( x , t ) + g ( u ( x , t ) ) = f ( x , t ) , ( x , t ) Ω × J , u ( x , t ) = Δ u ( x , t ) = 0 , ( x , t ) Ω × J , u ( x , 0 ) = u 0 ( x ) , x Ω ,
where Δ is the Laplacian operator, J = ( 0 , T ] is the time interval with 0 < T < , and Ω R 2 is a bounded convex polygonal domain with a boundary Ω . The source function f ( x , t ) and initial data u 0 ( x ) are known functions. In (1), the Riemann–Liouville time fractional derivative term is presented as follows:
α Δ u ( x , t ) t α = 1 Γ ( 1 α ) t 0 t Δ u ( x , s ) ( t s ) α d s ,
where 0 < α < 1 . Moreover, we assume that the nonlinear term g ( u ) satisfies the Lipschitz condition, that is, | g ( u 1 ) g ( u 2 ) | L | u 1 u 2 | , where L is a positive constant.
In recent years, numerous numerical methods have been employed to solve fractional-order fourth-order PDEs. Vong and Wang [13] established a high-order compact finite difference (FD) scheme to solve the fourth-order fractional subdiffusion model. Liu et al. [14] designed an MFE scheme to solve a time fractional FORD equation. Zhang and Pu [15] constructed a second-order compact FD scheme to solve the fourth-order fractional subdiffusion equation by using the L 2 1 σ formula. Liu et al. [16] proposed an FE method to solve a time fractional fourth-order diffusion model with a nonlinear term. Nikan et al. [17] proposed a local radial basis function method to solve the time fractional FORD equation. Wang et al. [18] constructed a fully discrete MFE scheme based on the modified L 1 Crank–Nicolson method to solve a nonlinear fourth-order fractional diffusion-wave equation. Guo et al. [19] proposed a double exponential Sinc-Galerkin method to solve the nonlinear fourth-order time fractional equation. Zhang and Feng [20] proposed a mixed virtual element algorithm to solve the time fractional fourth-order subdiffusion model. Haghi et al. [21] designed a fourth-order compact FD scheme to solve the nonlinear time fractional FORD equation. Zhang et al. [22] constructed a block-centered FD scheme to solve time fractional fourth-order parabolic equations. An and Huang [23] constructed a nonuniform Alikhanov scheme to solve the time fractional fourth-order diffusion-wave model. Here, we will develop a time second-order MFVE method to solve the nonlinear time fractional FORD models with the aid of the WSGD formula.
The WSGD formula was proposed by Tian et al. [24] to approximate the Riemann–Liouville fractional derivative. In contrast to the L 1 formula [25,26], the WSGD formula can achieve the second-order convergence accuracy that does not depend on fractional parameters. Since then, this approximation formula has been rapidly developed. Wang and Vong [27] constructed compact FD schemes based on the WSGD formula to solve two fractional models, including the subdiffusion model and the diffusion-wave model. Wang et al. [28] proposed a H 1 -Galerkin MFE method to solve the nonlinear time fractional convection–diffusion equation. Liu et al. [29] proposed some second-order θ schemes to solve the nonlinear fractional cable equation by combining it with the WSGD formula. Fang et al. [30] constructed a fast TT-M FVE algorithm to solve the nonlinear time fractional coupled diffusion equation. Zhang et al. [31] proposed a compact FD scheme with the WSGD formula to solve the time fractional integro-differential model. Fang et al. [32] designed fast two-grid FVE algorithms to solve the nonlinear time fractional mobile/immobile transport model by combining the WSGD formula with Crank–Nicolson scheme. Ali et al. [33] considered augmented FV methods with the WSGD formula to solve nonlinear time fractional degenerate parabolic equation. Wang et al. [34] constructed a two-grid MFE algorithm based on the WSGD formula and BDF2- θ scheme to solve the nonlinear fractional pseudo-hyperbolic wave model.
In this paper, our main purpose is to present a time second-order MFVE method for solving the nonlinear time fractional FORD models with the Riemann–Liouville time fractional derivative by combining the WSGD formula and the FVE method [35,36,37,38,39]. We introduce an auxiliary variable σ ( x , t ) to express (1) as the lower-order couple system, employ the WSGD formula to approximate the Riemann–Liouville time fractional derivative, design primal and dual grids for a space region Ω , and establish the MFVE scheme through an interpolation operator I h . In our theoretical analysis, we prove the existence and uniqueness of the solution for the MFVE scheme by means of the matrix theories, give the unconditional stability results, and obtain the optimal error estimates for u in the discrete L ( L 2 ( Ω ) ) and L 2 ( H 1 ( Ω ) ) norms and for σ in the discrete L 2 ( L 2 ( Ω ) ) norm. Finally, we give three numerical examples to validate the effectiveness and convergence accuracy of the proposed MFVE method.
The rest of this paper is organized as follows. In Section 2, we construct a second-order fully discrete MFVE scheme for the nonlinear time fractional FORD equations. In Section 3, we give the proof of the existence and uniqueness of discrete solution based on the matrix theories in detail. The unconditional stability and optimal error estimates are derived in Section 4 and Section 5, respectively. Finally, some numerical results are presented to demonstrate the feasibility and effectiveness in Section 6. Moreover, the notation C is denoted as a generic positive constant, which is independent of the grid parameters and has different values at different occurrences.

2. Linearized MFVE Scheme

We first define a new auxiliary variable σ ( x , t ) = Δ u ( x , t ) and subsequently reformulate (1) as follows:
u ( x , t ) t α Δ u ( x , t ) t α Δ u ( x , t ) + Δ σ ( x , t ) + g ( u ( x , t ) ) = f ( x , t ) , ( x , t ) Ω × J , σ ( x , t ) = Δ u ( x , t ) , ( x , t ) Ω × J , u ( x , t ) = σ ( x , t ) = 0 , ( x , t ) Ω × J , u ( x , 0 ) = u 0 ( x ) , x Ω .
Next, we introduce an equidistant partition of J ¯ = [ 0 , T ] given by 0 = t 0 < t 1 < < t N = T ; here, t n = n τ and τ = T / N with a positive integer N, n = 0 , 1 , , N . Given a function φ defined on [ 0 , T ] , we set φ n = φ ( t n ) and
t 2 ϕ n + 1 = ϕ 1 ϕ 0 τ , if   n = 0 , 3 ϕ n + 1 4 ϕ n + ϕ n 1 2 τ , if   n 1 .
Then, we apply t 2 u n + 1 to approximate u ( x , t n + 1 ) t , that is
u ( x , t n + 1 ) t = t 2 u n + 1 + E u , t n + 1 ,
where the truncation error E u , t n + 1 satisfies the following estimate:
E u , t n + 1 = u ( x , t n + 1 ) t t 2 u n + 1 = O ( τ ) , if   n = 0 , O ( τ 2 ) , if   n 1 .
For approximating the fractional derivative α Δ u ( x , t ) t α at time t = t n + 1 , we select the WSGD formula [24] as follows:
α Δ u ( x , t n + 1 ) t α = τ α k = 0 n + 1 q α ( k ) Δ u n k + 1 + E u , α n + 1 ,
with the truncation error E u , α n + 1 = O ( τ 2 ) , and
q α ( k ) = α + 2 2 g 0 α , if   k = 0 , α + 2 2 g k α + α 2 g k 1 α , if   k > 0 ,
g 0 α = 1 ,   g k α = Γ ( k α ) Γ ( α ) Γ ( k + 1 ) ,   g k α = 1 α + 1 k g k 1 α ,   k 1 .
From [28], we use the linearized formulation denoted by G [ u n + 1 ] to approximate the nonlinear item g ( u ) at t = t n + 1 , that is,
G [ u n + 1 ] = g ( u 0 ) , if   n = 0 , 2 g ( u n ) g ( u n 1 ) , if   n 1 ,
where the truncation error denoted by E g n + 1 satisfies
E g n + 1 = g ( u n + 1 ) G [ u n + 1 ] = O ( τ ) , if   n = 0 , O ( τ 2 ) , if   n 1 .
Thus, we can rewrite the system (3) at t = t n + 1 as follows:
( a ) t 2 u n + 1 τ α k = 0 n + 1 q α ( k ) Δ u n k + 1 Δ u n + 1 + Δ σ n + 1 + G [ u n + 1 ] = f n + 1 E u , t n + 1 E u , α n + 1 E g n + 1 , ( a ) σ n + 1 = Δ u n + 1 .
Let T h = { K } be a quasi-uniform triangular grid with the maximum diameter h = max { h K } for the domain Ω , and denote Z h as the set of all vertices in T h . We also need to construct the corresponding dual grid T h . Observing Figure 1 (see [30]), for a node z 0 Z h 0 with its immediate nodes z i ( i = 1 , 2 , , k ) , denote M i as the midpoint of the edge z 0 z i ¯ and adopt a special point Q i (such as barycenter in Figure 1 (left) or circumcenter in Figure 1 (right)) in a triangle z 0 z i z i + 1 with z k + 1 = z 1 . A control volume K z 0 can then be constructed by connecting M 1 , Q 1 , , M k , Q k , M 1 . In addition, if z 0 is on the boundary, we can similarly construct the corresponding control volume.
Base on the above partitions, we select the following linear element space V h as the trial function space:
V h = { v H 0 1 ( Ω ) : v | K P 1 ( K ) ,   K T h } ,
and select V h as the test function space, that is,
V h = { v L 2 ( Ω ) : v | K z P 0 ( K z ) ,   K z T h , and   v | Ω = 0 } .
Let φ z be the standard nodal linear basis function with respect to the node z, and ψ z be the characteristic function of the control volume K z ; then, V h = span { φ z ( x ) : z Z h 0 } and V h = span { ψ z ( x ) : z Z h 0 } . Consider two interpolation operators I h : C ( Ω ¯ ) V h and I h : C ( Ω ¯ ) V h , defined as follows:
I h v ( x ) = z Z h 0 v ( z ) φ z ( x ) ,
I h v ( x ) = z Z h 0 v ( z ) ψ z ( x ) .
From [35], we know that
v I h v k C h 2 k v 2 ,   k = 0 , 1 ,   v H 2 ( Ω ) ,
v I h v C h v 1 ,   v H 1 ( Ω ) .
Now, integrating (3) over every control volume K z , and applying the Green formula and operator I h , we have
( a ) ( t 2 u n + 1 , I h w h ) + τ α k = 0 n + 1 q α ( k ) a ( u n k + 1 , I h w h ) + a ( u n + 1 , I h w h ) a ( σ n + 1 , I h w h ) + ( G [ u n + 1 ] , I h w h ) = ( f n + 1 , I h w h ) ( E u , t n + 1 , I h w h ) ( E u , α n + 1 , I h w h ) ( E g n + 1 , I h w h ) , w h V h , ( b ) ( σ n + 1 , I h v h ) + a ( u n + 1 , I h v h ) = 0 , v h V h ,
where
a ( u ¯ , v ¯ ) = z Z h v ¯ ( z ) K z u ¯ · n d s , u ¯ V h , v ¯ V h , Ω u ¯ · v ¯ d x , u ¯ , v ¯ H 0 1 ( Ω ) ,
and n stands for the outer-normal direction on K z .
Let u h n and σ h n be the discrete solutions of u and σ at t = t n , respectively. Thus, we can obtain a linearized MFVE scheme: find ( u h n + 1 , σ h n + 1 ) V h × V h , ( n = 0 , 1 , , N 1 ) , such that
( a ) ( t 2 u h n + 1 , I h w h ) + τ α k = 0 n + 1 q α ( k ) a ( u h n k + 1 , I h w h ) + a ( u h n + 1 , I h w h ) a ( σ h n + 1 , I h w h ) = ( G [ u h n + 1 ] , I h w h ) + ( f n + 1 , I h w h ) ,   w h V h , ( b ) ( σ h n + 1 , I h v h ) + a ( u h n + 1 , I h v h ) = 0 ,   v h V h ,
where ( u h 0 , σ h 0 ) V h × V h satisfies
( a ) a ( σ h 0 , I h w h ) = a ( σ 0 , I h w h ) , w h V h , ( b ) a ( u h 0 , I h v h ) + ( σ h 0 , I h v h ) = 0 , v h V h ,
and σ 0 ( x , t ) = Δ u 0 ( x , t ) .
Remark 1.
In the above MFVE scheme, we specifically select ( u h 0 , σ h 0 ) , which satisfies (22), that is, u h 0 = R h u 0 and σ h 0 = R h σ 0 , where R h is the MFVE projection defined in (54). This choice is extremely necessary in error estimates in Section 5.

3. Existence and Uniqueness

We first give some lemmas to prove the uniqueness of existence and subsequent theoretical analysis.
Lemma 1 
([35]). For the bilinear form ( · , I h · ) , it can be obtained that
( w h , I h z h ) = ( w h , I h z h ) ,   w h , z h V h .
Moreover, there exist two constants μ 1 > 0 and μ 2 > 0 independent of h such that
( z h , I h z h ) μ 1 z h 2 ,   z h V h ,
( z h , I h w h ) μ 2 z h w h ,   z h , w h V h .
Lemma 2 
([35,36]). For the bilinear form a ( · , I h · ) , the following property holds:
a ( w h , I h z h ) = a ( z h , I h w h ) ,   w h , z h V h .
Moreover, there exist three positive constants h 0 , μ 3 and μ 4 such that, for 0 < h h 0 ,
a ( z h , I h z h ) μ 3 z h 1 2 ,   z h V h ,
a ( z h , I h w h ) μ 4 z h 1 w h 1 ,   z h , w h V h .
Lemma 3 
([24,27,30]). For a sequence { q α ( k ) } k = 1 defined by (11), and an arbitrary positive integer P, if a real vector ( ϕ 0 , ϕ 1 , , ϕ P ) R P + 1 , then
n = 0 P k = 0 n q α ( k ) ( ϕ n k , I h ϕ n ) 0 .
Lemma 4 
([30]). For a function sequence { ψ n } n = 0 in L 2 ( Ω ) , it can be obtained that
( t 2 ψ n + 1 , I h ψ n + 1 ) 1 2 τ [ ( ψ 1 , I h ψ 1 ) ( ψ 0 , I h ψ 0 ) ] ,   if   n = 0 , 1 4 τ ( Λ [ ψ n + 1 , ψ n ] Λ [ ψ n , ψ n 1 ] ) ,   if   n 1 ,
where
Λ [ ψ n , ψ n 1 ] ( ψ n , I h ψ n ) + ( 2 ψ n ψ n 1 , I h ( 2 ψ n ψ n 1 ) ) .
Theorem 1.
The MFVE scheme (21) has a unique solution.
Proof. 
Let { φ i : i = 1 , 2 , M Z 0 } be the basis V h , where M Z 0 is the number of all interior vertices. Then, { u h n , σ h n } V h × V h can be expanded as follows:
u h n ( x ) = i = 1 M Z 0 u ˜ i n φ i ( x ) ,   σ h n ( x ) = i = 1 M Z 0 σ ˜ i n φ i ( x ) .
Substituting (32) into (21) and selecting w h = φ j , v h = φ j ( j = 1 , 2 , , M Z 0 ) , we can obtain the following matrix form:
A 1 + τ 1 α q α ( 0 ) A 2 + τ A 2 τ A 2 A 2 A 1 u ˜ 1 σ ˜ 1 = C 0 ,
and
3 2 A 1 + τ 1 α q α ( 0 ) A 2 + τ A 2 τ A 2 A 2 A 1 u ˜ n + 1 σ ˜ n + 1 = D 0 ,   n 1 ,
where
u ˜ n = ( u ˜ 1 n , u ˜ 2 n , , u ˜ M Z 0 n ) T ,   σ ˜ n = ( σ ˜ 1 n , σ ˜ 2 n , , σ ˜ M Z 0 n ) T , A 1 = ( ( φ i , I h φ j ) ) i , j = 1 , , M Z 0 , A 2 = ( a ( φ i , I h φ j ) ) i , j = 1 , , M Z 0 , G ˜ ( u ˜ n ) = ( ( g ( u h n ) , I h φ j ) ) j = 1 , , M Z 0 T , F n = ( ( f ( t n ) , I h φ j ) ) j = 1 , , M Z 0 T ,
and
C = A 1 u ˜ 0 τ 1 α q α ( 1 ) A 2 u ˜ 0 τ G ˜ ( u ˜ 0 ) + τ F 1 , D = 2 A 1 u ˜ n 1 2 A 1 u ˜ n 1 τ 1 α k = 1 n + 1 q α ( k ) A 2 u ˜ n k + 1 2 τ G ˜ ( u ˜ n ) + τ G ˜ ( u ˜ n 1 ) + τ F n + 1 .
Noting that matrices A 1 and A 2 are symmetric positive, we have
E τ A 2 A 1 1 0 E A 1 + τ 1 α q α ( 0 ) A 2 + τ A 2 τ A 2 A 2 A 1 = B 1 0 A 2 A 1 ,
and
E τ A 2 A 1 1 0 E 3 2 A 1 + τ 1 α q α ( 0 ) A 2 + τ A 2 τ A 2 A 2 A 1 = B 2 0 A 2 A 1 ,
where B 1 = A 1 + τ 1 α q α ( 0 ) A 2 + τ A 2 + τ A 2 A 1 1 A 2 and B 2 = 3 2 A 1 + τ 1 α q α ( 0 ) A 2 + τ A 2 + τ A 2 A 1 1 A 2 . It is easy to see that B 1 and B 2 are invertible, so the coefficient matrices of (33) and (34) are invertible. This conclusion implies that the MFVE scheme (21) has a unique solution. □

4. Stability Analysis

In this section, we intend to present the unconditional stability results for the MFVE scheme (21) and (22).
Theorem 2.
Let ( u h n + 1 , σ h n + 1 ) V h × V h be the solutions of the MFVE system (21), then it follows that
u h n + 1 + τ k = 0 n u h k + 1 1 2 1 2 + τ k = 0 n σ h k + 1 2 1 2 C u h 0 + τ 1 α 2 u h 0 1 + g ( 0 ) + sup t [ 0 , T ] f ( t ) .
Proof. 
Taking w h = u h n + 1 and v h = σ h n + 1 in (21), and applying Lemma 2, we have
( t 2 u h n + 1 , I h u h n + 1 ) + τ α k = 0 n + 1 q α ( k ) a ( u h n k + 1 , I h u h n + 1 ) + a ( u h n + 1 , I h u h n + 1 ) + ( σ h n + 1 , I h σ h n + 1 ) = ( G [ u h n + 1 ] , I h u h n + 1 ) + ( f n + 1 , I h u h n + 1 ) .
Utilizing Lemmas 1 and 2 and the Young inequality, we obtain
( t 2 u h n + 1 , I h u h n + 1 ) + τ α k = 0 n + 1 q α ( k ) a ( u h n k + 1 , I h u h n + 1 ) + μ 3 u h n + 1 1 2 + ( σ h n + 1 , I h σ h n + 1 ) C ( G [ u h n + 1 ] 2 + f n + 1 2 ) + μ 3 2 u h n + 1 2 .
Noting that g ( u ˜ ) satisfies the Lipschitz condition, we have g ( u ˜ ) L u ˜ + g ( 0 ) . From the expression of G [ u h n + 1 ] and the triangle inequality, when n 1 , we have
G [ u h n + 1 ] 2 2 g ( u h n ) g ( u h n 1 ) 2 C ( u h n 2 + u h n 1 2 + g ( 0 ) 2 ) ,
and when n = 0 , we have
G [ u h 1 ] 2 = g ( u h 0 ) 2 C ( u h 0 2 + g ( 0 ) 2 ) .
Next, when n 1 in (37), utilizing Lemma 4, we have
1 4 τ ( Λ [ u h n + 1 , u h n ] Λ [ u h n , u h n 1 ] ) + τ α k = 0 n + 1 q α ( k ) a ( u h n k + 1 , I h u h n + 1 ) + μ 3 2 u h n + 1 1 2 + ( σ h n + 1 , I h σ h n + 1 ) C ( u h n 2 + u h n 1 2 + g ( 0 ) 2 + f n + 1 2 ) .
Multiplying (41) by 4 τ and summing over n from 1 to M, we have
Λ [ u h M + 1 , u h M ] + 4 τ 1 α n = 1 M k = 0 n + 1 q α ( k ) a ( u h n k + 1 , I h u h n + 1 ) + 2 μ 3 τ n = 1 M u h n + 1 1 2 + 4 τ n = 1 M ( σ h n + 1 , I h σ h n + 1 ) Λ [ u h 1 , u h 0 ] + C τ n = 1 M ( u h n 2 + u h n 1 2 ) + C τ n = 1 M ( g ( 0 ) 2 + f n + 1 2 ) .
When n = 0 in (37), noting that ( t 2 u h 1 , I h u h 1 ) 1 2 τ [ ( u h 1 , I h u h 1 ) ( u h 0 , I h u h 0 ) ] , multiplying (37) by 2 τ , and applying Lemmas 1 and 2, we obtain
( u h 1 , I h u h 1 ) + 2 τ 1 α k = 0 1 q α ( k ) a ( u h 1 k , I h u h 1 ) + 2 μ 3 τ u h 1 1 2 + 2 τ ( σ h 1 , I h σ h 1 ) ( u h 0 , I h u h 0 ) + C τ ( G [ u h 1 ] 2 + f 1 2 ) + μ 3 τ u h 1 2 .
Substituting (40) into (43) yields
( u h 1 , I h u h 1 ) + 2 τ 1 α k = 0 1 q α ( k ) a ( u h 1 k , I h u h 1 ) + μ 3 τ u h 1 1 2 + 2 τ ( σ h 1 , I h σ h 1 ) ( u h 0 , I h u h 0 ) + C τ ( u h 0 2 + g ( 0 ) 2 + f 1 2 ) .
Then, (44) is rewritten as the following result:
( u h 1 , I h u h 1 ) + 2 τ 1 α n = 0 1 k = 0 n q α ( k ) a ( u h 1 k , I h u h 1 ) + μ 3 τ u h 1 1 2 + 2 τ ( σ h 1 , I h σ h 1 ) ( u h 0 , I h u h 0 ) + 2 τ 1 α q α ( 0 ) a ( u h 0 , I h u h 0 ) + C τ ( u h 0 2 + g ( 0 ) 2 + f 1 2 ) .
Applying Lemma 3 in (45), we have
( u h 1 , I h u h 1 ) ( u h 0 , I h u h 0 ) + 2 τ 1 α q α ( 0 ) a ( u h 0 , I h u h 0 ) + C τ ( u h 0 2 + g ( 0 ) 2 + f 1 2 ) .
Now, from (42) and (44), we obtain
Λ [ u h M + 1 , u h M ] + 2 ( u h 1 , I h u h 1 ) + 4 τ 1 α n = 0 M k = 0 n + 1 q α ( k ) a ( u h n k + 1 , I h u h n + 1 ) + 2 μ 3 τ n = 0 M u h n + 1 1 2 + 4 τ n = 0 M ( σ h n + 1 , I h σ h n + 1 ) Λ [ u h 1 , u h 0 ] + 2 ( u h 0 , I h u h 0 ) + C τ n = 0 M u h n 2 + C τ n = 0 M ( g ( 0 ) 2 + f n + 1 2 ) .
Applying Lemma 4, we have
Λ [ u h 1 , u h 0 ] = ( u h 1 , I h u h 1 ) + ( 2 u h 1 u h 0 , I h ( 2 u h 1 u h 0 ) ) 9 ( u h 1 , I h u h 1 ) + 2 ( u h 0 , I h u h 0 ) .
Substituting (48) into (47), and making use of (46), we rewrite (47) as the following result:
Λ [ u h M + 1 , u h M ] + 2 ( u h 1 , I h u h 1 ) + 4 τ 1 α n = 0 M + 1 k = 0 n q α ( k ) a ( u h n k , I h u h n ) + 2 μ 3 τ n = 0 M u h n + 1 1 2 + 4 τ n = 0 M ( σ h n + 1 , I h σ h n + 1 ) 13 ( u h 0 , I h u h 0 ) + 18 τ 1 α q α ( 0 ) a ( u h 0 , I h u h 0 ) + C τ n = 0 M u h n 2 + C τ n = 0 M ( g ( 0 ) 2 + f n + 1 2 ) .
Making use of the discrete Gronwall lemma and Lemma 3, we have
Λ [ u h M + 1 , u h M ] + 2 ( u h 1 , I h u h 1 ) + 2 μ 3 τ n = 0 M u h n + 1 1 2 + 4 τ n = 0 M ( σ h n + 1 , I h σ h n + 1 ) C u h 0 2 + τ 1 α u h 0 1 2 + g ( 0 ) 2 + sup t [ 0 , T ] f ( t ) 2 .
Then, utilizing Lemma 1 finalizes the proof. □

5. Convergence Analysis

In order to obtain the error estimates for the MFVE scheme (21)–(22), we first introduce a projection operator P h : H 0 1 ( Ω ) H 2 ( Ω ) V h as follows:
a ( v P h v , I h w h ) = 0 ,   w h V h .
Lemma 5 
([35]). For the projection operator P h , the following estimates can be obtained:
v P h v 1 C h | v | 2 ,   v H 0 1 ( Ω ) H 2 ( Ω ) ,
v P h v C h 2 v 3 , p ,   v H 0 1 ( Ω ) W 3 , p ( Ω ) ,   p > 1 .
For ( u , σ ) : [ 0 , T ] H 0 1 ( Ω ) × H 0 1 ( Ω ) , we also need to introduce an MFVE projection ( R h u , R h σ ) : [ 0 , T ] V h × V h such that
( a ) a ( u R h u , I h v h ) + ( σ R h σ , I h v h ) = 0 , v h V h , ( b ) a ( σ R h σ , I h w h ) = 0 , w h V h .
Then, the MFVE projection R h satisfies the following estimates.
Lemma 6.
For the MFVE projection R h , we have
σ R h σ 1 C h | σ | 2 ,   σ H 0 1 ( Ω ) H 2 ( Ω ) ,
σ R h σ C h 2 σ 3 , p ,   σ H 0 1 ( Ω ) W 3 , p ( Ω ) ,
u R h u 1 C h | u | 2 + C h 2 σ 3 , p ,   u H 0 1 ( Ω ) H 2 ( Ω ) ,   σ H 0 1 ( Ω ) W 3 , p ( Ω ) ,
u R h u C h 2 ( u 3 , p + σ 3 , p ) ,   u , σ H 0 1 ( Ω ) W 3 , p ( Ω ) ,
where p > 1 is a positive integer.
Proof. 
From (51) and (54) ( b ) , we can easily see that R h σ = P h σ . Then, we obtain the estimates (55) and (56). Next, making use of (54) ( a ) , we have
a ( u P h u + P h u R h u , I h v h ) + ( σ R h σ , I h v h ) = 0 ,   v h V h .
From the definition of P h , we have
a ( P h u R h u , I h v h ) + ( σ R h σ , I h v h ) = 0 ,   v h V h .
Take v h = P h u R h u in (60) to obtain
a ( P h u R h u , I h ( P h u R h u ) ) C σ R h σ P h u R h u .
Noting that a ( P h u R h u , I h ( P h u R h u ) ) μ 3 P h u R h u 1 2 in (61), and making use of (56), we have
P h u R h u 1 C σ R h σ C h 2 σ 3 , p , p > 1 .
Finally, apply the triangle inequality and Lemma 5 to complete the proof. □
Now, we give the error analysis, and separate the errors as follows:
u ( t n ) u h n = u ( t n ) R h u ( t n ) + R h u ( t n ) u h n = ρ n + θ n , σ ( t n ) σ h n = σ ( t n ) R h σ ( t n ) + R h σ ( t n ) σ h n = ξ n + η n .
Making use of the MFVE projection (54), we give the following error equations:
( t 2 θ n + 1 , I h w h ) + τ α k = 0 n + 1 q α ( k ) a ( θ n k + 1 , I h w h ) + a ( θ n + 1 , I h w h ) a ( η n + 1 , I h w h ) = ( t 2 ρ n + 1 , I h w h ) + τ α k = 0 n + 1 q α ( k ) ( ξ n k + 1 , I h w h ) ( G [ u n + 1 ] G [ u h n + 1 ] , I h w h ) + ( ξ n + 1 , I h w h ) ( E u , t n + 1 , I h w h ) ( E u , α n + 1 , I h w h ) ( E g n + 1 , I h w h ) ,   w h V h ,
and
( η n + 1 , I h v h ) + a ( θ n + 1 , I h v h ) = 0 ,   v h V h ,
where η 0 = 0 and θ 0 = 0 .
Theorem 3.
Let ( u , σ ) be the solution of the lower-order model (3) and ( u h n , σ h n ) be the solution of the MFVE scheme (21) and (22). Then, it follows that
max 1 n N u ( t n ) u h n C ( h 2 + τ 2 ) , τ n = 1 N u ( t n ) u h n 1 2 1 2 C ( h + τ 2 ) , τ n = 1 N σ ( t n ) σ h n 2 1 2 C ( h 2 + τ 2 ) .
Proof. 
Choosing w h = θ n + 1 and v h = η n + 1 in (63) and (64), respectively, we obtain
( t 2 θ n + 1 , I h θ n + 1 ) + τ α k = 0 n + 1 q α ( k ) a ( θ n k + 1 , I h θ n + 1 ) + ( η n + 1 , I h η n + 1 ) + a ( θ n + 1 , I h θ n + 1 ) = ( t 2 ρ n + 1 , I h θ n + 1 ) + τ α k = 0 n + 1 q α ( k ) ( ξ n k + 1 , I h θ n + 1 ) + ( ξ n + 1 , I h θ n + 1 ) ( G [ u n + 1 ] G [ u h n + 1 ] , I h θ n + 1 ) ( E u , t n + 1 , I h θ n + 1 ) ( E u , α n + 1 , I h θ n + 1 ) ( E g n + 1 , I h θ n + 1 ) .
Noting that τ α k = 0 n + 1 q α ( k ) ξ n k + 1 = α ξ n + 1 t α E ξ , α n + 1 and applying Lemmas 1 and 2 and the Young inequality in (65), we have
( t 2 θ n + 1 , I h θ n + 1 ) + τ α k = 0 n + 1 q α ( k ) a ( θ n k + 1 , I h θ n + 1 ) + μ 1 η n + 1 2 + μ 3 θ n + 1 1 2 C [ t 2 ρ n + 1 2 + α ξ n + 1 t α 2 + E ξ , α n + 1 2 + ξ n + 1 2 + G [ u n + 1 ] G [ u h n + 1 ] 2 + E u , t n + 1 2 + E u , α n + 1 2 + E g n + 1 2 ] + μ 3 2 θ n + 1 2 .
For the item t 2 ρ n + 1 2 , when n 1 , applying the triangle inequality and Lemma 6, we have
t 2 ρ n + 1 2 = 3 ρ n + 1 3 ρ n 2 τ ρ n ρ n 1 2 τ 2 C τ t n 1 t n + 1 ρ t 2 d t C ( u t L ( W 3 , p ) + σ t L ( W 3 , p ) ) 2 h 4 ,   p 1 .
When n = 0 , we have
t 2 ρ 1 2 = ρ 1 ρ 0 τ 2 C τ t 0 t 1 ρ t 2 d t C ( u t L ( W 3 , p ) + σ t L ( W 3 , p ) ) 2 h 4 , p 1 .
Moreover, when n 1 , for the item G [ u n + 1 ] G [ U n + 1 ] 2 , we obtain
G [ u n + 1 ] G [ u h n + 1 ] 2 ( 2 g ( u n ) g ( u h n ) + g ( u n 1 ) g ( u h n 1 ) ) 2 C ( u n u h n + u n 1 u h n 1 ) 2 C ( ρ n 2 + ρ n 1 2 + θ n 2 + θ n 1 2 ) ,
and when n = 0 , we obtain
G [ u 1 ] G [ u h 1 ] 2 = g ( u 0 ) g ( u h 0 ) 2 C u 0 u h 0 2 C ρ 0 2 .
Now, applying Lemma 4, when n 1 in (66), we obtain
1 4 τ Λ [ θ n + 1 , θ n ] Λ [ θ n , θ n 1 ] + μ 3 2 θ n + 1 1 2 + τ α k = 0 n + 1 q α ( k ) a ( θ n k + 1 , I h θ n + 1 ) + μ 1 η n + 1 2 C ( h 4 + τ 4 + θ n 2 + θ n 1 2 ) .
Multiplying (71) by 4 τ , and summing over n from 1 to M, we obtain
Λ [ θ M + 1 , θ M ] + 4 τ 1 α n = 1 M k = 0 n + 1 q α ( k ) a ( θ n k + 1 , I h θ n + 1 ) + 2 μ 3 τ n = 1 M θ n + 1 1 2 + 4 μ 1 τ n = 1 M η n + 1 2 Λ [ θ 1 , θ 0 ] + C τ n = 1 M h 4 + τ 4 + θ n 2 + θ n 1 2 .
When n = 0 in (66), applying Lemma 4, we have
1 2 τ [ ( θ 1 , I h θ 1 ) ( θ 0 , I h θ 0 ) ] + a ( θ 1 , I h θ 1 ) + τ α k = 0 1 q α ( k ) a ( θ 1 k , I h θ 1 ) + ( η 1 , I h η 1 ) ( t 2 ρ 1 , I h θ 1 ) + ( α ξ 1 t α E ξ , α 1 , I h θ 1 ) ( G [ u 1 ] G [ u h 1 ] , I h θ 1 ) + ( ξ 1 , I h θ 1 ) ( E u , t 1 , I h θ 1 ) ( E u , α 1 , I h θ 1 ) ( E g 1 , I h θ 1 ) .
Multiplying (73) by 2 τ , applying Lemmas 1 and 2 and the Young inequality, we have
( θ 1 , I h θ 1 ) + 2 τ 1 α k = 0 1 q α ( k ) a ( θ 1 k , I h θ 1 ) + 2 μ 3 τ θ 1 1 2 + 2 μ 1 τ η 1 2 ( θ 0 , I h θ 0 ) + C τ 2 ( E u , t 1 2 + E u , α 1 2 + E g 1 2 ) + μ 3 τ θ 1 2 + 1 2 ( θ 1 , I h θ 1 ) + C τ t 2 ρ 1 2 + α ξ 1 t α 2 + E ξ , α 1 2 + ξ 1 2 + G [ u 1 ] G [ u h 1 ] 2 .
Applying Lemma 6, we have
( θ 1 , I h θ 1 ) + 4 τ 1 α k = 0 1 q α ( k ) a ( θ 1 k , I h θ 1 ) + 2 μ 3 τ θ 1 1 2 + 4 μ 1 τ η 1 2 2 ( θ 0 , I h θ 0 ) + C τ ( h 4 + τ 4 ) + C τ 4 .
Then, we rewrite (75) as the following result:
( θ 1 , I h θ 1 ) + 4 τ 1 α n = 0 1 k = 0 n q α ( k ) a ( θ 1 k , I h θ 1 ) + 2 μ 3 τ θ 1 1 2 + 4 μ 1 τ η 1 2 2 ( θ 0 , I h θ 0 ) + C τ ( h 4 + τ 4 ) + C τ 4 + 4 τ 1 α q α ( 0 ) a ( θ 0 , I h θ 0 ) .
Noting that θ 0 = 0 , from Lemma 3, we have
( θ 1 , I h θ 1 ) C τ ( h 4 + τ 4 ) + C τ 4 .
Now, adding (72) and (76), we have
Λ [ θ M + 1 , θ M ] + ( θ 1 , I h θ 1 ) + 4 τ 1 α n = 0 M k = 0 n + 1 q α ( k ) a ( θ n k + 1 , I h θ n + 1 ) + 2 μ 3 τ n = 0 M θ n + 1 1 2 + 4 μ 1 τ n = 0 M η n + 1 2 Λ [ θ 1 , θ 0 ] + C ( h 4 + τ 4 ) + C τ n = 0 M θ n 2 ,
Noting that Λ [ θ 1 , θ 0 ] = 5 ( θ 1 , I h θ 1 ) C τ ( h 4 + τ 4 ) + C τ 4 , we have
Λ [ θ M + 1 , θ M ] + ( θ 1 , I h θ 1 ) + 4 τ 1 α n = 0 M + 1 k = 0 n q α ( k ) a ( θ n k , I h θ n ) + 2 μ 3 τ n = 0 M θ n + 1 1 2 + 4 μ 1 τ n = 0 M η n + 1 2 C ( h 4 + τ 4 ) + C τ n = 0 M θ n 2 + 4 τ 1 α q α ( 0 ) ( θ 0 , I h θ 0 ) .
Noting that θ 0 = 0 , utilizing Lemma 3 and the discrete Gronwall lemma, we have
Λ [ θ M + 1 , θ M ] + ( θ 1 , I h θ 1 ) + 2 μ 3 τ n = 0 M θ n + 1 1 2 + 4 μ 1 τ n = 0 M η n + 1 2 C ( h 4 + τ 4 ) .
Finally, Lemmas 4 and 6 are applied to finish the proof. □

6. Numerical Examples

In this section, we provide three tests conducted to examine the effectiveness and convergence accuracy of the MFVE scheme (21) and (22).
Example 1.
In (1), select Ω = ( 0 , 1 ) 2 , J = ( 0 , 1 ] , g ( u ) = sin ( u ) , u 0 ( x ) = 0 , and f ( x , t ) as follows:
f ( x , t ) = 2 t + 16 π 2 t 2 α Γ ( 3 α ) + 8 π 2 t 2 + 64 π 4 t 2 sin ( 2 π x 1 ) sin ( 2 π x 2 ) + sin t 2 sin ( 2 π x 1 ) sin ( 2 π x 2 ) ,   x = ( x 1 , x 2 ) Ω .
The corresponding exact solutions of u and σ are obtained as follows:
u ( x , t ) = t 2 sin ( 2 π x 1 ) sin ( 2 π x 2 ) , σ ( x , t ) = 8 π 2 t 2 sin ( 2 π x 1 ) sin ( 2 π x 2 ) .
In the actual numerical calculation, for different fractional parameters, we conducted many numerical experiments, and provide herein the error behaviors in the following discrete norms:
u u h L ˜ ( L 2 ( Ω ) ) = max 1 n N u ( t n ) u h n , u u h L ˜ 2 ( H 1 ( Ω ) ) = τ n = 1 N u ( t n ) u h n 1 2 1 2 , σ σ h L ˜ 2 ( L 2 ( Ω ) ) = τ n = 1 N σ ( t n ) σ h n 2 1 2 .
We first take the fractional parameter α = 0.2 ,   0.4 ,   0.6 ,   0.8 ; select the time and space grid parameters ( h , τ ) = ( 2 10 , 1 10 ) , ( 2 20 , 1 20 ) , ( 2 40 , 1 40 ) , and ( 2 80 , 1 80 ) which satisfy h = 2 τ ; and provide the numerical results and error behaviors in Table 1, Table 2 and Table 3. It is easy to observe that the convergence orders for u in discrete L ( L 2 ( Ω ) ) norm are close to 2, and that for u in discrete L 2 ( H 1 ( Ω ) ) norm and for σ in discrete L 2 ( L 2 ( Ω ) ) , the convergence orders are close to 1. These error behaviors are in agreement with the numerical theoretical results in Theorem 3. Furthermore, to test whether the fractional parameter α has an impact on the algorithm when the parameters are sufficiently small and large, we specifically selected this parameter with values of 0.001 and 0.999 to carry out the above experiment. We provide the numerical results and error behaviors in Table 4, and obtained the same conclusions with respect to the convergence orders as that discussed on the other selections of fractional-order parameters.
Example 2.
In this example, we take the same Ω, J, and u 0 ( x ) as in Example 1, and select g ( u ) = u 3 u and f ( x , t ) as follows:
f ( x , t ) = ( 1 + α ) t α + 2 π 2 Γ ( 2 + α ) t Γ ( 2 ) + 2 π 2 t 1 + α + 4 π 4 t 1 + α sin ( π x 1 ) sin ( π x 2 ) + t 1 + α sin ( π x 1 ) sin ( π x 2 ) 3 t 1 + α sin ( π x 1 ) sin ( π x 2 ) ,   x = ( x 1 , x 2 ) Ω .
The corresponding exact solutions for u and σ are as follows:
u ( x , t ) = t 1 + α sin ( π x 1 ) sin ( π x 2 ) , σ ( x , t ) = 2 π 2 t 1 + α sin ( π x 1 ) sin ( π x 2 ) .
We first point out that the exact solutions here are dependent on the fractional parameter α and have lower regularity than in Example 1. Now, for different fractional parameters α = 0.2 ,   0.4 ,   0.6 ,   0.8 , we carried out the numerical tests with time and space grid parameters h = 2 τ as in Example 1. We also observed that the convergence orders for u in discrete L ( L 2 ( Ω ) ) norm are close to 2 (Table 5), and that for u in discrete L 2 ( H 1 ( Ω ) ) norm and for σ in discrete L 2 ( L 2 ( Ω ) ) , the convergence orders are close to 1 (Table 6 and Table 7). Otherwise, for the sufficiently small and large parameters α = 0.001 and 0.999 , we also carried out experiments and obtained the same conclusions as in Example 1 and observed that the convergence orders are independent of the fractional parameter α (Table 8), which is consistent with the truncation error of the WSGD formula. Finally, from the above numerical experiments, we can see that the linearized MFVE method for the time fractional FORD models with the nonlinear term is feasible and effective.
Example 3.
Consider the following nonlinear time fractional FORD model:
u ( x , t ) t α Δ u ( x , t ) t α Δ u ( x , t ) + Δ 2 u ( x , t ) + sin ( u ( x , t ) ) = 0 , ( x , t ) Ω × J , u ( x , t ) = Δ u ( x , t ) = 0 , ( x , t ) Ω × J , u ( x , 0 ) = u 0 ( x ) , x Ω ,
where  Ω = ( 1 , 1 ) 2 , J = ( 0 , 1 ] , and the initial data for  u 0 ( x )  are as follows:
u 0 ( x ) = k exp ( 1 / ( r 2 x 1 2 x 2 2 ) ) , if   x 1 2 + x 2 2 < r 2 , 0 , otherwise .
Then, we can obtain the corresponding σ 0 ( x ) = Δ u 0 ( x ) .
In this example, it should be pointed out that the source function f ( x , t ) = 0 , and it is difficult to obtain the exact solutions. Therefore, we mainly observe the change in numerical solutions at the initial and final moments and the influence of fractional parameters α . In order to conduct this experiment, we considered k = 100 and r = 0.35 in the initial data, and the spatial and temporal step sizes h = 2 / 50 and τ = 1 / 100 . In Figure 2, we show the projections of the initial data u 0 ( x ) and σ 0 ( x ) to depict the initial state, respectively. Now, we take the fractional parameters α = 0.001 and 0.999 , and show the projections of the numerical solutions u and σ at t = 1 in Figure 3 and Figure 4, respectively. It is easy to see that fractional parameters have a significant impact on the reaction–diffusion process.

7. Conclusions

In this paper, we design a time second-order linearized MFVE scheme to solve nonlinear time fractional FORD equations by using the BDF2 and WSGD formulas. This scheme harnesses the advantages of the FVE method to simultaneously compute two physical quantities with good accuracy. We give the proof of the existence and uniqueness of the discrete solution by using the matrix theories, derive the unconditional stability result in detail, and obtain the optimal error estimates for u and σ , where the temporal discretization achieves second-order accuracy unrelated to the fractional parameter α . Furthermore, we present some numerical results to validate the theoretical analysis, thereby demonstrating the advantages of the WSGD formula. In future work, we will consider combining the FVE method with some fast computational techniques to solve more fractional PDEs.

Author Contributions

Conceptualization, J.Z. and Z.F.; methodology, Z.F.; software, Z.F.; validation, J.Z., M.C. and Z.F.; writing—original draft preparation, J.Z.; writing—review and editing, M.C. and Z.F.; formal analysis, J.Z. and M.C.; funding acquisition, J.Z. and Z.F. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Natural Science Foundation of Inner Mongolia Autonomous Region (2024MS01013), the Scientific Research Projection of Higher Schools of Inner Mongolia Autonomous Region (NJZY23055), and the Central Government Guided Local Science and Technology Development Fund Project of China (2022ZY0175).

Data Availability Statement

Data are contained within the article.

Acknowledgments

The authors are very grateful to the editors and anonymous reviewers for their helpful comments and suggestions on improving this work.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Grindrod, P. The Theory and Applications of Reaction-Diffusion Equations, 2nd ed.; Oxford Applied Mathematics and Computing Science Series; The Clarendon Press Oxford University Press: New York, NY, USA, 1996. [Google Scholar]
  2. Rothe, F. Global Solutions of Reaction-Diffusion Systems; Lecture Notes in Mathematics; Springer: Berlin, Germany, 1984; Volume 1072. [Google Scholar]
  3. Britton, N.F. Reaction-Diffusion Equations and Their Applications to Biology; Academic Press Inc., Harcourt Brace Jovanovich Publishers: London, UK, 1986. [Google Scholar]
  4. Murray, J.D. Mathematical Biology, I, 3rd ed.; Interdisciplinary Applied Mathematic; Springer: New York, NY, USA, 2002; Volumes 17. [Google Scholar]
  5. Gorman, D.J. Free Vibration Analysis of Beams and Shafts; John Wiley & Sons Inc.: Hoboken, NJ, USA, 1975. [Google Scholar]
  6. Toga, A.W. Brain Warping; Elsevier: New York, NY, USA, 1998. [Google Scholar]
  7. Halpern, D.; Jensen, O.; Grotberg, J. A theoretical study of surfactant and liquid delivery into the lung. J. Appl. Physiol. 1988, 85, 333–352. [Google Scholar] [CrossRef] [PubMed]
  8. Agrawal, O.P. A General Solution for a Fourth-Order Fractional Diffusion-Wave Equation Defined in a Bounded Domain. Comput. Struct. 2001, 79, 1497–1501. [Google Scholar] [CrossRef]
  9. Memoli, F.; Sapiro, G.; Thompson, P. Implicit brain imaging. Hum. Brain Mapp. 2004, 23, 179–188. [Google Scholar] [CrossRef] [PubMed]
  10. Myers, T.G.; Charpin, J.P. A mathematical model for atmospheric ice accretion and water flow on a cold surface. Int. J. Heat Mass Transf. 2004, 47, 5483–5500. [Google Scholar] [CrossRef]
  11. Paradisi, P.; Cesari, R.; Mainardi, F.; Tampieri, F. The fractional Fick’s law for non-local transport processes. Physica A 2001, 293, 130–142. [Google Scholar] [CrossRef]
  12. Metzler, R.; Klafter, J. The random walk’s guide to anomalous diffusion: A fractional dynamics approach. Phys. Rep. 2002, 339, 1–77. [Google Scholar] [CrossRef]
  13. Vong, S.W.; Wang, Z.B. Compact finite difference scheme for the fourth-order fractional subdiffusion system. Adv. Appl. Math. Mech. 2014, 6, 419–435. [Google Scholar] [CrossRef]
  14. Liu, Y.; Fang, Z.C.; Li, H.; He, S. A mixed finite element method for a time-fractional fourth-order partial differential equation. Appl. Math. Comput. 2014, 243, 703–717. [Google Scholar] [CrossRef]
  15. Zhang, P.; Pu, H. A second-order compact difference scheme for the fourth-order fractional sub-diffusion equation. Numer. Algorithms 2017, 76, 573–598. [Google Scholar] [CrossRef]
  16. Liu, N.; Liu, Y.; Li, H.; Wang, J.F. Time second-order finite difference/finite element algorithm for nonlinear time-fractional diffusion problem with fourth-order derivative term. Comput. Math. Appl. 2018, 75, 3521–3536. [Google Scholar] [CrossRef]
  17. Nikan, O.; Machado, J.A.T.; Golbabai, A. Numerical solution of time-fractional fourth-order reaction-diffusion model arising in composite environments. Appl. Math. Model. 2021, 89, 819–836. [Google Scholar] [CrossRef]
  18. Wang, J.F.; Yin, B.L.; Liu, Y.; Li, H.; Fang, Z.C. A mixed element algorithm based on the modified L1 Crank–Nicolson scheme for a nonlinear fourth-order fractional diffusion-wave model. Fractal Fract. 2021, 5, 274. [Google Scholar] [CrossRef]
  19. Guo, J.; Pan, J.; Xu, D.; Qiu, W.L. A spectral order method for solving the nonlinear fourth-order time-fractional problem. J. Appl. Math. Comput. 2022, 68, 4645–4667. [Google Scholar] [CrossRef]
  20. Zhang, Y.D.; Feng, M.F. A mixed virtual element method for the time-fractional fourth-order subdiffusion equation. Numer. Algorithms 2022, 90, 1617–1637. [Google Scholar] [CrossRef]
  21. Haghi, M.; Ilati, M.; Dehghan, M. A fourth-order compact difference method for the nonlinear time-fractional fourth-order reaction-difusion equation. Eng. Comput. 2023, 39, 1329–1340. [Google Scholar] [CrossRef]
  22. Zhang, T.X.; Yin, Z.; Zhu, A.L. Block-centered finite-difference methods for time-fractional fourth-order parabolic equations. Fractal Fract. 2023, 7, 471. [Google Scholar] [CrossRef]
  23. An, Z.H.; Huang, C.B. Error analysis of the nonuniform Alikhanov scheme for the fourth-order fractional diffusion-wave equation. Fractal Fract. 2024, 8, 106. [Google Scholar] [CrossRef]
  24. Tian, W.Y.; Zhou, H.; Deng, W.H. A class of second order difference approximations for solving space fractional diffusion equations. Math. Comput. 2015, 84, 1703–1727. [Google Scholar] [CrossRef]
  25. Sun, Z.Z.; Wu, X.N. A fully discrete scheme for a diffusion-wave system. Appl. Numer. Math. 2006, 56, 193–209. [Google Scholar] [CrossRef]
  26. Lin, Y.M.; Xu, C.J. Finite difference/spectral approximations for the time-fractional diffusion equation. J. Comput. Phys. 2007, 225, 1533–1552. [Google Scholar] [CrossRef]
  27. Wang, Z.B.; Vong, S.W. Compact difference schemes for the modified anomalous fractional sub-diffusion equation and the fractional diffusion-wave equation. J. Comput. Phys. 2014, 277, 1–15. [Google Scholar] [CrossRef]
  28. Wang, J.F.; Liu, T.Q.; Li, H.; Liu, Y.; He, S. Second-order approximation scheme combined with H1-Galerkin MFE method for nonlinear time fractional convection-diffusion equation. Comput. Math. Appl. 2017, 73, 1182–1196. [Google Scholar] [CrossRef]
  29. Liu, Y.; Du, Y.W.; Li, H.; Liu, F.W.; Wang, Y.J. Some second-order θ schemes combined with finite element method for nonlinear fractional cable equation. Numer. Algorithms 2019, 80, 533–555. [Google Scholar] [CrossRef]
  30. Fang, Z.C.; Zhao, J.; Li, H.; Liu, Y. A fast time two-mesh finite volume element algorithm for the nonlinear time-fractional coupled diffusion model. Numer. Algorithms 2023, 93, 863–898. [Google Scholar] [CrossRef]
  31. Zhang, X.D.; Luo, Z.Y.; Tang, Q.; Wei, L.L.; Liu, J. Difference Approximation for 2D Time-Fractional Integro-Differential Equation with Given Initial and Boundary Conditions. Fractal Fract. 2024, 8, 495. [Google Scholar] [CrossRef]
  32. Fang, Z.C.; Zhao, J.; Li, H.; Liu, Y. Fast two-grid finite volume element algorithms combined with Crank-Nicolson scheme for the nonlinear time fractional mobile/immobile transport model. Int. J. Comput. Math. 2025. [Google Scholar] [CrossRef]
  33. Ali, M.A.; Zhang, Z.Y.; Xie, J.Q. Numerical analysis of augmented FVE for nonlinear time fractional degenerate parabolic equation. Int. J. Numer. Anal. Mod. 2025, 22, 340–360. [Google Scholar]
  34. Wang, Y.; Yang, Y.N.; Wang, N.; Li, H.; Liu, Y. Two-grid mixed finite element method combined with the BDF2-θ for a two-dimensional nonlinear fractional pseudo-hyperbolic wave equation. Results Appl. Math. 2025, 25, 100530. [Google Scholar] [CrossRef]
  35. Li, R.H.; Chen, Z.Y.; Wu, W. Generalized Difference Methods for Differential Equations: Numerical Analysis of Finite Volume Methods; Marcel Dekker: New York, NY, USA, 2000. [Google Scholar]
  36. Ewing, R.; Lazarov, R.; Lin, Y.P. Finite volume element approximations of nonlocal reactive flows in porous media. Numer. Methods Partial. Differ. Equ. 2000, 16, 285–311. [Google Scholar] [CrossRef]
  37. Chou, S.H.; Kwak, D.Y.; Li, Q. Lp error estimates and superconvergence for covolume or finite volume element methods. Numer. Methods Partial. Differ. Equ. 2003, 19, 463–486. [Google Scholar] [CrossRef]
  38. Karaa, S.; Pani, A.K. Error analysis of a FVEM for fractional order evolution equations with nonsmooth initial data. ESAIM M2AN 2018, 52, 773–801. [Google Scholar] [CrossRef]
  39. Fang, Z.C.; Zhao, J.; Li, H.; Liu, Y. Finite volume element methods for two-dimensional time fractional reaction-diffusion equations on triangular grids. Appl. Anal. 2023, 102, 2248–2270. [Google Scholar] [CrossRef]
Figure 1. The barycenter dual element (left) and the circumcenter dual element (right).
Figure 1. The barycenter dual element (left) and the circumcenter dual element (right).
Fractalfract 09 00481 g001
Figure 2. The initial data u 0 ( x ) (left) and σ 0 ( x ) (right).
Figure 2. The initial data u 0 ( x ) (left) and σ 0 ( x ) (right).
Fractalfract 09 00481 g002
Figure 3. The numerical solutions of u (left) and σ (right) at t = 1 with α = 0.001 .
Figure 3. The numerical solutions of u (left) and σ (right) at t = 1 with α = 0.001 .
Fractalfract 09 00481 g003
Figure 4. The numerical solutions of u (left) and σ (right) at t = 1 with α = 0.999 .
Figure 4. The numerical solutions of u (left) and σ (right) at t = 1 with α = 0.999 .
Fractalfract 09 00481 g004
Table 1. Error behaviors for u in discrete L ( L 2 ) norm with h = 2 τ in Example 1.
Table 1. Error behaviors for u in discrete L ( L 2 ) norm with h = 2 τ in Example 1.
α ( h , τ ) ( 2 10 , 1 10 ) ( 2 20 , 1 20 ) ( 2 40 , 1 40 ) ( 2 80 , 1 80 )
0.2 u u h L ˜ ( L 2 ) 5.766763 × 10 2 1.523696 × 10 2 3.862442 × 10 3 9.689649 × 10 4
Order 1.920187 1.979989 1.994997
0.4 u u h L ˜ ( L 2 ) 5.761139 × 10 2 1.522022 × 10 2 3.858078 × 10 3 9.678625 × 10 4
Order 1.920365 1.980035 1.995008
0.6 u u h L ˜ ( L 2 ) 5.755558 × 10 2 1.520359 × 10 2 3.853742 × 10 3 9.667672 × 10 4
Order 1.920544 1.980080 1.995019
0.8 u u h L ˜ ( L 2 ) 5.750367 × 10 2 1.518807 × 10 2 3.849693 × 10 3 9.657440 × 10 4
Order 1.920715 1.980124 1.995030
Table 2. Error behaviors for u in discrete L 2 ( H 1 ) norm with h = 2 τ in Example 1.
Table 2. Error behaviors for u in discrete L 2 ( H 1 ) norm with h = 2 τ in Example 1.
α ( h , τ ) ( 2 10 , 1 10 ) ( 2 20 , 1 20 ) ( 2 40 , 1 40 ) ( 2 80 , 1 80 )
0.2 u u h L ˜ 2 ( H 1 ) 6.521600 × 10 1 3.115402 × 10 1 1.515934 × 10 1 7.469699 × 10 2
Order 1.0658081.0392121.021085
0.4 u u h L ˜ 2 ( H 1 ) 6.521290 × 10 1 3.115354 × 10 1 1.515928 × 10 1 7.469691 × 10 2
Order 1.0657621.0391951.021080
0.6 u u h L ˜ 2 ( H 1 ) 6.520967 × 10 1 3.115303 × 10 1 1.515921 × 10 1 7.469683 × 10 2
Order 1.0657141.0391781.021076
0.8 u u h L ˜ 2 ( H 1 ) 6.520650 × 10 1 3.115253 × 10 1 1.515914 × 10 1 7.469674 × 10 2
Order 1.0656671.0391611.021071
Table 3. Error behaviors for σ in discrete L 2 ( L 2 ) norm with h = 2 τ in Example 1.
Table 3. Error behaviors for σ in discrete L 2 ( L 2 ) norm with h = 2 τ in Example 1.
α ( h , τ ) ( 2 10 , 1 10 ) ( 2 20 , 1 20 ) ( 2 40 , 1 40 ) ( 2 80 , 1 80 )
0.2 σ σ h L ˜ 2 ( L 2 ) 1.455052 × 10 + 0 3.429433 × 10 1 8.318115 × 10 2 2.047806 × 10 2
Order 2.0850282.0436422.022177
0.4 σ σ h L ˜ 2 ( L 2 ) 1.452570 × 10 + 0 3.422371 × 10 1 8.300050 × 10 2 2.043282 × 10 2
Order 2.0855402.0438042.022232
0.6 σ σ h L ˜ 2 ( L 2 ) 1.449962 × 10 + 0 3.414908 × 10 1 8.280916 × 10 2 2.038484 × 10 2
Order 2.0860962.0439842.022293
0.8 σ σ h L ˜ 2 ( L 2 ) 1.447383 × 10 + 0 3.407477 × 10 1 8.261807 × 10 2 2.033688 × 10 2
Order 2.0866712.0441752.022359
Table 4. Error behaviors with h = 2 τ in Example 1.
Table 4. Error behaviors with h = 2 τ in Example 1.
α ( h , τ ) ( 2 10 , 1 10 ) ( 2 20 , 1 20 ) ( 2 40 , 1 40 ) ( 2 80 , 1 80 )
0.001 u u h L ˜ ( L 2 ) 5.772113 × 10 2 1.525288 × 10 2 3.866594 × 10 3 9.700137 × 10 4
Order 1.9200181.9799461.994986
u u h L ˜ 2 ( H 1 ) 6.521881 × 10 1 3.115446 × 10 1 1.515940 × 10 1 7.469706 × 10 2
Order 1.0658491.0392261.021089
σ σ h L ˜ 2 ( L 2 ) 1.457286 × 10 + 0 3.435762 × 10 1 8.334267 × 10 2 2.051847 × 10 2
Order 2.0845822.0435032.022132
0.999 u u h L ˜ ( L 2 ) 5.745960 × 10 2 1.517481 × 10 2 3.846222 × 10 3 9.648663 × 10 4
Order 1.9208701.9801641.995041
u u h L ˜ 2 ( H 1 ) 6.520366 × 10 1 3.115207 × 10 1 1.515908 × 10 1 7.469667 × 10 2
Order 1.0656251.0391461.021067
σ σ h L ˜ 2 ( L 2 ) 1.445043 × 10 + 0 3.400646 × 10 1 8.244164 × 10 2 2.029258 × 10 2
Order 2.0872322.0443642.022421
Table 5. Error behaviors for u in discrete L ( L 2 ) norm with h = 2 τ in Example 2.
Table 5. Error behaviors for u in discrete L ( L 2 ) norm with h = 2 τ in Example 2.
α ( h , τ ) ( 2 10 , 1 10 ) ( 2 20 , 1 20 ) ( 2 40 , 1 40 ) ( 2 80 , 1 80 )
0.2 u u h L ˜ ( L 2 ) 1.471101 × 10 2 3.723406 × 10 3 9.336329 × 10 4 2.335700 × 10 4
Order 1.9822021.9956961.999001
0.4 u u h L ˜ ( L 2 ) 1.465757 × 10 2 3.708416 × 10 3 9.297074 × 10 4 2.325687 × 10 4
Order 1.9827711.9959551.999120
0.6 u u h L ˜ ( L 2 ) 1.459159 × 10 2 3.689962 × 10 3 9.248730 × 10 4 2.313357 × 10 4
Order 1.9834591.9962791.999267
0.8 u u h L ˜ ( L 2 ) 1.451090 × 10 2 3.667521 × 10 3 9.189935 × 10 4 2.298343 × 10 4
Order 1.9842601.9966791.999461
Table 6. Error behaviors for u in discrete L 2 ( H 1 ) norm with h = 2 τ in Example 2.
Table 6. Error behaviors for u in discrete L 2 ( H 1 ) norm with h = 2 τ in Example 2.
α ( h , τ ) ( 2 10 , 1 10 ) ( 2 20 , 1 20 ) ( 2 40 , 1 40 ) ( 2 80 , 1 80 )
0.2 u u h L ˜ 2 ( H 1 ) 1.929246 × 10 1 9.292205 × 10 2 4.554283 × 10 2 2.253807 × 10 2
Order 1.0539441.0287971.014860
0.4 u u h L ˜ 2 ( H 1 ) 1.841831 × 10 1 8.831872 × 10 2 4.318488 × 10 2 2.134527 × 10 2
Order 1.0603491.0321931.016610
0.6 u u h L ˜ 2 ( H 1 ) 1.768079 × 10 1 8.441087 × 10 2 4.117758 × 10 2 2.032851 × 10 2
Order 1.0666821.0355701.018355
0.8 u u h L ˜ 2 ( H 1 ) 1.704919 × 10 1 8.104293 × 10 2 3.944269 × 10 2 1.944856 × 10 2
Order 1.0729451.0389281.020094
Table 7. Error behaviors for σ in discrete L 2 ( L 2 ) norm with h = 2 τ in Example 2.
Table 7. Error behaviors for σ in discrete L 2 ( L 2 ) norm with h = 2 τ in Example 2.
α ( h , τ ) ( 2 10 , 1 10 ) ( 2 20 , 1 20 ) ( 2 40 , 1 40 ) ( 2 80 , 1 80 )
0.2 σ σ h L ˜ 2 ( L 2 ) 1.011536 × 10 1 2.423441 × 10 2 5.935657 × 10 3 1.475471 × 10 3
Order 2.0614192.0295772.008232
0.4 σ σ h L ˜ 2 ( L 2 ) 9.600324 × 10 2 2.288820 × 10 2 5.591883 × 10 3 1.386020 × 10 3
Order 2.0684792.0331982.012386
0.6 σ σ h L ˜ 2 ( L 2 ) 9.148462 × 10 2 2.170218 × 10 2 5.286904 × 10 3 1.306137 × 10 3
Order 2.0756892.0373452.017116
0.8 σ σ h L ˜ 2 ( L 2 ) 8.743685 × 10 2 2.063873 × 10 2 5.014040 × 10 3 1.236173 × 10 3
Order 2.0828872.0413092.020093
Table 8. Error behaviors with h = 2 τ in Example 2.
Table 8. Error behaviors with h = 2 τ in Example 2.
α ( h , τ ) ( 2 10 , 1 10 ) ( 2 20 , 1 20 ) ( 2 40 , 1 40 ) ( 2 80 , 1 80 )
0.001 u u h L ˜ ( L 2 ) 1.475184 × 10 2 3.734884 × 10 3 9.366412 × 10 4 2.343395 × 10 4
Order 1.9817601.9954951.998896
u u h L ˜ 2 ( H 1 ) 2.034201 × 10 1 9.841665 × 10 2 4.834960 × 10 2 2.395604 × 10 2
Order 1.0474881.0253981.013114
σ σ h L ˜ 2 ( L 2 ) 1.071138 × 10 1 2.578425 × 10 2 6.325435 × 10 3 1.566549 × 10 3
Order 2.0545822.0272532.013575
0.999 u u h L ˜ ( L 2 ) 1.441263 × 10 2 3.640531 × 10 3 9.119422 × 10 4 2.280341 × 10 4
Order 1.9851131.9971351.999693
u u h L ˜ 2 ( H 1 ) 1.650419 × 10 1 7.811777 × 10 2 3.793154 × 10 2 1.868106 × 10 2
Order 1.0791101.0422531.021821
σ σ h L ˜ 2 ( L 2 ) 8.377340 × 10 2 1.967926 × 10 2 4.768831 × 10 3 1.173929 × 10 3
Order 2.0898162.0449692.022290
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhao, J.; Cao, M.; Fang, Z. A Mixed Finite Volume Element Method for Nonlinear Time Fractional Fourth-Order Reaction–Diffusion Models. Fractal Fract. 2025, 9, 481. https://doi.org/10.3390/fractalfract9080481

AMA Style

Zhao J, Cao M, Fang Z. A Mixed Finite Volume Element Method for Nonlinear Time Fractional Fourth-Order Reaction–Diffusion Models. Fractal and Fractional. 2025; 9(8):481. https://doi.org/10.3390/fractalfract9080481

Chicago/Turabian Style

Zhao, Jie, Min Cao, and Zhichao Fang. 2025. "A Mixed Finite Volume Element Method for Nonlinear Time Fractional Fourth-Order Reaction–Diffusion Models" Fractal and Fractional 9, no. 8: 481. https://doi.org/10.3390/fractalfract9080481

APA Style

Zhao, J., Cao, M., & Fang, Z. (2025). A Mixed Finite Volume Element Method for Nonlinear Time Fractional Fourth-Order Reaction–Diffusion Models. Fractal and Fractional, 9(8), 481. https://doi.org/10.3390/fractalfract9080481

Article Metrics

Back to TopTop