Preprint
Article

This version is not peer-reviewed.

The Reduced-Dimension Method for Crank-Nicolson Mixed Finite Element Solution Coefficient Vectors of the Extended Fisher-Kolmogorov Equation

A peer-reviewed article of this preprint also exists.

Submitted:

28 August 2024

Posted:

29 August 2024

You are already at the latest version

Abstract
A reduced-dimension (RD) method based on the proper orthogonal decomposition (POD) technology and the linearized Crank-Nicolson mixed finite element (CNMFE) scheme for solving the 2D nonlinear Extended Fisher-Kolmogorov (EFK) equation is proposed. The method reduces CPU runtime and error accumulation by reducing the dimension of the unknown CNMFE solution coefficient vectors. For this purpose, The CNMFE scheme of the EFK equation is established and the uniqueness, stability and convergence of the CNMFE solutions are discussed. Subsequently, the matrix-based RDCNMFE scheme is derived by applying the POD method. Furthermore, the uniqueness, stability and error estimates of the linearized RDCNMFE solution are proved. Finally, numerical experiments are carried out to validate the theoretical findings. In addition, we contrast the RDCNMFE method with the CNMFE method, highlighting the advantages of the dimensionality reduction method.
Keywords: 
;  ;  ;  ;  ;  

1. Introduction

The primary goal of this research is to apply the POD-based reduced-dimension method to solve the following 2D nonlinear extended Fisher-Kolmogorov (EFK) equation
u t + γ Δ 2 u Δ u + f ( u ) = 0 , ( x , t ) Ω × J , u ( x , 0 ) = u 0 ( x ) , x Ω , u ( x , t ) = Δ u ( x , t ) = 0 , ( x , t ) Ω × J ¯ ,
in which Ω R d ( d = 2 , 3 ) is a bounded convex polygonal domain with boundary Ω . J = ( 0 , T ] is the time interval, where 0 < T < . Coefficient γ is a positive constant. u 0 ( x ) is known initial function. f ( u ) = u 3 u , is the Lipschitz continuous function of u, that is, there exists a positive constant C such that
| f ( u 1 ) f ( u 2 ) | C | u 1 u 2 | .
For simplicity, we assume that u 0 ( x ) = 0 in the following theoretical analysis.
When γ = 0 in (1), the second-order diffusion equation is obtained, which is called the standard Fisher-Kolmogorov equation. Coullet et al. [2] added a stabilizing fourth-order derivative term to obtain the equation (1), and called it as the extended Fisher-Kolmogorov equation. The EFK equation has very important physical background. It was applied to various kinds of physics and engineering. Because of the complexity of the equation, it is difficult to get its analytical solution. Therefore, it is very important to solve the equation numerically. And there have been a lot of research results on this equation. For instance, direct local boundary integral equation method [3], Fourier pseudo-spectral method [4], and modified cubic B-spline and polynomial based differential quadrature method [5,6] are applied to solve the EFK equation. Various four-order finite difference schemes [7,8,9,10] have been developed to solve the EFK equations, which have the four-order and second-order accuracy in space and time variables, respectively. He [11] used a three-level linearly implicit finite difference method to solve the 1D and 2D EFK equation, and the method is second-order convergent both in time and space direction. Sweilam et al. [12] studied stochastic EFK equation by combining the compact finite difference scheme and the semi-implicit Euler-Maruyama approach. Danumjaya and Pani [13] applied mixed finite element methods to solve the EFK equation with different types of boundary conditions. Doss and Nandini [14] employed a splitting technique to derive an H 1 -Galerkin mixed finite element scheme for the EFK equation. Wang et al. [15] used a new linearized CNMFE method to study the EFK equation, in which u belongs to the weaker ( L 2 ( Ω ) ) 2 space instead of the classical H ( div ; Ω ) space. In this paper, we establish the CNMFE scheme for the 2D EFK equation and analysis the uniqueness, stability and convergence of the CNMFE solutions.
However, in practical problems, using CNMFE method to solve EFK equations is a problem with a large number of unknowns, which makes running extremely slow, leads to an increase in rounding errors, and makes it difficult to obtain accurate numerical solutions. Therefore, it is crucial to lessen the number of unknowns in the CNMFE method of EFK equation to reduce the computational load, save CPU running time, and minimize the accumulation of rounding errors in the calculation process. The Proper orthogonal decomposition (POD) technology, reducing the amount of unknowns in numerical schemes, is an efficient dimensionality reduction method for solving partial differential equations (PDEs). It reduces the CPU running time and reduces the accumulation of round-off errors. POD technology can be applied to numerical methods of various PDEs, such as finite difference method [16,17,18], Schwarz domain decomposition method [19], finite spectral element method [20,21] etc. For reduced dimension FE and MFE models based on POD techniques, there are two dimensionality reduction method. One method is that the optimized models are established through reducing the dimension of the FE or MFE subspace. The parabolic equation [22], Sobolev equation [23], Burgers equation [24] and some other PDEs [25,26,27,28] are solved by the reduced-dimension method of constructing the POD subspace. The other is a new reduced-dimension method for the CNFE [29,30] and CNMFE [31,32,33,34] solution coefficient vectors proposed by Luo et al. in 2020. In [35], Luo and Yang combined unknown solution coefficient vector dimensionality reduction method and continuous space-time finite element method to study the 2D non-stationary incompressible Navier-Stokes equations.
Although there are existing reduce-order methods of the EFK equation, such as Literature [17], which combines the high-order compact finite difference scheme with the POD method to obtain the spatial sixth-order accuracy while greatly shortening the calculation time. Literature [33] uses the POD technique to reduce the dimensionality of the two-grid CNMFE solution coefficient vectors, in which, the matrix theory is used to deeply explore the stability and convergence of the TGRDECNMFE solutions. However, the reduce-dimension method proposed in this paper is theoretically significantly different from the above research methods. This paper integrates POD technology with the linearized CNMFE method, and proposes a new reduce-dimension method for 2D nonlinear EFK equations. In this study, we adopt the CN fully discrete format in the temporal direction to achieve second-order time accuracy. Additionally, we linearize the nonlinear term to significantly enhance computational speed and efficiency while preserving model accuracy. Unlike Literature [33], our work utilizes traditional finite element techniques to analyze uniqueness, stability, and convergence of the RDCNMFE solutions. Our proposed method combines the advantages of POD and linearized CNMFE methods for effective dimensionality reduction of the nonlinear EFK equation. This approach not only maintains accuracy but also greatly improves computational speed and efficiency, providing a novel insight and solution for solving the EFK equation.
The structure of this paper is as follows. In Section 2, we propose the CNMFE scheme and discuss the uniqueness, stability and convergence of the CNMFE solutions. In Section 3, we generate the POD basis to derive the reduce-dimension matrix model of the CNMFE solution coefficient vectors and analysis the uniqueness, stability and error estimate of the RDCNMFE solutions. In Section 4, we employ the numerical experiment of the 2D EFK equation to verify the effectiveness of RDCNMFE method and correctness of theoretical analysis. In Section 5, we summarize the major conclusions and findings.

2. The Crank-Nicolson Mixed Finite Element Method of the EFK Equation

2.1. The CNMFE Schemes

The Sobolev spaces and their corresponding norms mentioned in this paper adhere to standard definitions (see [1]). In order to develop the CNMFE scheme of the EFK equation (1), we initially introduce a diffusion term ω = Δ u , resulting in the following two lower-order equations
u t γ Δ ω + ω + f ( u ) = 0 , ( x , t ) Ω × J , Δ u = ω , ( x , t ) Ω × J .
Let V = H 0 1 ( Ω ) . With the Green’s formula, the mixed functional form of (3) is as follows.
Problem 1. 
Find { u , ω } : [ 0 , T ] V × V satisfying
( u t , v ) + γ ( ω , v ) + ( ω , v ) + ( f ( u ) , v ) = 0 , v V , ( ω , g ) ( u , g ) = 0 , g V , u ( x , 0 ) = 0 , ω ( x , 0 ) = 0 , x Ω .
Let h be the quasi-uniform triangulation subdivision on Ω ¯ . The FE subspace V h , spanned by the orthonormal basis { ζ j ( x ) } j = 1 M under the inner product in H 1 ( Ω ) , is defined as follows:
V h = { v h V C ( Ω ) ; v h K P M 1 ( K ) , K } = span { ζ j ( x ) : 1 j M } ,
in which P M 1 ( K ) is generated by ( M 1 ) th degree polynomials on K .
For given integer N > 0 , let Δ t = T / N , ϕ n = ϕ ( t n ) , ¯ t ϕ n = ( ϕ n ϕ n 1 ) / Δ t and ϕ n 1 2 = ( ϕ n + ϕ n 1 ) / 2 . Therefore, we can rewrite Problem 1 at time t = t n 1 2 in the following form.
( u t ( t n 1 2 ) , v ) + γ ( ω ( t n 1 2 ) , v ) + ( ω ( t n 1 2 ) , v ) + ( f ( u ( t n 1 2 ) ) , v ) = 0 , v V , ( ω ( t n 1 2 ) , g ) ( u ( t n 1 2 ) , g ) = 0 , g V .
Then, the equivalent expression of (6) is as follows.
( u n u n 1 Δ t , v ) + γ ( ω n 1 2 , v ) + ( ω n 1 2 , v ) + ( f ( u ^ ^ n 1 2 ) , v ) = ( R 1 n 1 2 , v ) + ( R 2 n 1 2 , v ) , v V , ( ω n 1 2 , g ) ( u n 1 2 , g ) = 0 , g V ,
where
f ( u ^ ^ n 1 2 ) = 3 2 f ( u n 1 ) 1 2 f ( u n 2 ) ,
R 1 n 1 2 = u n u n 1 Δ t u t ( t n 1 2 ) ,
R 2 n 1 2 = f ( u ^ ^ n 1 2 ) f ( u ( t n 1 2 ) ) .
Let { u h n , ω h n } represent the CNMFE approximations of solutions { u , ω } for Problem 1 at t n = n Δ t . Thus, the CNMFE model of Problem 1 can be constructed as follows.
Problem 2. 
Find { u h n , ω h n } V h × V h ( 1 n N ) satisfying
( ¯ t u h n , v h ) + γ ( ω h n 1 2 , v h ) + ( ω h n 1 2 , v h ) + ( f ( u ^ ^ h n 1 2 ) , v h ) = 0 , v h V h , ( ω h n 1 2 , g h ) ( u h n 1 2 , g h ) = 0 , g h V h , u h 0 ( x ) = 0 , ω h 0 ( x ) = 0 , x Ω .
Remark 1. 
By means of a linearized term
f ( u ^ ^ h n 1 2 ) = 3 2 f ( u h n 1 ) 1 2 f ( u h n 2 ) = 3 2 ( u h n 1 ) 3 1 2 ( u h n 2 ) 3 3 2 u h n 1 + 1 2 u h n 2 ,
we can observe that the formulation (11) is a linear scheme.

2.2. The Uniqueness, Stability and Convergence of the CNMFE Solutions

By employing the base functions of the FE space V h , the solutions { u h n , ω h n } of Problem 2 can be formulated in the form of
u h n = j = 1 M U h j n ζ j = ζ · U h n , ω h n = j = 1 M W h j n ζ j = ζ · W h n ,
where ζ = ( ζ 1 , ζ 2 , , ζ M ) is the orthonormal base, satisfied
( ζ i , ζ j ) = δ i j , i , j = 1 , 2 , , M .
U h n = ( U h 1 n , U h 2 n , , U h M n ) T and W h n = ( W h 1 n , W h 2 n , , W h M n ) T are the unknown coefficient vectors of CNMFE solutions. From the expression of the solutions { u h n , ω h n } of (13), Problem 2 can be represented equivalently in the following matrix model.
Problem 3. 
Find { U h n , W h n } R M × R M and { u h n , ω h n } V h × V h ( 1 n N ) satisfying
¯ t U h n + γ B W h n 1 2 + W h n 1 2 = F ( U ^ ^ h n 1 2 ) , W h n 1 2 BU h n 1 2 = 0 , u h n = j = 1 M U h j n ζ j = U h n · ζ , ω h n = j = 1 M W h j n ζ j = W h n · ζ ,
where
B = ( b i j ) 1 i , j M , b i j = ( ζ j , ζ i ) ,
and
F ( U ^ ^ h n 1 2 ) = ( 3 2 F ( U h n 1 ) 1 2 F ( U h n 2 ) ) = ( ( 3 2 ( f ( j = 1 M U h j n 1 ζ j ) , ζ i ) 1 2 ( f ( j = 1 M U h j n 2 ζ j ) , ζ i ) ) ) 1 i M .
Theorem 1. 
The Problem 3 has the unique solutions { u h n , ω h n } V h × V h .
Proof of Theorem 1. 
Problem 3 can be written as
I γ Δ t 2 B + Δ t 2 I B I U h n W h n = I γ Δ t 2 B Δ t 2 I B I U h n 1 W h n 1 Δ t F ( U ^ ^ h n 1 2 ) O ˜ ,
where I stands for the M × M unit matrix, and O ˜ denotes zero column vector of M × 1 .
From the definitions of matrices I and B , we know that they are positive definite and thus invertible. From (15), we can conclude that the coefficient matrix is invertible as well. Hence, there exists a unique set of solutions ( u h n , ω h n ) V h × V h for Problem 3.
In order to prove the stability of the CNMFE solutions, we need to introduce the properties of B in Problem 3.
Lemma 1. 
[[36], Lemma 1.19] Matrix B satisfies the following inequality
B C , B 1 C .
Theorem 2. 
Both the CNMFE solutions { u h n , ω h n } and their solution coefficient vectors { U h n , W h n } are unconditionally stable.
Proof of Theorem 2. 
We represent (14) as
B 1 ¯ t U h n + γ W h n 1 2 + B 1 W h n 1 2 = B 1 F ( U ^ ^ h n 1 2 ) , W h n 1 2 = BU h n 1 2 .
Substituting the second formula of (17) into the first formula, we obtain
B 1 ¯ t U h n + γ BU h n 1 2 + U h n 1 2 = B 1 F ( U ^ ^ h n 1 2 ) .
Taking the inner product of (18) and ¯ t U h n , we have
( B 1 ¯ t U h n , ¯ t U h n ) + γ ( BU h n 1 2 , ¯ t U h n ) + ( U h n 1 2 , ¯ t U h n ) = ( B 1 F ( U ^ ^ h n 1 2 ) , ¯ t U h n ) .
The left side of (19) is that
( B 1 ¯ t U h n , ¯ t U h n ) + γ ( BU h n 1 2 , ¯ t U h n ) + ( U h n 1 2 , ¯ t U h n ) = ( B 1 ) 1 2 ¯ t U h n 2 + γ 2 Δ t ( B 1 2 U h n 2 B 1 2 U h n 1 2 ) + 1 2 Δ t ( U h n 2 U h n 1 2 ) ,
and the right side of (19) is that
( B 1 F ( U ^ ^ h n 1 2 ) , ¯ t U h n ) C ( B 1 ) 1 2 2 F ( U ^ ^ h n 1 2 ) + ( B 1 ) 1 2 ¯ t U h n 2 .
Combining lemma 1 with the global Lipschitz-continuity of f ( u ) , the first term of (21) can be estimated as
( B 1 ) 1 2 2 F ( U ^ ^ h n 1 2 ) 2 C 3 2 F ( U h n 1 ) 1 2 F ( U h n 2 ) 2 C 1 2 F ( U h n 1 ) 1 2 F ( U h n 2 ) 2 + F ( U h n 1 ) F ( U h 0 ) 2 + F ( U h 0 ) 2 C ( U h n 1 U h n 2 2 + U h n 1 U h 0 2 + F ( U h 0 ) 2 ) C ( U h 0 2 + F ( U h 0 ) 2 + U h n 1 2 + U h n 2 2 ) C + C ( U h n 1 2 + U h n 2 2 ) , 2 n N ,
where U h 0 and F ( U h 0 ) are bounded. Combining (20), (21) and (22) we have
γ 2 Δ t ( B 1 2 U h n 2 B 1 2 U h n 1 2 ) + 1 2 Δ t ( U h n 2 U h n 1 2 ) C + C ( U h n 1 2 + U h n 2 2 ) .
Multiplying both sides of the inequality of (23) by 2 Δ t and summating from 2 to n ( n N ) , we have
U h n 2 U h 1 2 + γ B 1 2 U h 1 2 + 2 Δ t i = 2 n C + C Δ t i = 0 n 1 U h i 2 ( 1 + γ B 1 2 ) U h 1 2 + C T + C Δ t i = 0 n 1 U h i 2 ,
noting that U h 1 C , then
U h n 2 C + C Δ t i = 0 n 1 U h i 2 .
Applying the Gronwall Lemma to (25), we obtain
U h n 2 C e C n Δ t C , 1 n N .
And because
W h n = B U h n B U h n C U h n C , 1 n N .
From (26) and (27), we have
U h n + W h n C , 1 n N .
Due to ζ C , we can easily get
u h n + ω h n = U h n · ζ + W h n · ζ C U h n ζ + C W h n ζ C , 1 n N .
(28) and (29) indicate that the CNMFE solutions and their coefficient vectors are unconditionally stable.
In order to analyze the convergence of the linearized CNMFE scheme, we first need to establish the projection operator R h .
Lemma 2. 
Let R h : V V h satisfy the following relation
( ( ϕ R h ϕ ) , χ ) = 0 , χ V h ,
and
ϕ R h ϕ L 2 ( Ω ) + h ϕ R h ϕ H 1 ( Ω ) C h 2 ϕ H 2 ( Ω ) ,
ϕ t R h ϕ t L 2 ( Ω ) C h 2 ( ϕ H 2 ( Ω ) + ϕ t H 2 ( Ω ) ) .
In order to facilitate theoretical analysis, the errors can be decomposed into
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 .
Subtracting (11) from (7) and using (30) at t = t n 1 2 , we obtain the following error equations.
( θ n θ n 1 Δ t , v h ) + γ ( κ n 1 2 , v h ) + ( κ n 1 2 , v h ) + ( f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) , v h ) = ( τ n τ n 1 Δ t , v h ) ( π n 1 2 , v h ) + ( R 1 n 1 2 , v h ) + ( R 2 n 1 2 , v h ) , v h V h ,
( κ n 1 2 , g h ) ( θ n 1 2 , g h ) = ( π n 1 2 , g h ) , g h V h .
In order to obtain the error estimates, we introduce the following lemma, which is easily obtained by Taylor expansion.
Lemma 3. 
R 1 n 1 2 and R 2 n 1 2 satisfy the following estimates
R 1 n 1 2 2 C Δ t 3 u t t t L ( L 2 ) ,
R 2 n 1 2 2 C ( u ) Δ t 3 u t t t L ( L 2 ) .
Based on Lemmas 2 and 3, the following theorems for Crank-Nicolson fully discrete error estimates is obtained.
Theorem 3. 
With u h 1 = R h u ( t 1 ) , assume that the solution’s regular properties for (4) satisfy u t L 2 ( H 2 ) , u t t t L ( L 2 ) , u , ω L ( H 2 ) . Then there exists a positive constant C independent of h and Δ t such that
u ( t J ) u h J C ( h 2 | * | + ( Δ t ) 2 u t t t L ( L 2 ) ) ,
where | * | u L ( H 2 ) + ω L ( H 2 ) + u t L 2 ( H 2 ) .
Proof of Theorem 3. 
Taking v h = θ n 1 2 and g h = κ n 1 2 in (35) and (36), respectively, we obtain
θ n 2 θ n 1 2 2 Δ t + γ ( κ n 1 2 , θ n 1 2 ) + ( κ n 1 2 , θ n 1 2 ) + ( f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) , θ n 1 2 ) = ( τ n τ n 1 Δ t , θ n 1 2 ) ( π n 1 2 , θ n 1 2 ) + ( R 1 n 1 2 , θ n 1 2 ) + ( R 2 n 1 2 , θ n 1 2 ) ,
κ n 1 2 2 ( θ n 1 2 , κ n 1 2 ) = ( π n 1 2 , κ n 1 2 ) .
Multiplying (41) by γ and adding it to (40) and using Cauchy-Schwarz inequality and Young inequality, we obtain
γ κ n 1 2 2 + 1 2 Δ t ( θ n 2 θ n 1 2 ) = ( κ n 1 2 , θ n 1 2 ) ( f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) , θ n 1 2 ) τ n τ n 1 Δ t , θ n 1 2 ( π n 1 2 , θ n 1 2 ) + ( R 1 n 1 2 , θ n 1 2 ) + ( R 2 n 1 2 , θ n 1 2 ) γ ( π n 1 2 , κ n 1 2 ) τ n τ n 1 Δ t + R 1 n 1 2 + R 2 n 1 2 θ n 1 2 + κ n 1 2 θ n 1 2 + γ π n 1 2 κ n 1 2 + ( f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) + π n 1 2 ) θ n 1 2 C τ n τ n 1 Δ t 2 + R 1 n 1 2 2 + R 2 n 1 2 2 + π n 1 2 2 + γ 2 κ n 1 2 2 + C f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) 2 + C θ n 1 2 2 .
For the nonlinear term f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) 2 , Using Young inequality, we have
f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) 2 = 3 2 f ( u n 1 ) 1 2 f ( u n 2 ) 3 2 f ( u h n 1 ) + 1 2 f ( u h n 2 ) 2 = 3 2 ( u n 1 ) 3 3 2 u n 1 1 2 ( u n 2 ) 3 + 1 2 u n 2 3 2 ( u h n 1 ) 3 + 3 2 u h n 1 + 1 2 ( u h n 2 ) 3 1 2 u h n 2 2 = 3 2 [ ( u n 1 ) 3 ( u h n 1 ) 3 ] 1 2 [ ( u n 2 ) 3 ( u h n 2 ) 3 ] 3 2 ( u n 1 u h n 1 ) + 1 2 ( u n 2 u h n 2 ) 2 3 2 ( u n 1 u h n 1 ) [ ( u n 1 ) 2 + u n 1 u h n 1 + ( u h n 1 ) 2 ] 2 + 1 2 ( u n 2 u h n 2 ) [ ( u n 2 ) 2 + u n 2 u h n 2 + ( u h n 2 ) 2 ] 2 + 3 2 ( u n 1 u h n 1 ) 2 + 1 2 ( u n 2 u h n 2 ) 2 = 9 4 ( C u 2 + 1 ) θ n 1 + τ n 1 2 + 1 4 ( C u 2 + 1 ) θ n 2 + τ n 2 2 C ( τ n 1 2 + τ n 2 2 + θ n 1 2 + θ n 2 2 ) .
Noting that
τ n τ n 1 Δ t 2 1 Δ t t n 1 t n τ t ( s ) 2 d s .
Substitute (43) and (44) into (42) to obtain
γ 2 κ n 1 2 2 + 1 2 Δ t ( θ n 2 θ n 1 2 ) C 1 Δ t t n 1 t n τ t ( s ) 2 d s + R 1 n 1 2 2 + R 2 n 1 2 2 + π n 1 2 2 + C ( τ n 1 2 + τ n 2 2 + θ n 2 + θ n 1 2 + θ n 2 2 ) .
Summing from n = 2 , , J , the resulting inequality becomes
γ Δ t n = 2 J κ n 1 2 2 + ( 1 C Δ t ) θ J 2 θ 1 2 + C Δ t n = 2 J ( R 1 n 1 2 2 + R 2 n 1 2 2 + π n 1 2 2 ) + C Δ t n = 0 J 1 ( τ n 2 + θ n 2 ) + C 0 t J τ t 2 d s .
Choosing Δ t 0 , when 0 < Δ t < Δ t 0 , 1 C Δ t > 0 , and using discrete Gronwall Lemma and Lemma 3, we obtain
γ Δ t n = 2 J κ n 1 2 2 + 1 2 θ J 2 θ 1 2 + C Δ t n = 0 J 1 τ n 2 + C Δ t n = 2 J ( R 1 n 1 2 2 + R 2 n 1 2 2 + π n 1 2 2 ) + C 0 t J τ t 2 d s θ 1 2 + C ( τ n L ( L 2 ) 2 + π n 1 2 L ( L 2 ) 2 + 0 t J τ t 2 d s ) + C ( Δ t ) 4 u t t t L ( L 2 ) 2 .
Combining Lemma 2, (47) and the triangle inequality, the proof of (39) is accomplished.
Theorem 4. 
With u h 1 = R h u ( t 1 ) and ω h 1 = R h ω ( t 1 ) ,assume that the solution’s regular properties for (4) satisfy u t , ω t L 2 ( H 2 ) , u t t t L ( L 2 ) , u , ω L ( H 2 ) . Then there exists a positive constant C independent of h and Δ t such that
ω ( t J ) ω h J C ( h 2 | | + ( Δ t ) 2 u t t t L ( L 2 ) ) ,
where | | u L ( H 2 ) + ω L ( H 2 ) + u t L 2 ( H 2 ) + ω t L 2 ( H 2 ) .
Proof of Theorem 4. 
From (36) we can get
κ n κ n 1 Δ t , g h θ n θ n 1 Δ t , g h = π n π n 1 Δ t , g h , g h V h .
Taking v h = θ n θ n 1 Δ t and g h = κ n 1 2 in (35) and (49), respectively, we obtain
θ n θ n 1 Δ t 2 + γ κ n 1 2 , θ n θ n 1 Δ t + κ n 1 2 , θ n θ n 1 Δ t + f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) , θ n θ n 1 Δ t = τ n τ n 1 Δ t , θ n θ n 1 Δ t π n 1 2 , θ n θ n 1 Δ t + R 1 n 1 2 , θ n θ n 1 Δ t + R 2 n 1 2 , θ n θ n 1 Δ t ,
κ n 2 κ n 1 2 2 Δ t θ n θ n 1 Δ t , κ n 1 2 = π n π n 1 Δ t , κ n 1 2 .
Multiplying (51) by γ and adding it to (50) and using Cauchy-Schwarz inequality and Young inequality, we have
γ 2 Δ t ( κ n 2 κ n 1 2 ) + θ n θ n 1 Δ t 2 = κ n 1 2 , θ n θ n 1 Δ t f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) , θ n θ n 1 Δ t τ n τ n 1 Δ t , θ n θ n 1 Δ t π n 1 2 , θ n θ n 1 Δ t + R 1 n 1 2 , θ n θ n 1 Δ t + R 2 n 1 2 , θ n θ n 1 Δ t γ π n π n 1 Δ t , κ n 1 2 C ( f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) 2 + R 1 n 1 2 2 + R 2 n 1 2 2 + τ n τ n 1 Δ t 2 + π n π n 1 Δ t 2 ) + C ( π n 1 2 2 + κ n 1 2 2 ) + 1 2 θ n θ n 1 Δ t 2 .
Similar to (44),
π n π n 1 Δ t 2 1 Δ t t n 1 t n π t ( s ) 2 d s .
Multiplying (52) by 2 Δ t , summing from n = 2 , , J and using (43), (44) and (53) to obtain
γ κ J 2 + Δ t n = 2 J θ n θ n 1 Δ t 2 γ κ 1 2 + C Δ t n = 2 J ( τ n 1 2 + τ n 2 2 + θ n 1 2 + θ n 2 2 + R 1 n 1 2 2 + R 2 n 1 2 2 ) + C Δ t n = 2 J π n 1 2 2 + C 0 t J ( τ t ( s ) 2 + π t ( s ) 2 ) d s + C Δ t n = 2 J κ n 1 2 2 .
Using the Gronwall Lemma, we have
γ κ J 2 + Δ t n = 2 J θ n θ n 1 Δ t 2 γ κ 1 2 + C Δ t n = 0 J 1 ( τ n 2 + θ n 2 ) + C Δ t n = 2 J ( R 1 n 1 2 2 + R 2 n 1 2 2 + π n 1 2 2 ) + C 0 t J ( τ t ( s ) 2 + π t ( s ) 2 ) d s .
Substitute (47) and Lemma 3 into (55), we get
γ κ J 2 + Δ t n = 2 J θ n θ n 1 Δ t 2 γ κ 1 2 + C 0 t J ( τ t ( s ) 2 + π t ( s ) 2 ) d s + C ( τ n L ( L 2 ) 2 + π n 1 2 L ( L 2 ) 2 ) + C ( Δ t ) 4 u t t t L ( L 2 ) 2
Combining Lemma 2, (56) with the triangle inequality, we complete the proof. □

3. The reduced-dimension method of the Crank-Nicolson mixed finite element solution coefficient vectors of the EFK equation

3.1. Construction of POD basis vectors

Firstly, we need to compute the initial K-step solution coefficient vectors { U h n , W h n } n = 1 K of Problem 3, which will yield two M × K snapshot matrices A 1 = ( U h 1 , U h 2 , , U h K ) and A 2 = ( W h 1 , W h 2 , , W h K ) . Secondly, we need to compute the positive eigenvalues and arrange them in descending order μ i , 1 μ i , 2 μ i , r i > 0 ( r i = rank ( A i ) ) of A i A i T ( i = 1 , 2 ) , and the associated eigenvectors to form the matrix Φ ˜ i = ( φ i , 1 , φ i , 2 , , φ i , r i ) R M × r i . Finally, choosing the first d column vectors of Φ ˜ i as a set of POD bases Φ i = ( φ i , 1 , φ i , 2 , , φ i , d ) ( d r i , i = 1 , 2 ) , they satisfy the following equalities
A i Φ i Φ i T A i 2 = μ i , d + 1 , i = 1 , 2 ,
where A 2 = s u p v R M A v v and v = i = 1 M | v i | 2 of vector v = ( v 1 , v 2 , , v M ) T . When n = 1 , 2 , , K , it follows that
U h n Φ 1 Φ 1 T U h n = ( A 1 Φ 1 Φ 1 T A 1 ) e n ( A 1 Φ 1 Φ 1 T A 1 ) 2 e n μ 1 , d + 1 ,
W h n Φ 2 Φ 2 T W h n = ( A 2 Φ 2 Φ 2 T A 2 ) e n ( A 2 Φ 2 Φ 2 T A 2 ) 2 e n μ 2 , d + 1 ,
Here, e n ( 1 n K ) denotes the unit vectors whose nth component is 1. Therefore, Φ i = ( φ i , 1 , φ i , 2 , , φ i , d ) ( d r i , i = 1 , 2 ) is a set of optimal POD bases.
Remark 2. 
Since the order M × M of matrix A i A i T ( i = 1 , 2 ) is much larger than the order K × K of matrix A i T A i , and the eigenvalues of A i A i T and A i T A i are equal, thus we first calculate the initial d eigenvalues μ i , j ( 1 j d ) of matrix A i T A i and their corresponding eigenvectors ϕ i , j ( 1 j d ) . Then we use the relation φ i , j = A i ϕ i , j / μ i , j ( 1 j d ) to obtain the eigenvectors of A i A i T , and generate a set of POD basis vectors Φ i = ( φ i , 1 , φ i , 2 , , φ i , d ) ( d r i ) .

3.2. Formulation of the RDCNMFE scheme

Firstly, letting α d n = ( α 1 n , α 2 n , , α d n ) T , β d n = ( β 1 n , β 2 n , , β d n ) T , and U d n = ( U d 1 n , U d 2 n , ,   U d M n ) T and W d n = ( W d 1 n , W d 2 n , , W d M n ) T represent the RDCNMFE solution coefficient vectors. Secondly, we can instantly obtain the first K RDCNMFE solution vectors U d n = Φ 1 Φ 1 T U h n = : Φ 1 α d n and W d n = Φ 2 Φ 2 T W h n = : Φ 2 β d n ( 1 n K ) from section 3.1. Finally, by using U d n = Φ 1 α d n , W d n = Φ 2 β d n ( K + 1 n N ) instead of { U h n , W h n } in Problem 3, the following matrix-based RDCNMFE scheme can be established.
Problem 4. 
Find { U d n , W d n } R M × R M and { u d n , ω d n } V h × V h ( 1 n N ) satisfying
α d n = Φ 1 T U h n , β d n = Φ 2 T W h n , 1 n K , Φ 1 ¯ t α d n + γ B Φ 2 β d n 1 2 + Φ 2 β d n 1 2 = F ( Φ 1 α ^ ^ d n 1 2 ) , K + 1 n N , Φ 2 β d n 1 2 B Φ 1 α d n 1 2 = 0 , K + 1 n N , u d n = j = 1 M U d j n ζ j = U d n · ζ = Φ 1 α d n · ζ , ω d n = j = 1 M W d j n ζ j = W d n · ζ = Φ 2 β d n · ζ , 1 n N ,
in which { U h n , W h n } ( n = 1 , 2 , , K ) are the first K solution coefficient vectors for Problem 3. The definitions of matrix B , vector F , as well as FE basis function vectors ζ = ( ζ 1 ( x ) , ζ 2 ( x ) , , ζ M ( x ) ) are given in section 2.2.

3.3. The uniqueness, stability and error estimate of the RDCNMFE solutions

For the RDCNMFE solutions of Problem 4, the unique, stable and convergent properties are as follows.
Theorem 5. 
Under the same assumptions as Theorem 3 and 4, if { u n , ω n } V × V are the weak solutions to Problem 1 and { u d n , ω d n } V h × V h are the solutions to Problem 4, then for any 1 n N , the RDCNMFE solutions have uniqueness and unconditional stability, and the following error estimate is obtained.
u n u d n + ω n ω d n C ( h 2 + Δ t 2 + μ 1 , d + 1 + μ 2 , d + 1 ) .
Proof of Theorem 5. 
(1) Discuss the uniqueness of the RDCNMFE solutions.
  • For 1 n K , Theorem 1 guarantees the uniqueness of solutions { u h n , ω h n } to problem 3. Therefore, the solutions { u d n , ω d n } generated from first and fourth formulas in problem 4 must also be unique.
    For K + 1 n N , using U d n = Φ 1 α d n , W d n = Φ 2 β d n ( K + 1 n N ) , the last three formulas of Problem 4 can be converted to
    ¯ t U d n + γ B W d n 1 2 + W d n 1 2 = F ( U ^ ^ d n 1 2 ) , K + 1 n N ,
    W d n 1 2 B U d n 1 2 = 0 , K + 1 n N ,
    u d n = j = 1 M U d j n ζ j = U d n · ζ , ω d n = j = 1 M W d j n ζ j = W d n · ζ , K + 1 n N .
    For K + 1 n N , the set of solutions { u h n , ω h n } n = K + 1 N for Problem 3 is unique. Since (62) – (64) follow the same formats as problem 3, the set of solutions { u d n , ω d n } n = K + 1 N for (62) – (64) is also unique.
(2)
Demonstrate the stability of the RDCNMFE solutions.
When 1 n K , since the vectors in Φ 1 and Φ 2 are orthonormal, using Theorem 2, we have
u d n + ω d n = U d n · ζ + W d n · ζ = Φ 1 Φ 1 T U h n · ζ + Φ 2 Φ 2 T W h n · ζ C ( u h n + ω h n ) C , 1 n L .
When K + 1 n N , since B is a positive definite symmetric matrix, we can rewrite (62) as
B 1 ¯ t U d n + γ W d n 1 2 + B 1 W d n 1 2 = B 1 F ( U ^ ^ d n 1 2 ) , K + 1 n N .
Putting (63) into (66), we have
B 1 ¯ t U d n + γ B U d n 1 2 + U d n 1 2 = B 1 F ( U ^ ^ d n 1 2 ) , K + 1 n N .
Taking the inner product of (67) and ¯ t U d n ,
( B 1 ¯ t U d n , ¯ t U d n ) + γ ( B U d n 1 2 , ¯ t U d n ) + ( U d n 1 2 , ¯ t U d n ) = ( B 1 F ( U ^ ^ d n 1 2 ) , ¯ t U d n ) , K + 1 n N .
Then the left side of (68) is that
( B 1 ¯ t U d n , ¯ t U d n ) + γ ( B U d n 1 2 , ¯ t U d n ) + ( U d n 1 2 , ¯ t U d n ) = ( B 1 ) 1 2 ¯ t U d n 2 + γ 2 Δ t ( B 1 2 U d n 2 B 1 2 U d n 1 2 ) + 1 2 Δ t ( U d n 2 U d n 1 2 ) , K + 1 n N ,
and the right side of (68) is that
( B 1 F ( U ^ ^ d n 1 2 ) , ¯ t U d n ) C ( B 1 ) 1 2 2 F ( U ^ ^ d n 1 2 2 + ( B 1 ) 1 2 ¯ t U d n 2 , K + 1 n N .
Using the same technique as (22), we have
( B 1 ) 1 2 2 F ( U ^ ^ d n 1 2 2 C + C ( U d n 1 2 + U d n 2 2 ) , K + 1 n N .
Combining (69), (70) and (71), we have
γ 2 Δ t ( B 1 2 U d n 2 B 1 2 U d n 1 2 ) + 1 2 Δ t ( U d n 2 U d n 1 2 ) C + C ( U d n 1 2 + U d n 2 2 ) , K + 1 n N .
Multiplying both sides of (72) by 2 Δ t , and summating from 2 to n, we obtain
U d n 2 U d 1 2 + γ B 1 2 U d 1 2 + 2 Δ t i = 2 n C + C Δ t i = 0 n 1 U d i 2 ( 1 + γ B 1 2 2 ) U d 1 2 + C T + C Δ t i = 0 n 1 U d i 2 , K + 1 n N .
Noting that
U d 1 2 = Φ 1 Φ 1 T U h 1 2 C U h 1 2 C ,
putting (74) into (73), we have
U d n 2 C + C Δ t i = 0 n 1 U d i 2 , K + 1 n N .
Using the Gronwall Lemma for (75),
U d n 2 C e C n Δ t C , K + 1 n N .
And
W d n = B U d n B U d n C U d n C , K + 1 n N .
So we have
U d n + W d n C , K + 1 n N .
Thus, noting that ζ C , we get
u d n + ω d n = U d n · ζ + W d n · ζ C U d n · ζ + C W d n · ζ C , K + 1 n N .
From (65) and (79), the RDCNMFE solutions { u d n , ω d n } ( 1 n N ) are unconditional stable.
(3)
Analyse the error estimate of the RDCNMFE solutions.
When 1 n K , from ζ C , (58) and (59), we have
u h n u d n + ω h n ω d n U h n U d n ζ + W h n W d n ζ C U h n Φ 1 Φ 1 T U h n + W h n Φ 2 Φ 2 T W h n C ( μ 1 , d + 1 + μ 2 , d + 1 ) , 1 n K .
When K + 1 n N , letting δ n = U h n U d n and ρ n = W h n W d n , and combining (17), (66) and (63), we obtain
B 1 ¯ t δ n + γ ρ n 1 2 + B 1 ρ n 1 2 = B 1 F ( U ^ ^ h n 1 2 ) B 1 F ( U ^ ^ d n 1 2 ) , K + 1 n N ,
ρ n 1 2 = B δ n 1 2 , K + 1 n N .
Putting (82) into(81), we have
B 1 ¯ t δ n + γ B δ n 1 2 + δ n 1 2 = B 1 F ( U ^ ^ h n 1 2 ) B 1 F ( U ^ ^ d n 1 2 ) , K + 1 n N .
Taking the inner product of (83) and ¯ t δ n ,
( B 1 ¯ t δ n , ¯ t δ n ) + γ ( B δ n 1 2 , ¯ t δ n ) + ( δ n 1 2 , ¯ t δ n ) = ( B 1 F ( U ^ ^ h n 1 2 ) B 1 F ( U ^ ^ d n 1 2 ) , ¯ t δ n ) , K + 1 n N .
Then the left side of (84) is that
( B 1 ¯ t δ n , ¯ t δ n ) + γ ( B δ n 1 2 , ¯ t δ n ) + ( δ n 1 2 , ¯ t δ n ) = ( B 1 ) 1 2 ¯ t δ n 2 + γ 2 Δ t ( B 1 2 δ n 2 B 1 2 δ n 1 2 ) + 1 2 Δ t ( δ n 2 δ n 1 2 ) , K + 1 n N ,
and the right side of (84) is that
( B 1 F ( U ^ ^ h n 1 2 ) B 1 F ( U ^ ^ d n 1 2 ) , ¯ t δ n ) C ( B 1 ) 1 2 2 F ( U ^ ^ h n 1 2 ) F ( U ^ ^ d n 1 2 ) 2 + ( B 1 ) 1 2 ¯ t δ n 2 , K + 1 n N .
Combining Lemma 1 with the global Lipschitz-continuity of f ( u ) , the first term of (86) can be estimated as
( B 1 ) 1 2 2 F ( U ^ ^ h n 1 2 ) F ( U ^ ^ d n 1 2 ) 2 C 3 2 F ( U h n 1 ) 1 2 F ( U h n 2 ) 3 2 F ( U d n 1 ) 1 2 F ( U d n 2 ) 2 C 3 2 ( U h n 1 U d n 1 ) 2 + 1 2 ( U h n 2 U d n 2 ) 2 C ( δ n 1 2 + δ n 2 2 ) , K + 1 n N .
Combining (85), (86) and (87), we have
γ 2 Δ t ( B 1 2 δ n 2 B 1 2 δ n 1 2 ) + 1 2 Δ t ( δ n 2 δ n 1 2 ) C ( δ n 1 2 + δ n 2 2 ) , K + 1 n N .
Multiplying both sides of (88) by 2 Δ t , and summating from K + 1 to n ( n N ) , we obtain
δ n 2 δ K 2 + B 1 2 δ K 2 + C Δ t i = K 1 n 1 δ i 2 C δ K 2 + C Δ t i = K 1 n 1 δ i 2 , K + 1 n N .
Noting that
δ K 2 = U h K U d K 2 = U h K Φ 1 Φ 1 T U h K 2 .
Putting (90) into (89), from (58) and (59), we have
δ n 2 C μ 1 , d + 1 + C Δ t i = K 1 n 1 δ i 2 , K + 1 n N .
Applying the Gronwall Lemma for (91),
δ n 2 C μ 1 , d + 1 e C n Δ t C μ 1 , d + 1 , K + 1 n N .
And
ρ n = B δ n C B δ n C δ n , K + 1 n N ,
thus, we get
δ n + ρ n C ( μ 1 , d + 1 + μ 2 , d + 1 ) , K + 1 n N .
Further, from ζ C , we obtain
u h n u d n + ω h n ω d n U h n U d n · ζ + W h n W d n · ζ U h n U d n · ζ + W h n W d n · ζ C ( μ 1 , d + 1 + μ 2 , d + 1 ) , K + 1 n N .
Using the triangle inequality, Theorem 3 and 4, (80) and (95), we obtain
u n u d n + ω n ω d n u n u h n + u h n u d n + ω n ω h n + ω h n ω d n C ( h 2 + Δ t 2 + μ 1 , d + 1 + μ 2 , d + 1 ) , 1 n N .
 □

4. The Numerical Examples for the EFK Equations

In order to verify the effectiveness of the RDCNMFE method, we can compare the errors and orders between the genuine, CNMFE and RDCNMFE solutions and CPU runtime on different time nodes. We here adopt the numerical experiment that the following 2D nonlinear EFK equation has a genuine solution. Generally speaking, it has no genuine solution.
u t + Δ 2 u Δ u + u 3 u = g ( x 1 , x 2 , t ) , ( x 1 , x 2 , t ) ( 0 , 1 ) 2 × ( 0 , T ] , u ( 0 , x 2 , t ) = u ( 1 , x 2 , t ) = 0 , u ( x 1 , 0 , t ) = u ( x 1 , 1 , t ) = 0 , t [ 0 , T ] , Δ u ( 0 , x 2 , t ) = Δ u ( 1 , x 2 , t ) = 0 , Δ u ( x 1 , 0 , t ) = Δ u ( x 1 , 1 , t ) = 0 , t [ 0 , T ] , u ( x 1 , x 2 , 0 ) = sin ( π x 1 ) sin ( π x 2 ) , ( x 1 , x 2 ) [ 0 , 1 ] 2 ,
in which g ( x 1 , x 2 , t ) = e t ( 2 + 4 π 4 + 2 π 2 ) sin ( π x 1 ) sin ( π x 2 ) + e 3 t sin 3 ( π x 1 ) sin 3 ( π x 2 ) , we may obtain the genuine solution u ( x 1 , x 2 , t ) = e t sin ( π x 1 ) sin ( π x 2 ) of (97). The genuine solution of the auxiliary variable ω is ω ( x 1 , x 2 , t ) = 2 π 2 e t sin ( π x 1 ) sin ( π x 2 ) .
Firstly, the initial 20 CNMFE solution vectors { U h n , W h n } ( n = 1 , 2 , , 20 ) are obtained by calculating Problem 3 to establish the snapshot matrixes A 1 = ( U h 1 , U h 2 , , U h 20 ) and A 2 = ( W h 1 , W h 2 , , W h 20 ) . Secondly, we calculate the eigenvalues μ i , j ( i = 1 , 2 , j = 1 , 2 , , 20 ) (arranged decreasingly) and the associated eigenvectors ϕ i , j ( i = 1 , 2 , j = 1 , 2 , , 20 ) of the matrixes A i T A i ( i = 1 , 2 ) . Then, we find that μ i , 7 h 2 + Δ t 2 , so that we just need to extract the first 6 eigenvectors ϕ i , j of the matrix A i T A i ( i = 1 , 2 ) to construct a set of POD basis vectors Φ i = ( φ i , 1 , φ i , 2 , , φ i , 6 ) , where φ i , j = A i ϕ i , j / μ i , j ( i = 1 , 2 , j = 1 , 2 , , 6 ) . Finally, we compute the RDCNMFE solutions { u d n , ω d n } of (97) by Problem 4 and the CNMFE solutions { u h n , ω h n } of (97) by Problem 3 when h = 2 / 100 and Δ t = 1 / 100 at t = 1 . And they are compared with the genuine solution respectively, exhibited in Figure 1 and Figure 2. As evident from Figure 1 and Figure 2, the RDCNMFE and CNMFE solutions closely mirror the genuine solution.
For comparison, we give the errors and convergence orders of the CNMFE and RDCNMFE solutions for u and ω at t = 1 in Table 1 and Table 2, respectively. As can be observed from Table 1 and Table 2, the errors and convergence rates of the RDCNMFE method are nearly identical to the CNMFE method, which aligns with the previous theoretical analysis. Figure 3 offers a more visual representation of the comparative results of the error convergence orders between u h n and u d n and between ω h n and ω d n .
To provide additional evidence for the effectiveness of the RDCNMFE method, we recorded the errors and the CPU running time for computing the CNMFE and RDCNMFE solutions at t = 1.0 ,   1.5 ,   2.0 ,   2.5 ,   3.0 , respectively. These results are obtained by solving Problems 3 and 4 and shown in Table 3.
As demonstrated in Table 3, with the increase of time, the CNMFE method with 2 × 6561 degrees of freedom requires considerable CPU runtime at each time node, where the running time increases by approximately 30 s for every additional 0.5 s . While performing at the same time node, the RDCNMFE method, with only 2 × 6 degrees of freedom, requires very minimal CPU runtime, with an increase in running time of only about 0.1 s for every additional 0.5 s . The calculation time of the CNMFE method is approximately 70 times greater than that of the RDCNMFE method when t = 3.0 . This experiment demonstrates that the RDCNMFE method significantly reduces CPU running time. Furthermore, the results from the Table 3 indicate that the RDCNMFE method produces slightly less L 2 errors compared to the CNMFE method. In summary, it is clear that the RDCNMFE method surpasses the CNMFE method, proving it as an effective numerical method for solving the 2D nonlinear EFK equation.

5. Conclusions

In this study, we have focused on the reduced-dimension method of Crank-Nicolson mixed finite element solution coefficient vectors for 2D nonlinear EFK equations In order to give a full demonstration of the effectiveness of the reduced-dimension method, we have established the CNMFE scheme of the 2D nonlinear EFK equation and discussed the uniqueness, stability, and convergence of CNMFE solution. Then, we have generated the POD basis based on the initial K CNMFE solutions, constructed the RDCNMFE matrix model, and employed the traditional finite element techniques to analyze the uniqueness, stability and error estimation of RDCNMFE solution. Additionally, numerical experiments have been conducted to comparatively evaluate the performance of the two methods. Compared with the CNMFE method, the RDCNMFE method has fewer degrees of freedom at each time node. This characteristic enables the RDCNMFE method to greatly reduce computational load, running time, and error accumulation. In particular, this paper has simplified the actual calculation by linearizing the nonlinear term without iterative numerical calculation. Therefore, the RDCNMFE method constitutes a novel numerical technique for tackling nonlinear PDEs.
In future research, we intend to extend the scope of application of this method to PDEs with variable coefficients (in this paper, the coefficient γ is a constant). Additionally, we believe this approach can be adapted to more complex engineering problems.

Author Contributions

Conceptualization, X.C. and H.L.; methodology, X.C.; numerical simulation, X.C.; formal analysis, X.C.; writing—original draft preparation, X.C.; validation, X.C. and H.L.; writing—review, H.L.; supervision, H.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China (12161063) and the Program for Innovative Research Team in Universities of Inner Mongolia Autonomous Region (NMGIRT2207).

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

The authors would like to thank the reviewers and editors for their invaluable comments, which greatly refined the content of this article.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
POD proper orthogonal decomposition
CNMFE Crank-Nicolson mixed finite element
RDCNMFE reduced-dimension Crank-Nicolson mixed finite element
EFK extended Fisher-Kolmogorov

References

  1. Adams, R.A. Sobolev Spaces; Academic Press: New York, USA, 1975. [Google Scholar]
  2. Coullet, P.; Elphick, C.; Repaux, D. Nature of spatial chaos. Phys. Rev. Lett. 1987, 58, 431–434. [Google Scholar] [CrossRef] [PubMed]
  3. Ilati, M.; Dehghan, M. Direct local boundary integral equation method for numerical solution of extended Fisher-Kolmogorov equation. Eng. Comput-Germany. 2018, 34, 203–213. [Google Scholar] [CrossRef]
  4. Liu,F.N.; Zhao, X.P.; Liu, B. Fourier pseudo-spectral method for the extended Fisher-Kolmogorov equation in two dimensions. Adv. Differ. Equ-Ny. 2017, 2017, 1–17.
  5. Bashan, A.; Ucar, Y.; Yagmurlu, N.M.; Esen, A. Numerical solutions for the fourth order extended Fisher-Kolmogorov equation with high accuracy by differential quadrature method. Sigma. J. Eng. Nat. Sci. 2018, 9, 273–284. [Google Scholar]
  6. Awasthi, A. Polynomial based differential quadrature methods for the numerical solution of fisher and extended Fisher-Kolmogorov equations. Int. J. Appl. Comput. Math. 2017, 3, 665–677. [Google Scholar]
  7. Li, S.G.; Xu, D.; Zhang, J.; Sun, C.J. A new three-level fourth-order compact finite difference scheme for the extended Fisher-Kolmogorov equation. Appl. Numer. Math. 2022, 178, 41–51. [Google Scholar] [CrossRef]
  8. Qiao, L.; Nikan, O.; Avazzadeh, Z. Some efficient numerical schemes for approximating the nonlinear two-space dimensional extended Fisher-Kolmogorov equation. Appl. Numer. Math. 2023, 185, 466–482. [Google Scholar] [CrossRef]
  9. Kadri, T.; Omrani, K. A fourth-order accurate finite difference scheme for the extended-Fisher-Kolmogorov equation. Bull. Korean Math. Soc. 2018, 55, 297–310. [Google Scholar]
  10. Ismail, K.; Atouani, N.; Omrani, K. A three-level linearized high-order accuracy difference scheme for the extended Fisher-Kolmogorov equation. Eng. Comput-Germany. 2021, 2, 1–11. [Google Scholar] [CrossRef]
  11. He, D.D. On the L-norm convergence of a three-level linearly implicit finite difference method for the extended Fisher-Kolmogorov equation in both 1D and 2D, Comput. Math. Appl., 2016, 71, 2594–2607. [Google Scholar] [CrossRef]
  12. Sweilam, N.H.; Elsakout, D.M.; Muttardi, M.M. Numerical solution for stochastic extended Fisher-Kolmogorov equation. Chaos, Solitons and Fractals. 2021, 151, 111213.
  13. Danumjaya, P.; Pani, A.K. Mixed finite element methods for a fourth order reaction diffusion equation. Numer. Meth. Part. D. E. 2012, 28, 1227–1251. [Google Scholar] [CrossRef]
  14. Doss, L.J.T.; Nandini, A.P. An H1-Galerkin mixed finite element method for the extended Fisher-Kolmogorov equation. Int. J. Numer. Anal. Model. Ser. B. 2012, 3, 460–485. [Google Scholar]
  15. Wang, J.F.; Li, H.; He, S.; Gao, W.; Liu, Y. A new linearized Crank-Nicolson mixed element scheme for the extended Fisher-Kolmogorov equation. The Scientific World Journal. 2013, 2013. [Google Scholar] [CrossRef] [PubMed]
  16. Xu, B.Z.; Zhang, X.H. A reduced fourth-order compact difference scheme based on a proper orthogonal decomposition technique for parabolic equations. Bound. Value. Probl. 2019, 130. [Google Scholar] [CrossRef]
  17. Xu, B.Z.; Zhang, X.H.; Ji, D.B. A reduced high-order compact finite difference scheme based on POD technique for the two dimensional extended Fisher-Kolmogorov equation. IAENG Int. J. Appl. Math. 2020, 50. [Google Scholar]
  18. Luo, Z.D.; Teng, F. A reduced-order extrapolated finite difference iterative scheme based on POD method for 2D Sobolev equation. Appl. Math. Comput. 2018, 329, 374–383. [Google Scholar] [CrossRef]
  19. Song, J.P.; Rui, H.X. A reduced-order Schwarz domain decomposition method based on POD for the convection-diffusion equation. Comput. Math. Appl. 2024, 160, 60–69. [Google Scholar] [CrossRef]
  20. Luo, Z.D.; Teng, F.; Xia, H. A reduced-order extrapolated Crank-Nicolson finite spectral element method based on POD for the 2D non-stationary Boussinesq equations. J. Math. Anal. Appl. 2019, 471, 564–583. [Google Scholar] [CrossRef]
  21. Luo, Z.D.; Jiang, W.R. A reduced-order extrapolated Crank-Nicolson finite spectral element method for the 2D non-stationary Navier-Stokes equations about vorticity-stream functions. Appl. Numer. Math. 2020, 147, 161–173. [Google Scholar] [CrossRef]
  22. Luo, Z.D.; Li, L.; Sun, P. A reduced-order MFE formulation based on POD method for parabolic equations. Acta. Math. Sci. 2013, 33B, 1471–1484. [Google Scholar] [CrossRef]
  23. Liu, Q.; Teng, F.; Luo, Z. A reduced-order extrapolation algorithm based on CNLSMFE formulation and POD technique for two-dimensional Sobolev equations. Appl. Math. J. Chinese Univ. 2014, 29, 171–182. [Google Scholar] [CrossRef]
  24. Luo, Z.D.; Zhou, Y.J.; Yang, X.Z. A reduced finite element formulation based on proper orthogonal decomposition for Burgers equation. Appl. Numer. Math. 2009, 59, 1933–1946. [Google Scholar] [CrossRef]
  25. Song, J.P.; Rui, H.X. A reduced-order characteristic finite element method based on POD for optimal control problem governed by convection-diffusion equation. Comput. Meth. Appl. M. 2022, 391, 114538. [Google Scholar] [CrossRef]
  26. Song, J.P.; Rui, H.X. Reduced-order finite element approximation based on POD for the parabolic optimal control problem. Numer. Algorithms. 2024, 95, 1189–1211. [Google Scholar] [CrossRef]
  27. Luo, Z.D. A POD-based reduced-order stabilized Crank-Nicolson MFE formulation for the Non-Stationary parabolized Navier-Stokes equations. Math. Model. Anal. 2015, 20, 346–368. [Google Scholar] [CrossRef]
  28. Luo, Z.D. A POD-based reduced-order TSCFE extrapolation iterative format for two-dimensional heat equations. Bound. Value Probl. 2015, 2015, 1–15. [Google Scholar] [CrossRef]
  29. Luo, Z.D. The reduced-order extrapolating method about the Crank-Nicolson finite element solution coefficient vectors for parabolic type equation. Mathematics. 2020, 8, 1261. [Google Scholar] [CrossRef]
  30. Zeng, Y.H.; Luo, Z.D. The reduced-dimension technique for the unknown solution coefficient vectors in the Crank-Nicolson finite element method for the Sobolev equation. J. Math. Anal. Appl. 2022, 513, 126207. [Google Scholar] [CrossRef]
  31. Teng, F.; Luo, Z.D. A reduced-order extrapolation technique for solution coefficient vectors in the mixed finite element method for the 2D nonlinear Rosenau equation. J. Math. Anal. Appl. 2020, 485, 123761. [Google Scholar] [CrossRef]
  32. Luo, Z.D. The dimensionality reduction of Crank-Nicolson mixed finite element solution coefficient vectors for the unsteady Stokes equation. Mathematics. 2022, 10, 2273. [Google Scholar] [CrossRef]
  33. Li, Y.J.; Teng, F.; Zeng, Y.H.; Luo, Z.D. Two-grid dimension reduction method of Crank-Nicolson mixed finite element solution coefficient vectors for the fourth-order extended Fisher-Kolmogorov equation. J. Math. Anal. Appl. 2024, 536, 128168. [Google Scholar] [CrossRef]
  34. Zeng, Y.H.; Li, Y.J.; Zeng, Y.T.; Cai, Y.H.; Luo, Z.D. The dimension reduction method of two-grid Crank-Nicolson mixed finite element solution coefficient vectors for nonlinear fourth-order reaction diffusion equation with temporal fractional derivative. Commun. Nonlinear Sci. 2024, 133, 107962. [Google Scholar] [CrossRef]
  35. Luo, Z.D.; Yang, J. The reduced-order method of continuous space-time finite element scheme for the non-stationary incompressible flows. J. Comput. Phys. 2022, 456, 111044. [Google Scholar] [CrossRef]
  36. Luo, Z.D. The founfations and applications of mixed finite element methods; Chinese Science Press: Beijing, China, 2006(in Chinese).
Figure 1. (a) The genuine solution u n at t=1. (b) The CNMFE solution u h n at t=1. (c) The RDCNMFE solution u d n at t=1.
Figure 1. (a) The genuine solution u n at t=1. (b) The CNMFE solution u h n at t=1. (c) The RDCNMFE solution u d n at t=1.
Preprints 116562 g001
Figure 2. (a) The genuine solution ω n at t=1. (b) The CNMFE solution ω h n at t=1. (c) The RDCNMFE solution ω d n at t=1.
Figure 2. (a) The genuine solution ω n at t=1. (b) The CNMFE solution ω h n at t=1. (c) The RDCNMFE solution ω d n at t=1.
Preprints 116562 g002
Figure 3. Comparison of error results of u and ω .
Figure 3. Comparison of error results of u and ω .
Preprints 116562 g003
Table 1. L 2 errors and order between the genuine, CNMFE and RDCNMFE solutions of u at t=1.
Table 1. L 2 errors and order between the genuine, CNMFE and RDCNMFE solutions of u at t=1.
CNMFE Method RDCNMFE Method
Grid | | u n u h n | | Order | | u n u d n | | Order
10 × 10 3.0742e-03 3.0742e-03
20 × 20 7.5577e-04 2.0242 7.5577e-04 2.0242
40 × 40 1.7251e-04 2.1313 1.7251e-04 2.1313
80 × 80 2.7256e-05 2.6620 2.7274e-05 2.6611
Table 2. L 2 errors and order between the genuine, CNMFE and RDCNMFE solutions of ω at t=1.
Table 2. L 2 errors and order between the genuine, CNMFE and RDCNMFE solutions of ω at t=1.
CNMFE Method RDCNMFE Method
Grid | | ω n ω h n | | Order | | ω n ω d n | | Order
10 × 10 1.0990e-01 1.0990e-01
20 × 20 2.7344e-02 2.0068 2.7344e-02 2.0068
40 × 40 6.5061e-03 2.0714 6.5069e-03 2.0712
80 × 80 1.2863e-03 2.3385 1.2901e-03 2.3345
Table 3. Comparison of L 2 errors and CPU runtime of CNMFE and RDCNMFE solutions.
Table 3. Comparison of L 2 errors and CPU runtime of CNMFE and RDCNMFE solutions.
CNMFE Method RDCNMFE Method
Real time | | u n u h n | | | | ω n ω h n | | CPU runtime(s) | | u n u d n | | | | ω n ω d n | | CPU runtime(s)
t = 1.0 2.7256e-05 1.2863e-03 224.368 2.7274e-05 1.2901e-03 4.410
t = 1.5 2.5421e-05 1.4650e-03 260.357 4.7928e-05 1.4653e-03 4.545
t = 2.0 1.7506e-05 1.4287e-03 285.453 1.7724e-05 1.4523e-03 4.635
t = 2.5 1.1089e-05 1.3743e-03 311.536 1.5943e-05 1.6888e-03 4.678
t = 3.0 6.8308e-06 1.3343e-03 342.801 6.8312e-06 1.3403e-03 4.919
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated