Preprint
Article

This version is not peer-reviewed.

A POD-Based Reduced-Dimension Method of Solution Coefficient Vectors in Crank-Nicolson Mixed Finite Element Method for the Fourth-Order Parabolic Equation

A peer-reviewed article of this preprint also exists.

Submitted:

21 January 2025

Posted:

22 January 2025

You are already at the latest version

Abstract
The research proposes a method to reduce the dimension of the coefficient vector for Crank-Nicolson mixed finite element (CNMFE) solutions to solve the fourth-order variable coefficient parabolic equation. Initially, the CNMFE schemes and corresponding matrix schemes for the equation are established, followed by a thorough discussion of the uniqueness, stability, and error estimates for the CNMFE solutions. Next, a matrix-form reduced-dimension CNMFE (RDCNMFE) method is developed utilizing Proper Orthogonal Decomposition (POD) technology, with an in-depth discussion on the uniqueness, stability, and error estimates of the RDCNMFE solutions. The reduced-dimension method employ identical basis functions compared to standard CNMFE methods. It significantly reduces the number of unknowns in the computations, thereby effectively decreasing computational time, while there is no loss of accuracy. Finally, the viability and proficiency are substantiated by examining two numerical experiments.
Keywords: 
;  ;  ;  ;  ;  

1. Introduction

The research focuses on exploring the fourth-order variable coefficient parabolic equation with the initial-boundary value
u t + ε · ( b ( x , t ) ( · ( a ( t ) u ) ) ) = f ( u ) , ( x , t ) Ω × J , u ( x , t ) = Δ u ( x , t ) = 0 , ( x , t ) Ω × J ¯ , u ( x , 0 ) = u 0 ( x ) , x Ω .
Ω R d ( d = 1 , 2 , 3 ) is a bounded convex polygonal domain. Ω is boundary of Ω . J = ( 0 , T ] , 0 < T < . u 0 ( x ) is known initial function. a = a ( t ) , b = b ( x , t ) satisfying
H 1 : 0 < a 0 a ( t ) a 1 < + , H 2 : 0 < b 0 b ( x , t ) b 1 < + , H 3 : | a t ( t ) | + | b t ( x , t ) | d 0 ,
for some positive constants a 0 , a 1 , b 0 , b 1 and d 0 . ε is a positive constant. f ( u ) = u 3 u adheres to the properties of Lipschitz continuity, implying the existence of a positive constant L satisfying
| f ( u 1 ) f ( u 2 ) | L | u 1 u 2 | .
For simplicity, we assume that u 0 ( x ) = 0 in the following theoretical analysis.
The fourth-order parabolic equations are commonly used to describe higher-order physical behaviors, such as considering the internal damping or viscoelastic properties of materials. Within the category of fourth-order parabolic equations, models such as the Cahn-Hilliard equation [1,2], fourth-order reaction-diffusion equation [3,4], and the Swift-Hohenberg equation [5] are included. Due to the inclusion of higher-order derivatives, solving and analyzing these kinds of equations is usually more complex and often requires the use of numerical methods. Currently, various numerical methods have been employed to solve fourth-order parabolic equations. For example, finite element (FE) method [1,6,7], mixed finite element method (MFE) [3,8,9,10], discontinuous space-time MFE method [11,12], two-grid MFE method [13,14], weak galerkin FE method [2,15], finite difference method [16], implicit compact difference method [17,18,19,20], cubic spline method [21], blow-up [22,23,24,25] and so on. In the paper, the MFE method is employed to study the fourth-order variable coefficient parabolic equation for spatial analysis. The method of time discretization is the Crank-Nicolson (CN) scheme.
A prevalent challenge in addressing high-order partial differential equations (PDEs) through the MFE method is the rapid escalation of unknown dimensions when dealing with coupled equations, often resulting in a doubling of the data volume processed. Such significantly elevated dimensions not only heighten memory requirements but also substantially escalate computational costs. In practical scenarios, this increased computational burden can pose a significant barrier to solving complex PDE problems. An effective strategy to mitigate these challenges involves the implementation of order reduction techniques. The primary objective of these techniques is to minimize the number of variables considered during the solution process using mathematical methods, thereby alleviating computational demands while preserving as much as possible a good approximation quality. Currently, several effective numerical reduced-order methods have gained widespread application, including the POD method [26,27], the spectral element method [28] , the sparse grid method [29], and the balanced truncation method [30] .
Certainly, integrating POD technology with diverse numerical methods can effectively address a range of PDEs. It is the most widely utilized method for dimensionality reduction and has been attracting increasing attention. [31] and [32] combined the compact difference method and POD technique to study the fourth-order parabolic equation. Zhao and Piao [33] studied the KDV-RLW-Rosenau equation using the POD method in conjunction with B-spline Galerkin FE formulations. In [34], the heat equation was addressed using the POD reduced-order methods and the two-step backward differentiation formula (BDF2). Janes and Singler [35] solved the damped wave equation by the POD method and the second difference quotients (DDQs). He et al. [36] employed a space-time FE method that integrates a POD-based extrapolation with DG time stepping to analyze the parabolic equation. Lu et al. [37] merged the POD method with a collocation approach using local radial basis functions (RBFs) to address time-dependent nonlocal diffusion problems.
For the POD-based FE and MFE reduced-dimension models, there are two existing methods. The first involves establishing optimized models which reduce the dimensions of the FE or the MFE subspaces. For further references, please consult [38,39,40,41,42,43,44]. The second, introduced by Luo et al. in 2020, presented an innovative strategy for dimension reduction of CNFE [45,46] and CNMFE [47,48,49,50,51] solution coefficient vectors. To our understanding, no existing literature has documented simplifying the solution coefficient vectors of CNMFE scheme used POD technology in solving fourth-order variable coefficient parabolic equations. The paper primary objective presents a rapid algorithm capable of solving fourth-order variable coefficient parabolic equations.
The research is organized as follows: Section 2 discusses the CNMFE scheme, detailing its uniqueness, stability, and convergence. Section 3 dedicates to construct a POD-based RDCNMFE matrix model, while also analyze its uniqueness, stability, and error estimates. In Section 4, we perform numerical simulations on 2D fourth-order variable coefficient parabolic equations. Finally, Section 5 summarizes the key results and conclusions of the research.

2. The CNMFE Method for the Fourth-Order Variable Coefficient Parabolic Equation

2.1. The CNMFE Scheme

In this paper, the Sobolev spaces and the associated norms adhere to the conventional definitions commonly found in existing literature [52]. To construct the CNMFE scheme for the fourth-order variable coefficient parabolic equation (1), we begin by introducing a diffusion term defined as q = · ( a ( t ) u ) . This introduces a pair of lower-order equations
u t ε · ( b ( x , t ) q ) = f ( u ) , ( x , t ) Ω × J , q + · ( a ( t ) u ) = 0 , ( x , t ) Ω × J , u ( x , t ) = q ( x , t ) = 0 , ( x , t ) Ω × J ¯ .
Applying Green’s formula, we obtain the mixed weak form of (4) as provided below.
Problem 1. 
Find { u , q } : [ 0 , T ] H 0 1 × H 0 1 , such that
( u t , υ ) + ε ( b q , υ ) = ( f ( u ) , υ ) , υ H 0 1 , ( q , χ ) ( a u , χ ) = 0 , χ H 0 1 ,
Let h represent the quasi-uniform triangulation on Ω ¯ . The FE subspace S h is defined as the following span of the orthonormal basis { ζ j ( x ) } j = 1 M
S h = { υ h H 0 1 C ( Ω ) ; υ h K P M 1 ( K ) , K } = span { ζ j ( x ) : 1 j M } ,
where P M 1 ( K ) is a polynomial space of ( M 1 ) degree.
For a positive integer N, define Δ t = T / N , ψ n = ψ ( t n ) , ¯ t ψ n = ( ψ n ψ n 1 ) / Δ t and ψ n 1 2 = ( ψ n + ψ n 1 ) / 2 . Hence, Problem 1 can be reformulated at time t = t n 1 2 as follows.
( u t ( t n 1 2 ) , υ ) + ε ( b ( t n 1 2 ) q ( t n 1 2 ) , υ ) = ( f ( u ( t n 1 2 ) ) , υ ) , υ H 0 1 , ( q ( t n 1 2 ) , χ ) ( a ( t n 1 2 ) u ( t n 1 2 ) , χ ) = 0 , χ H 0 1 .
The equivalent equation is that
u n u n 1 Δ t , υ + ε ( b ( t n 1 2 ) q n 1 2 , υ ) = ( f ( u ^ ^ n 1 2 ) , υ ) + ( R 1 n 1 2 , υ ) + ( R 2 n 1 2 , υ ) , υ H 0 1 , ( q n 1 2 , χ ) ( a ( t n 1 2 ) u n 1 2 , χ ) = 0 , χ H 0 1 ,
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 ( t n 1 2 ) ) f ( u ^ ^ n 1 2 ) .
When t n = n Δ t , define the CNMFE approximations of { u , q } as { u h n , q h n } . Therefore, we can formulate the CNMFE scheme of Problem 1 using the form below.
Problem 2. 
For 1 n N , find { u h n , q h n } S h × S h , such that
( ¯ t u h n , υ h ) + ε ( b n 1 2 q h n 1 2 , υ h ) = ( f ( u ^ ^ h n 1 2 ) , υ h ) , υ h S h , ( q h n 1 2 , χ h ) ( a n 1 2 u h n 1 2 , χ h ) = 0 , χ h S h ,
Remark 1. 
[50], Formula (12) Using the 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 ,
it is evident that equation (12) structured as a linear scheme.

2.2. The Uniqueness, Stability and Error Estimates of the CNMFE Solutions

Utilizing the orthonormal basis of the FE space S h , the CNMFE approximations { u h n , q h n } to Problem 2 can be expressed as
u h n = j = 1 M U h j n ζ j = ζ · U h n , q h n = j = 1 M Q h j n ζ j = ζ · Q h n ,
in which ζ = ( ζ 1 , ζ 2 , , ζ M ) is the orthonormal basis function vector. U h n = ( U h 1 n , U h 2 n , ,
U h M n ) T and Q h n = ( Q h 1 n , Q h 2 n , , Q h M n ) T represent the unknown CNMFE solution coefficient vectors. With the solutions { u h n , q h n } defined in (14), the matrix-form of Problem 2 is as follows.
Problem 3. 
For 1 n N , find { U h n , Q h n } R M × R M and { u h n , q h n } S h × S h that satisfy
¯ t U h n + ε B n 1 2 Q h n 1 2 = F ( U ^ ^ h n 1 2 ) , Q h n 1 2 S n 1 2 U h n 1 2 = 0 , u h n = j = 1 M U h j n ζ j = U h n · ζ , q h n = j = 1 M Q h j n ζ j = Q h n · ζ ,
where
B n 1 2 = ( b i j ( t n 1 2 ) ) 1 i , j M , b i j ( t n 1 2 ) = ( b ( x , t n 1 2 ) ζ j , ζ i ) ,
S n 1 2 = ( a i j ( t n 1 2 ) ) 1 i , j M , a i j ( t n 1 2 ) = ( a ( t n 1 2 ) ζ 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. 
Given that Δ t is small enough, the Problem 3 has the unique CNMFE solutions { u h n , q h n } S h × S h .
Proof of Theorem 1. 
Problem 3 can alternatively be expressed as
I ε Δ t 2 B n S n I U h n Q h n = I ε Δ t 2 B n 1 S n 1 I U h n 1 Q h n 1 + Δ t F ( U ^ ^ h n 1 2 ) O ˜ ,
where I denotes the M × M identity matrix, and O ˜ stands for a zero column vector of M × 1 .
Due to
I O S n I I ε Δ t 2 B n S n I = I ε Δ t 2 B n O ε Δ t 2 S n B n + I ,
where O represents the M × M zero matrix. Because Δ t is small enough, ε Δ t 2 S n B n + I is invertible. Hence, the coefficient matrix of (16) is invertible, then there exists the unique solutions ( u h n , q h n ) S h × S h for Problem 3. □
It is necessary to discuss the characteristics of B and S in Problem 3 for establishing the stability of the CNMFE solutions.
Lemma 1. 
[53], Lemma 1.19 Matrices B and S are positive definite and satisfy the following properties
B C , B 1 C , S C , S 1 C .
Theorem 2. 
The CNMFE solutions { u h n , q h n } have unconditional stability.
Proof of Theorem 2. 
We represent (15) as
( B n 1 2 ) 1 ¯ t U h n + ε Q h n 1 2 = ( B n 1 2 ) 1 F ( U ^ ^ h n 1 2 ) , Q h n 1 2 = S n 1 2 U h n 1 2 .
Inserting the second equation of (19) into the first, and considering that S is positive definite, we obtain
( S n 1 2 ) 1 ( B n 1 2 ) 1 ¯ t U h n + ε U h n 1 2 = ( S n 1 2 ) 1 ( B n 1 2 ) 1 F ( U ^ ^ h n 1 2 ) .
Letting D n 1 2 = ( S n 1 2 ) 1 ( B n 1 2 ) 1 , and taking the inner product of (20) and ¯ t U h n , we have
( D n 1 2 ¯ t U h n , ¯ t U h n ) + ε ( U h n 1 2 , ¯ t U h n ) = ( D n 1 2 F ( U ^ ^ h n 1 2 ) , ¯ t U h n ) .
Then, two sides of (21) are that
( D n 1 2 ¯ t U h n , ¯ t U h n ) + ε ( U h n 1 2 , ¯ t U h n ) = ( D n 1 2 ) 1 2 ¯ t U h n 2 + ε 2 Δ t ( U h n 2 U h n 1 2 ) ,
and
( D n 1 2 F ( U ^ ^ h n 1 2 ) , ¯ t U h n ) C ( D n 1 2 ) 1 2 2 F ( U ^ ^ h n 1 2 ) + ( D n 1 2 ) 1 2 ¯ t U h n 2 .
Combining lemma 1 with (3), and considering that U h 0 and F ( U h 0 ) are bounded, we obtain
( D n 1 2 ) 1 2 2 F ( U ^ ^ h n 1 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 + C ( U h n 1 2 + U h n 2 2 ) , 2 n N ,
Combining (22), (23) and (24), we have
ε 2 Δ t ( U h n 2 U h n 1 2 ) C + C ( U h n 1 2 + U h n 2 2 ) , 2 n N .
Multiplying (25) by 2 Δ t , summating from 2 to n and noting that U h 1 C , we have
U h n 2 U h 1 2 + 2 Δ t ε i = 2 n C + C Δ t ε i = 0 n 1 U h i 2 U h 1 2 + C T + C Δ t i = 0 n 1 U h i 2 , C + C Δ t i = 0 n 1 U h i 2 , 2 n N .
We apply the Gronwall inequality to (26) to obtain
U h n 2 C e C n Δ t C , 1 n N .
And because
Q h n = S n U h n S n U h n C U h n C , 1 n N .
From (27) and (28), we get
U h n + Q h n C , 1 n N .
Given that ζ C , it easily follows
u h n + q h n = U h n · ζ + Q h n · ζ C U h n ζ + C Q h n ζ C , 1 n N .
As indicated by (29) and (30), the CNMFE solution coefficient vectors { U h n , Q h n } are bounded, implying that the CNMFE solutions { u h n , q h n } retain unconditional stability.
It is essential to define the projection operators R h and P h for analyzing the convergence of the CNMFE solutions.
Lemma 2. 
The projection R h : H 0 1 S h , defined by
( ( u R h u ) , χ h ) = 0 , χ h S h ,
with the following estimates
u R h u L 2 ( Ω ) + h u R h u H 1 ( Ω ) C h 2 u H 2 ( Ω ) ,
u t R h u t L 2 ( Ω ) C h 2 ( u H 2 ( Ω ) + u t H 2 ( Ω ) ) .
Lemma 3. 
The projection P h : H 0 1 S h , defined by
( b ( q P h q ) , υ h ) = 0 , υ h S h ,
with the following estimates
q P h q L 2 ( Ω ) + h q P h q H 1 ( Ω ) C h 2 q H 2 ( Ω ) ,
q t P h q t L 2 ( Ω ) C h 2 ( q H 2 ( Ω ) + q t H 2 ( Ω ) ) .
Errors can be divided for simplifying theoretical analysis 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 ,
q ( t n ) q h n = q ( t n ) P h q ( t n ) + P h q ( t n ) q h n = ψ n + θ n .
Subtracting (12) from (8) and using (31) and (34) at t = t n 1 2 , the error equations are derived as
ξ n ξ n 1 Δ t , υ h + ε ( b n 1 2 θ n 1 2 , υ h ) = η n η n 1 Δ t , υ h + ( f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) , υ h ) + ( R 1 n 1 2 , υ h ) + ( R 2 n 1 2 , υ h ) , υ h S h ,
( θ n 1 2 , χ h ) ( a n 1 2 ξ n 1 2 , χ h ) = ( ψ n 1 2 , χ h ) , χ h S h .
The following lemma is presented for deriving error estimates. The lemma can be straightforwardly obtained through Taylor expansion.
Lemma 4. 
[54] R 1 n 1 2 and R 2 n 1 2 satisfy the following estimates
R 1 n 1 2 C Δ t 2 u t t t L ( L 2 ) ,
R 2 n 1 2 C ( u ) Δ t 2 u t t t L ( L 2 ) .
Based on Lemmas 2, 3 and 4, we can establish the theorems that concern the fully discrete error estimates for the Crank-Nicolson method.
Theorem 3. 
Given that the solutions to (5) adhere to regularity conditions with u t L 2 ( H 2 ) , u t t t L ( L 2 ) , u L ( H 2 ) . It follows that a positive constant C exists, which does not depend on h and Δ t , satisfying
u ( t J ) u h J C ( h 2 | | + ( Δ t ) 2 u t t t L ( L 2 ) ) ,
in which | | u H 2 + u t L 2 ( H 2 ) + q H 2 + q t L 2 ( H 2 ) + u L ( H 2 ) .
Proof of Theorem 3. 
Taking υ h = θ n 1 2 and χ h = ξ n ξ n 1 Δ t in (39) and (40), respectively, we obtain
ε ( b n 1 2 ) 1 2 θ n 1 2 2 = ( η n η n 1 Δ t , θ n 1 2 ) ( ξ n ξ n 1 Δ t , θ n 1 2 ) + ( f ( u ^ ^ n 1 2 ) f ( u ^ ^ h 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 ξ n 1 Δ t ) ( a n 1 2 ξ n 1 2 , ξ n ξ n 1 Δ t ) = ( ψ n 1 2 , ξ n ξ n 1 Δ t ) .
Subtracting (45) from (44), we have
ε ( b n 1 2 ) 1 2 θ n 1 2 2 = ( η n η n 1 Δ t , θ n 1 2 ) ( a n 1 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 1 2 ) + ( R 1 n 1 2 , θ n 1 2 ) + ( R 2 n 1 2 , θ n 1 2 ) , = ( η n η n 1 Δ t , θ n 1 2 ) 1 2 Δ t ( ( a n 1 2 ) 1 2 ξ n 2 ( a n 1 2 ) 1 2 ξ n 1 2 ) + ( ψ n , ξ n ) ( ψ n 1 , ξ n 1 ) Δ t ( ξ n 1 2 , ψ n ψ n 1 Δ t ) + ( f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) , θ n 1 2 ) + ( R 1 n 1 2 , θ n 1 2 ) + ( R 2 n 1 2 , θ n 1 2 ) .
Multiplying (46) by 2 Δ t , summating from n = 1 , , J , and considering that ξ C 1 ξ and θ C 2 θ , we obtain
a 0 ξ J 2 + C ε b 0 Δ t n = 1 J θ n 1 2 2 C Δ t n = 1 J ( η n η n 1 Δ t 2 + f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) 2 + R 1 n 1 2 2 + R 2 n 1 2 2 ) + C ψ J 2 + C Δ t n = 1 J ( ξ n 1 2 2 + ψ n ψ n 1 Δ t 2 ) + a 0 2 ξ J 2 .
For the nonlinear term f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) 2 , from reference [50], we have
f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) 2 C ( η n 1 2 + η n 2 2 + ξ n 1 2 + ξ n 2 2 ) .
Substituting (48) into (47), and using the Gronwall lemma and ξ C 1 ξ , we get
ξ J 2 + C Δ t n = 1 J θ n 1 2 2 C Δ t n = 1 J ( η n η n 1 Δ t 2 + ψ n ψ n 1 Δ t 2 + R 1 n 1 2 2 + R 2 n 1 2 2 ) + C Δ t n = 0 J 1 η n 2 + C ψ J 2 .
Noting that
η n η n 1 Δ t 2 1 Δ t t n 1 t n η t ( s ) 2 d s ,
ψ n ψ n 1 Δ t 2 1 Δ t t n 1 t n ψ t ( s ) 2 d s .
Substituting (50) and (51) into (49) and combining Lemma 4, we obtain
ξ J 2 + C Δ t n = 1 J θ n 1 2 2 C ( t 0 t J ( η t ( s ) 2 + ψ t ( s ) 2 ) d s + ( Δ t ) 4 u t t t L ( L 2 ) 2 + Δ t n = 0 J 1 η n 2 + ψ J 2 ) .
The proof of (43) is effectively completed combining Lemma 2, 3, (52), and the triangle inequality.
Theorem 4. 
With u h 0 = R h u ( t 0 ) and q h 0 = R h q ( t 0 ) , given that the solutions to (5) adhere to regularity conditions with u t , q t L 2 ( H 2 ) , u t t t L ( L 2 ) , u L ( H 2 ) . It follows that a positive constant C exists, which does not depend on h and Δ t , satisfying
q ( t J ) q h J C ( h 2 | | + ( Δ t ) 2 u t t t L ( L 2 ) ) ,
Proof of Theorem 4. 
From (40) we can get
θ n θ n 1 Δ t , χ h a n 1 2 ξ n ξ n 1 Δ t , χ h = ψ n ψ n 1 Δ t , χ h , χ h S h .
Taking υ h = ξ n ξ n 1 Δ t and χ h = θ n 1 2 in (39) and (54), respectively, we obtain
ξ n ξ n 1 Δ t 2 + ε b n 1 2 θ n 1 2 , ξ n ξ n 1 Δ t = η n η n 1 Δ t , ξ n ξ n 1 Δ t + f ( u ^ ^ n 1 2 ) f ( u ^ ^ h 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 ,
1 2 Δ t ( θ n 2 θ n 1 2 ) = ( a n 1 2 ξ n ξ n 1 Δ t , θ n 1 2 ) ( ψ n ψ n 1 Δ t , θ n 1 2 ) a 1 ( ξ n ξ n 1 Δ t , θ n 1 2 ) + C ( ψ n ψ n 1 Δ t 2 + θ n 1 2 2 ) .
From (55), we have
ξ n ξ n 1 Δ t 2 + ε b 0 θ n 1 2 , ξ n ξ n 1 Δ t C ( η n η n 1 Δ t 2 + f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) 2 + R 1 n 1 2 2 + R 2 n 1 2 2 ) + 1 2 ξ n ξ n 1 Δ t 2 ,
so
θ n 1 2 , ξ n ξ n 1 Δ t C ( η n η n 1 Δ t 2 + f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) 2 + R 1 n 1 2 2 + R 2 n 1 2 2 ) ,
Substituting (58) into (56) yields
1 2 Δ t ( θ n 2 θ n 1 2 ) C ( η n η n 1 Δ t 2 + ψ n ψ n 1 Δ t 2 + 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 1 2 2 ) .
Multiplying (59) by 2 Δ t , summating from n = 1 , , J and employing (50) and (51), we get
θ J 2 θ 0 2 + C Δ t n = 1 J ( f ( u ^ ^ n 1 2 ) f ( u ^ ^ h n 1 2 ) 2 + R 1 n 1 2 2 + R 2 n 1 2 2 ) + C 0 t J ( η t ( s ) 2 + ψ t ( s ) 2 ) d s + C Δ t n = 1 J θ n 1 2 2 .
Using the Gronwall Lemma and (48),we have
θ J 2 θ 0 2 + C Δ t n = 0 J 1 ( η n 2 + ξ n 2 ) + C Δ t n = 1 J ( R 1 n 1 2 2 + R 2 n 1 2 2 ) + C 0 t J ( η t ( s ) 2 + ψ t ( s ) 2 ) d s .
Substitute (52) and Lemma 4 into (61), we get
θ J 2 θ 0 2 + C 0 t J ( η t ( s ) 2 + ψ t ( s ) 2 ) d s + C ( η n L ( L 2 ) 2 + ψ J 2 ) + C ( Δ t ) 4 u t t t L ( L 2 ) 2
We complete the proof combining Lemma 2, 3, (62) and the triangle inequality. □

3. The POD-Based RDCNMFE Method for the Fourth-Order Variable Coefficient Parabolic Equation

3.1. Structure of POD Bases

Initially, computing the first K -step coefficient vectors { U h n , Q h n } n = 1 K by Problem 3, the snapshot matrices Z 1 = ( U h 1 , U h 2 , , U h K ) M × K and Z 2 = ( Q h 1 , Q h 2 , , Q h K ) M × K are generated. Next, we compute the eigenvalues and eigenvectors of matrices Z i Z i T ( i = 1 , 2 ) . Organize the eigenvalues as μ i , 1 μ i , 2 μ i , r i > 0 ( r i = rank ( Z i ) ) . The eigenvectors form the eigenmatrix Φ ˜ i = ( φ i , 1 , φ i , 2 , , φ i , r i ) R M × r i . Lastly, the initial d vectors of Φ ˜ i are selected as POD bases Φ i = ( φ i , 1 , φ i , 2 , , φ i , d ) ( d r i ) , such that
Z i Φ i Φ i T Z i 2 = μ i , d + 1 , i = 1 , 2 ,
in which Z 2 = s u p v R M Z v v and v = i = 1 M | v i | 2 for vector v = ( v 1 , v 2 , , v M ) T . For n = 1 , 2 , , K , it follows that
U h n Φ 1 Φ 1 T U h n = ( Z 1 Φ 1 Φ 1 T Z 1 ) e n ( Z 1 Φ 1 Φ 1 T Z 1 ) 2 e n μ 1 , d + 1 ,
Q h n Φ 2 Φ 2 T Q h n = ( Z 2 Φ 2 Φ 2 T Z 2 ) e n ( Z 2 Φ 2 Φ 2 T Z 2 ) 2 e n μ 2 , d + 1 .
e n ( 1 n K ) , the nth component being 1, named unit vectors. Consequently, Φ i = ( φ i , 1 , φ i , 2 , , φ i , d ) ( d r i , i = 1 , 2 ) are optimal POD bases.
Remark 2. 
It is obvious that the order M × M of the matrices Z i Z i T is significantly greater than the order K × K of the matrices Z i T Z i . However, their positive eigenvalues are same, we can compute the first d eigenvalues μ i , j and eigenvectors ϕ i , j of the matrices Z i T Z i . Then, we can derive the eigenvectors for Z i Z i T through the relationships φ i , j = Z i ϕ i , j / μ i , j . This approach facilitates the creation of POD bases Φ i . ( 1 j d , i = 1 , 2 )

3.2. The RDCNMFE Scheme

Initially, we let α d n = ( α 1 n , α 2 n , , α d n ) T and β d n = ( β 1 n , β 2 n , , β d n ) T , and define the RDCNMFE solution coefficient vectors as follows: U d n = ( U d 1 n , U d 2 n , , U d M n ) T and Q d n = ( Q d 1 n , Q d 2 n , , Q d M n ) T . Next, the first K RDCNMFE solution coefficient vectors are promptly derived using U d n = Φ 1 Φ 1 T U h n = : Φ 1 α d n and Q d n = Φ 2 Φ 2 T Q h n = : Φ 2 β d n , for 1 n K , as outlined in section 3.1. Finally, for subsequent time steps K + 1 n N , we employ U d n = Φ 1 α d n and Q d n = Φ 2 β d n , replacing the original CNMFE solution vectors { U h n , Q h n } in Problem 3. This allows us to develop the following RDCNMFE matrix scheme.
Problem 4. 
Find { U d n , Q d n } R M × R M and { u d n , ω d n } S h × S h ( 1 n N ) , such that
α d n = Φ 1 T U h n , β d n = Φ 2 T Q h n , 1 n K , Φ 1 ¯ t α d n + ε B n 1 2 Φ 2 β d n 1 2 = F ( Φ 1 α ^ ^ d n 1 2 ) , K + 1 n N , Φ 2 β d n 1 2 S n 1 2 Φ 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 · ζ , q d n = j = 1 M Q d j n ζ j = Q d n · ζ = Φ 2 β d n · ζ , 1 n N .
Here, { U h n , Q h n } ( n = 1 , 2 , , K ) denotes the first K solution vectors of Problem 3. The definitions of matrix B n 1 2 , S n 1 2 , and vector F , along with the FE basis vectors ζ = ( ζ 1 ( x ) , ζ 2 ( x ) , , ζ M ( x ) ) are detailed in section 2.2.

3.3. The Uniqueness, Stability and Error Estimate of the RDCNMFE Solutions

Theorem 5. 
With the assumptions laid out in Theorem 3 and 4, we consider { u n , q n } H 0 1 × H 0 1 as the solutions of Problem 1, and { u d n , q d n } S h × S h as reduced-dimension solutions of Problem 4. Then the RDCNMFE solutions are both unique and unconditionally stable for 1 n N , and have the error estimate as follows.
u n u d n + q n q d n C ( h 2 + Δ t 2 + μ 1 , d + 1 + μ 2 , d + 1 ) .
Proof of Theorem 5. 
(1)
Demonstrate the uniqueness.
For 1 n K , Theorem 1 ensures that the solutions { u h n , q h n } in problem 3 are unique. Consequently, the corresponding solutions { u d n , q d n } , derived from the first and fourth expressions of problem 4, also have uniqueness.
For K + 1 n N , by applying U d n = Φ 1 α d n and Q d n = Φ 2 β d n , the last three equations of Problem 4 are reformulated as
¯ t U d n + ε B n 1 2 Q d n 1 2 = F ( U ^ ^ d n 1 2 ) , K + 1 n N ,
Q d n 1 2 S n 1 2 U d n 1 2 = 0 , K + 1 n N ,
u d n = j = 1 M U d j n ζ j = U d n · ζ , q d n = j = 1 M Q d j n ζ j = Q d n · ζ , K + 1 n N .
For K + 1 n N , the solutions { u h n , q h n } n = K + 1 N in Problem 3 are unique. Because ( 68 ) ( 70 ) adhere to the identical structure as problem 3, the solutions { u d n , q d n } n = K + 1 N for ( 68 ) ( 70 ) also have uniqueness.
(2)
Analyse the stability.
(i) When 1 n K .
Applying Theorem 2 and considering the orthonormality of the vectors in Φ 1 and Φ 2 , it follows that
u d n + q d n = U d n · ζ + Q d n · ζ = Φ 1 Φ 1 T U h n · ζ + Φ 2 Φ 2 T Q h n · ζ C ( u h n + q h n ) C , 1 n K .
(ii) When K + 1 n N .
From the positive definite symmetry of matrix B , (68) can be reformulated as
( B n 1 2 ) 1 ¯ t U d n + ε Q d n 1 2 = ( B n 1 2 ) 1 F ( U ^ ^ d n 1 2 ) .
Substituting (69) into (72), and since S is positive definite, we obtain
( S n 1 2 ) 1 ( B n 1 2 ) 1 ¯ t U d n + ε U d n 1 2 = ( S n 1 2 ) 1 ( B n 1 2 ) 1 F ( U ^ ^ d n 1 2 ) .
Letting D n 1 2 = ( S n 1 2 ) 1 ( B n 1 2 ) 1 , and taking the inner product of (73) and ¯ t U d n , we have
( D n 1 2 ¯ t U d n , ¯ t U d n ) + ε ( U d n 1 2 , ¯ t U d n ) = ( D n 1 2 F ( U ^ ^ d n 1 2 ) , ¯ t U d n ) .
Then, two sides of (74) are that
( D n 1 2 ¯ t U d n , ¯ t U d n ) + ε ( U d n 1 2 , ¯ t U d n ) = ( D n 1 2 ) 1 2 ¯ t U d n 2 + ε 2 Δ t ( U d n 2 U d n 1 2 ) ,
and
( D n 1 2 F ( U ^ ^ d n 1 2 ) , ¯ t U d n ) C ( D n 1 2 ) 1 2 2 F ( U ^ ^ d n 1 2 ) + ( D n 1 2 ) 1 2 ¯ t U d n 2 .
Similar to (24), we obtain
( D n 1 2 ) 1 2 2 F ( U ^ ^ d n 1 2 ) 2 C + C ( U d n 1 2 + U d n 2 2 ) .
Combining (75), (76) and (77), we have
ε 2 Δ t ( U d n 2 U d n 1 2 ) C + C ( U d n 1 2 + U d n 2 2 ) .
Multiplying (78) by 2 Δ t and summating from 2 to n, it follows that
U d n 2 U d 1 2 + 2 Δ t ε i = 2 n C + C Δ t ε i = 0 n 1 U d i 2 U d 1 2 + C T + C Δ t i = 0 n 1 U d i 2 .
Noting that
U d 1 2 = Φ 1 Φ 1 T U h 1 2 C U h 1 2 C ,
putting (80) into (79), we have
U d n 2 C + C Δ t i = 0 n 1 U d i 2 .
Using the Gronwall inequality for (81),
U d n 2 C e C n Δ t C .
And
Q d n = S n U d n S n U d n C U d n C .
So we get
U d n + Q d n C .
Because of ζ C , we get
u d n + q d n = U d n · ζ + Q d n · ζ C U d n · ζ + C Q d n · ζ C , K + 1 n N .
Based on (71) and (85), we can conclude that the solutions { u d n , q d n } ( 1 n N ) exhibit unconditional stability.
(3)
Discuss the error estimates.
(i) For 1 n K .
According to (64) and (65), and considering ζ C , we obtain
u h n u d n + q h n q d n U h n U d n ζ + Q h n Q d n ζ C U h n Φ 1 Φ 1 T U h n + Q h n Φ 2 Φ 2 T Q h n C ( μ 1 , d + 1 + μ 2 , d + 1 ) , 1 n K .
(ii) For K + 1 n N .
Defining δ n = U h n U d n and ρ n = Q h n Q d n , and combining (19), (72) and (69), we obtain
( B n 1 2 ) 1 ¯ t δ n + ε ρ n 1 2 = ( B n 1 2 ) 1 F ( U ^ ^ h n 1 2 ) ( B n 1 2 ) 1 F ( U ^ ^ d n 1 2 ) ,
ρ n 1 2 = ( S n 1 2 ) 1 δ n 1 2 .
Putting (88) into (87), and since S is positive definite, we have
( S n 1 2 ) 1 ( B n 1 2 ) 1 ¯ t δ n + ε δ n 1 2 = ( S n 1 2 ) 1 ( B n 1 2 ) 1 F ( U ^ ^ h n 1 2 ) ( S n 1 2 ) 1 ( B n 1 2 ) 1 F ( U ^ ^ d n 1 2 ) .
Letting D n 1 2 = ( S n 1 2 ) 1 ( B n 1 2 ) 1 , we obtain
( D n 1 2 ) 1 ¯ t δ n + ε δ n 1 2 = ( D n 1 2 ) 1 F ( U ^ ^ h n 1 2 ) ( D n 1 2 ) 1 F ( U ^ ^ d n 1 2 ) .
Taking the inner product of (90) and ¯ t δ n ,
( ( D n 1 2 ) 1 ¯ t δ n , ¯ t δ n ) + ε ( δ n 1 2 , ¯ t δ n ) = ( ( D n 1 2 ) 1 F ( U ^ ^ h n 1 2 ) ( D n 1 2 ) 1 F ( U ^ ^ d n 1 2 ) , ¯ t δ n ) .
Then, two sides of (91) are that
( ( D n 1 2 ) 1 ¯ t δ n , ¯ t δ n ) + ε ( δ n 1 2 , ¯ t δ n ) = ( D n 1 2 ) 1 2 ¯ t δ n 2 + ε 2 Δ t ( δ n 2 δ n 1 2 ) ,
and
( ( D n 1 2 ) 1 F ( U ^ ^ h n 1 2 ) ( D n 1 2 ) 1 F ( U ^ ^ d n 1 2 ) , ¯ t δ n ) C ( D n 1 2 ) 1 2 2 F ( U ^ ^ h n 1 2 ) F ( U ^ ^ d n 1 2 ) 2 + ( D n 1 2 ) 1 2 ¯ t δ n 2 .
Using Lemma 1 and (3), we can estimate the first term of (93) as follows
( D n 1 2 ) 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 ) .
Combining (92), (93) and (94), we have
ε 2 Δ t ( δ n 2 δ n 1 2 ) C ( δ n 1 2 + δ n 2 2 ) .
Multiplying (95) by 2 Δ t and summating from K + 1 to n ( n N ) , it follows that
δ n 2 δ K 2 + C Δ t ε i = K 1 n 1 δ i 2 .
Noting that
δ K 2 = U h K U d K 2 = U h K Φ 1 Φ 1 T U h K 2 ,
Putting (97) into (96), from (64) and (65), we have
δ n 2 C μ 1 , d + 1 + C Δ t i = K 1 n 1 δ i 2 .
Applying the Gronwall’s inequality for (98),
δ n 2 C μ 1 , d + 1 e C n Δ t C μ 1 , d + 1 .
And
ρ n = S n δ n C S n δ n C δ n ,
thus, we get
δ n + ρ n C ( μ 1 , d + 1 + μ 2 , d + 1 ) .
Because of ζ C , we have
u h n u d n + q h n q d n U h n U d n · ζ + Q h n Q d n · ζ U h n U d n · ζ + Q h n Q d n · ζ C ( μ 1 , d + 1 + μ 2 , d + 1 ) .
Combining the triangle inequality, with Theorem 3 and 4, (86) and (102), we obtain
u n u d n + q n q d n u n u h n + u h n u d n + q n q h n + q h n q d n C ( h 2 + Δ t 2 + μ 1 , d + 1 + μ 2 , d + 1 ) , 1 n N .

4. The Numerical Experiments for the Fourth-Order Parabolic Equations

The efficiency of the proposed method is validated by two numerical examples. We compare the reduced-dimension scheme with the standard CNMFE scheme in terms of errors, convergence orders, and CPU runtime. For the purpose of analysis, we conduct experiments on the specified fourth-order parabolic equation.
u t + ε · ( b ( · ( a ( t ) u ) ) ) u 3 + u = g ( x , y , t ) , ( x , y , t ) Ω × ( 0 , T ] , u ( x , y , t ) = Δ u ( x , y , t ) = 0 , ( x , y , t ) Ω × [ 0 , T ] , u ( x , y , 0 ) = u 0 ( x , y ) , ( x , y ) Ω ,
Solving Problem 3 gets the standard CNMFE solutions { u h n , q h n } . In order to get the RDCNMFE solutions { u d n , q d n } , the four steps are as follows.
Step 1:
In order to generate the snapshot matrices Z 1 = ( U h 1 , U h 2 , , U h 20 ) and Z 2 = ( Q h 1 , Q h 2 , , Q h 20 ) , the initial K = 20 CNMFE solution vectors { U h n , Q h n } ( n = 1 , 2 , , 20 ) are calculated out by Problem 3.
Step 2:
Calculate the eigenvalues μ i , j ( i = 1 , 2 , j = 1 , 2 , , 20 ) of the matrix Z i T Z i and arrange them in descending order, along with their corresponding eigenvectors ϕ i , j .
Step 3:
By calculating, it is observed that μ i , 7 h 2 + Δ t 2 ( i = 1 , 2 ) . From the matrix Z i T Z i , the first 6 eigenvectors ϕ i , j ( j = 1 , 2 , , 6 ) can be selected. Applying the formula φ i , j = Z i ϕ i , j / μ i , j , we construct the POD bases Φ i = ( φ i , 1 , φ i , 2 , , φ i , 6 ) .
Step 4:
Inserting the result into Problem 4 and calculating the RDCNMFE solutions.
Example 1. 
We consider the model ( 104 ) in Ω = [ 0 , 1 ] 2 R 2 with the exact solution u ( x , y , t ) = e t sin ( π x ) sin ( π y ) . Choosing a ( t ) = t 2 + 1 , b = 1 , the source term is
g ( x , y , t ) = e t ( t 2 + 1 ) 4 ε π 4 sin ( π x ) sin ( π y ) e 3 t sin 3 ( π x ) sin 3 ( π y ) .
Since q = · ( a ( t ) u ) , the exact solution of q is q ( x , y , t ) = 2 π 2 e t ( t 2 + 1 ) sin ( π x ) sin ( π y ) .
When T = 1 , with h = 2 / 20 and Δ t = 1 / 100 , we get the standard CNMFE solutions and RDCNMFE solutions. They are compared with the exact solutions, as shown in Figure 1 and Figure 2. Obviously, both methods simulate the exact solutions very well.
When T = 1 and Δ t = 1 / 100 , so as to enable easier comparison, we use both methods to compute the L 2 error and convergence order of { u , q } , as shown in Table 1 and Table 2.
When T = 1.0 , 2.0 , 3.0 , with h = 2 / 40 and Δ t = 1 / 100 , we record the L 2 error obtained and the CPU runtime required using both methods to further examing the efficacy of the POD-based RDCNMFE method, as shown in Table 3. The data indicates that both methods obtain the same L 2 errors. With each incremental second, the conventional CNMFE method increases by approximately 260 seconds, whereas the RDCNMFE method only increases just over 10 seconds.
Example 2. 
We explore the model ( 104 ) in Ω = [ 0 , 1 ] 2 R 2 with the exact solution u ( x , y , t ) = e t sin ( 2 π x ) sin ( 2 π y ) . Letting a ( t ) = t 2 + 1 , b = 1 , the source term is
g ( x , y , t ) = e t ( t 2 + 1 ) 16 ε π 4 sin ( 2 π x ) sin ( 2 π y ) e 3 t sin 3 ( 2 π x ) sin 3 ( 2 π y ) .
The exact solution of q is q ( x , y , t ) = 8 π 2 e t ( t 2 + 1 ) sin ( 2 π x ) sin ( 2 π y ) .
When T = 1 , setting h = 2 / 20 and Δ t = 1 / 100 , we employ the CNMFE and RDCNMFE methods to obtain the numerical solutions for equation ( 104 ) that has the noted source term ( 106 ) . Both solutions of { u , q } are compared with the exact solutions. It can be seen clearly from Figure 3 and Figure 4 that both solutions closely approximate the exact solutions.
When T = 1 , setting Δ t = 1 / 100 and ε = 1 , 0.01 , 0.0001 , we compute the CNMFE and RDCNMFE solutions of { u , q } . Then we get the L 2 errors and convergence orders of both methods, as shown in Table 4 and Table 5. Figure 5 and Figure 6 provide the comparison of error results of { u , q } when ε = 1 , 0.01 , 0.0001 . The figures demonstrates that when ε is set to a very small value, such as ε = 0.0001 , although the solutions obtained by both methods are convergent, their associated errors tend to increase.
For purpose of demonstrating the effectiveness of the POD-based reduce-dimension method, we need to compare the CPU runtime of both methods. When T = 0.5 , 1.0 , 1.5 , 2.0 ,
2.5 , 3.0 , with h = 2 / 40 and Δ t = 1 / 100 , we calculate the CNMFE and RDCNMFE solutions. Then we recorded the CPU runtime required using both methods in Table 6. Evidenced in Table 6, using the CNMFE method, the CPU runtime increases by about 130 seconds for every additional 0.5 second. However, applying the RDCNMFE method, it takes just a few seconds for every added 0.5 second. The significant reduction in CPU runtime using the reduced-dimension method can be attributed to the difference in degrees of freedom at each time node. Specifically, the standard CNMFE method is calculated with 2 × 41 2 degrees of freedom, while the RDCNMFE method just has 2 × 6 degrees of freedom.
From the numerical results obtained from the above provided examples, it is evident that the RDCNMFE method based on POD serves as an efficient numerical technique for addressing the fourth-order variable coefficient parabolic equations.

5. Conclusions

In this research, our focus was on reducing dimension of solution coefficient vectors employing the CNMFE method combined with POD technique for the nonlinear variable coefficient fourth-order parabolic equation. Firstly, we developed a CNMFE scheme for the equations. We extensively analyzed the uniqueness, stability, and error estimates of the CNMFE solutions. Subsequently, the POD bases was derived from the initial K CNMFE solution coefficient vectors. We constructed a reduced-dimension matrix model and applied conventional FE analysis techniques in order to study the uniqueness, stability and convergence of the RDCNMFE solutions. Furthermore, we conducted detailed numerical experiments to compare the efficacy of both methods. The RDCNMFE method exhibited a reduced number of degrees of freedom at each time nodes compared to the conventional CNMFE method. This feature significantly reduces the computational load of the RDCNMFE method, thereby decreasing the runtime. Notably, this study has streamlined the calculations by linearizing the nonlinear terms, thereby eliminating repetitive numerical iterations. Thus, the RDCNMFE method emerges as an innovative and efficient numerical approach for addressing complex nonlinear PDEs.
In the following study, the method will be extended to more high-order PDEs, such as the fractional fourth-order PDEs, the Schrödinger equation with fourth-order disturbance term and so on. Additionally, we believe this method can be adapted to more complex 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

References

  1. Zhang, T. Finite element analysis for Cahn-Hilliard equation. Math. Numer. Sin. 2006, 28, 281-292. (in Chinese).
  2. Chai S, Wang Y , Zhao W ,et al. A C0 weak Galerkin method for linear Cahn-Hilliard-Cook equation with random initial condition. Appl. Math. Comput. 2022, 126659.
  3. Danumjaya, P., Pani, A.K. Mixed finite element methods for a fourth order reaction diffusion equation. Numer. Methods Partial Differ. Equ. 2012, 28, 1227-1251. [CrossRef]
  4. Tian J., He M., Sun P. Energy-stable finite element method for a class of nonlinear fourth-order parabolic equations. J. Comput. Appl. Math. 2024, 438, 115576. [CrossRef]
  5. Zhao X., Yang R., Qi R.J., Sun H. Energy stability and convergence of variable-step L1 scheme for the time fractional Swift-Hohenberg model. Fract. Calc. Appl. Anal. 2024, 27, 82-101. [CrossRef]
  6. Barrett, J.W., Blowey, J.F., Garcke, H. Finite element approximation of a fourth order nonlinear degenerate parabolic equation. Numer. Math. 1998, 80, 525-556. [CrossRef]
  7. Du S., Cheng Y., Li M. High order spline finite element method for the fourth-order parabolic equations. Appl. Numer. Math. 2023, 184, 496-511. [CrossRef]
  8. Liu Y., Fang Z.C., Li H., et al. A coupling method based on new MFE and FE for fourth-order parabolic equation. J. Appl. Math. Comput. 2013, 43, 249-269. [CrossRef]
  9. Liu, Y., Li, H., He, S., Gao, W., Fang, Z.C. H1-Galerkin mixed element method and numerical simulation for the fourth-order parabolic partial differential equations. Math. Numer. Sin. 2012, 34, 259-274. (in Chinese).
  10. Shi D.Y., Shi Y.H., Wang F.L. Supercloseness and the optimal order error estimates of H1-Galerkin mixed element method for fourth order parabolic equation. Math. Numer. Sin. 2014, 36, 363-380. ( in Chinese).
  11. Li H., Guo Y. The space-time mixed finite element method for fourth order parabolic problems. Journal of Inner Mongolia University (Natural Science Edition) 2006, 37, 19-22. (in Chinese).
  12. He S., Li H. The mixed discontinuous space-time finite element method for the fourth order linear parabolic equation with generalized boundary condition. Math. Numer. Sinica. 2009, 31, 167-178. (in Chinese).
  13. Liu Y., Du Y., Li H., et al. A two-grid mixed finite element method for a nonlinear fourth-order reaction-diffusion problem with time-fractional derivative. Comput. Math. Appl. 2015, 70, 2474-2492. [CrossRef]
  14. Yin B.L., Liu Y, Li H., et al. TGMFE algorithm combined with some time second-order schemes for nonlinear fourth-order reaction diffusion system. Results. Appl. Math. 2019, 4, 100080. [CrossRef]
  15. Chai S., Zou Y., Zhou C., et al. Weak Galerkin finite element methods for a fourth order parabolic equation. Numer. Meth. Part. D. E. 2019, 35, 1745-1755. [CrossRef]
  16. Zhao X., Liu F., Liu B. Finite difference discretization of a fourth-order parabolic equation describing crystal surface growth. Appl. Anal. 2015, 94, 1-15. [CrossRef]
  17. Mohanty R.K., Kaur D., Singh S. A class of two- and three-level implicit methods of order two in time and four in space based on half-step discretization for two-dimensional fourth order quasi-linear parabolic equations. Appl. Math. Comput. 2019, 352, 68-87.
  18. Kaur D., Mohanty R.K. Highly accurate compact difference scheme for fourth order parabolic equation with Dirichlet and Neumann boundary conditions: Application to good Boussinesq equation. Appl. Math. Comput. 2020, 378, 125202.
  19. Gao G., Huang Y., Sun Z. Pointwise error estimate of the compact difference methods for the fourth-order parabolic equations with the third Neumann boundary conditions. Math. Meth. Appl. Sci. 2023, 47, 634-659. [CrossRef]
  20. Kaur D., Mohanty R.K. High-order half-step compact numerical approximation for fourth-order parabolic PDEs. Numer. Algorithms. 2024, 95, 1127-1153. [CrossRef]
  21. Sharma S., Sharma N. A fast computational technique to solve fourth-order parabolic equations: application to good Boussinesq, Euler-Bernoulli and Benjamin-Ono equations. Int. J. Comput. Math. 2024, 101, 194-216. [CrossRef]
  22. Ishige K., Miyake N., Okabe S. Blowup for a Fourth-Order Parabolic Equation with Gradient Nonlinearity. SIAM J. Math. Anal. 2020, 52, 927-953. [CrossRef]
  23. Ding H., Zhou J. Infinite Time Blow-Up of Solutions to a Fourth-Order Nonlinear Parabolic Equation with Logarithmic Nonlinearity Modeling Epitaxial Growth. Mediterr. J. Math. 2021, 18, 1-19. [CrossRef]
  24. Shao X., Tang G. Blow-up phenomena for a class of fourth order parabolic equation. J. Math. Anal. Appl. 2021, 505, 125445. [CrossRef]
  25. Zhao J., Guo B., Wang J. Global existence and blow-up of weak solutions for a fourth-order parabolic equation with gradient nonlinearity. Z. Angew. Math. Phys. 2024, 75, 1-12. [CrossRef]
  26. Luo Z.D. Finite element and reduced dimension methods for partial differential equations; Springer Singapore: Beijing, China, 2024.
  27. Luo Z.D., Chen G. Proper Orthogonal Decomposition Methods for Partial Differential Equations; Academic Press of Elsevier: San Diego, CA, USA, 2018.
  28. Shao W., Chen C. A fourth order Runge-Kutta type of exponential time differencing and triangular spectral element method for two dimensional nonlinear Maxwell’s equations. Appl. Numer. Math. 2025, 207, 348-369. [CrossRef]
  29. Zeiser A. Sparse grid time-discontinuous Galerkin method with streamline diffusion for transport equations. Part. D. E. Appl. 2023, 4, 38. [CrossRef]
  30. Jiang S., Cheng Y., Cheng Y., Huang Y. Generalized multiscale finite element method and balanced truncation for parameter-dependent parabolic problems. Mathematics 2023, 11, 4695. [CrossRef]
  31. Xu B., Zhang X., Ji D. 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, 474-483.
  32. Li Q., Chen H., Wang H. A proper orthogonal decomposition-compact difference algorithm for plate vibration models. Numer. Algorithms. 2023, 94, 1489-1518. [CrossRef]
  33. Zhao W., Piao G.R. A reduced Galerkin finite element formulation based on proper orthogonal decomposition for the generalized KDV-RLW-Rosenau equation. J. Inequal. Appl. 2023, 2023, 104. [CrossRef]
  34. Garcia-Archilla B., John V., Novo J. Second order error bounds for POD-ROM methods based on first order divided differences. Appl. Math. Letters. 2023, 146, 108836. [CrossRef]
  35. Janes A., Singler R.J. A new proper orthogonal decomposition method with second difference quotients for the wave equation. J. Comput. Appl. Math. 2025, 457, 116279. [CrossRef]
  36. He S., Li H., Liu Y. A POD based extrapolation DG time stepping space-time FE method for parabolic problems. J. Math. Anal. Appl. 2024, 539, 128501. [CrossRef]
  37. Lu J., Zhang L., Guo X., Qi Q. A POD based reduced-order local RBF collocation approach for time-dependent nonlocal diffusion problems. Appl. Math. Letters. 2025, 160, 109328. [CrossRef]
  38. 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. [CrossRef]
  39. Liu Q., Teng F., Luo Z.D. A reduced-order extrapolation algorithm based on CNLSMFE formulation and POD technique for two-dimensional Sobolev equations. Appl. Math. Ser. B. 2014, 29, 171-182. [CrossRef]
  40. 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. [CrossRef]
  41. Song J., Rui H. 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. [CrossRef]
  42. Song J, Rui H. Reduced-order finite element approximation based on POD for the parabolic optimal control problem. Numer. Algorithms. 2024, 95, 1189-1211. [CrossRef]
  43. 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. [CrossRef]
  44. Luo Z.D. A POD-based reduced-order TSCFE extrapolation iterative format for two-dimensional heat equations. Bound. Value. Probl. 2015, 2015, 1-15. [CrossRef]
  45. 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. [CrossRef]
  46. Zeng Y., 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. [CrossRef]
  47. 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. [CrossRef]
  48. Luo Z.D. The dimensionality reduction of Crank-Nicolson mixed finite element solution coefficient vectors for the unsteady Stokes equation. Mathematics. 2022, 10, 2273. [CrossRef]
  49. Li Y., Teng F., Zeng Y., et al. 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. [CrossRef]
  50. Chang, X.; Li, H. The reduced-dimension method for Crank-Nicolson mixed finite element solution coefficient vectors of the extended Fisher-Kolmogorov equation. Axioms. 2024, 13, 710. [CrossRef]
  51. Zeng Y., Li Y., Zeng Y., et al. 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, 107962.
  52. Adams R.A. Sobolev Spaces; Academic Press, New York, USA, 1975.
  53. Luo Z.D. The founfations and applications of mixed finite element methods; Chinese Science Press, Beijing, China, 2006. (in Chinese).
  54. 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. Sci. World J. 2013, 2013, 756281. [CrossRef]
Figure 1. (a) The exact solution u n . (b) The CNMFE solution u h n . (c) The RDCNMFE solution u d n .
Figure 1. (a) The exact solution u n . (b) The CNMFE solution u h n . (c) The RDCNMFE solution u d n .
Preprints 146822 g001
Figure 2. (a) The exact solution q n . (b) The CNMFE solution q h n . (c) The RDCNMFE solution q d n .
Figure 2. (a) The exact solution q n . (b) The CNMFE solution q h n . (c) The RDCNMFE solution q d n .
Preprints 146822 g002
Figure 3. (a) The exact solution u n . (b) The CNMFE solution u h n . (c) The RDCNMFE solution u d n .
Figure 3. (a) The exact solution u n . (b) The CNMFE solution u h n . (c) The RDCNMFE solution u d n .
Preprints 146822 g003
Figure 4. (a) The exact solution q n . (b) The CNMFE solution q h n . (c) The RDCNMFE solution q d n .
Figure 4. (a) The exact solution q n . (b) The CNMFE solution q h n . (c) The RDCNMFE solution q d n .
Preprints 146822 g004
Figure 5. Comparison of error results of u when ε = 1 , 0.01 , 0.0001 .
Figure 5. Comparison of error results of u when ε = 1 , 0.01 , 0.0001 .
Preprints 146822 g005
Figure 6. Comparison of error results of q when ε = 1 , 0.01 , 0.0001 .
Figure 6. Comparison of error results of q when ε = 1 , 0.01 , 0.0001 .
Preprints 146822 g006
Table 1. L 2 errors and convergence orders between the exact, CNMFE and RDCNMFE solutions of u.
Table 1. L 2 errors and convergence orders between the exact, CNMFE and RDCNMFE solutions of u.
CNMFE Method RDCNMFE Method
Grid | | u n u h n | | order | | u n u d n | | order
8 × 8 4.0880e-03 4.0880e-03
ε = 1 16 × 16 1.1926e-03 1.7773 1.1926e-03 1.7773
32 × 32 3.1003e-04 1.9436 3.1003e-04 1.9436
64 × 64 7.7556e-05 1.9991 7.7556e-05 1.9991
Table 2. L 2 errors and convergence orders between the exact, CNMFE and RDCNMFE solutions of q.
Table 2. L 2 errors and convergence orders between the exact, CNMFE and RDCNMFE solutions of q.
CNMFE Method RDCNMFE Method
Grid | | q n q h n | | order | | q n q d n | | order
8 × 8 1.9183e-01 1.9183e-01
ε = 1 16 × 16 5.5050e-02 1.8010 5.5050e-02 1.8010
32 × 32 1.4248e-02 1.9500 1.4248e-02 1.9500
64 × 64 3.5645e-03 1.9990 3.5645e-03 1.9990
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 | | | | q n q h n | | CPU runtime | | u n u d n | | | | q n q d n | | CPU runtime
T = 1.0 1.9848e-04 9.1218e-03 257.785s 1.9848e-04 9.1218e-03 61.542s
T = 2.0 7.2804e-05 8.7617e-03 518.493s 7.2804e-05 8.7617e-03 71.464s
T = 3.0 2.6836e-05 7.7620e-03 776.562s 2.6836e-05 7.7620e-03 88.742s
Table 4. L 2 errors and convergence orders between the genuine, CNMFE and RDCNMFE solutions of u.
Table 4. L 2 errors and convergence orders between the genuine, CNMFE and RDCNMFE solutions of u.
CNMFE Method RDCNMFE Method
Grid | | u n u h n | | order | | u n u d n | | order
5 × 5 4.5306e-02 4.5306e-02
ε = 1 10 × 10 1.2336e-02 1.8768 1.2336e-02 1.8768
20 × 20 3.1509e-03 1.9691 3.1509e-03 1.9691
40 × 40 7.9192e-04 1.9923 7.9192e-04 1.9923
5 × 5 4.5542e-02 4.5542e-02
ε = 0.01 10 × 10 1.2420e-02 1.8746 1.2420e-02 1.8746
20 × 20 3.1736e-03 1.9684 3.1736e-03 1.9684
40 × 40 7.9778e-04 1.9921 7.9778e-04 1.9921
5 × 5 8.0912e-02 8.0912e-02
ε = 0.0001 10 × 10 2.3697e-02 1.7717 2.3697e-02 1.7717
20 × 20 6.1544e-03 1.9450 6.1544e-03 1.9450
40 × 40 1.5541e-03 1.9856 1.5541e-03 1.9856
Table 5. L 2 errors and convergence orders between the genuine, CNMFE and RDCNMFE solutions of q.
Table 5. L 2 errors and convergence orders between the genuine, CNMFE and RDCNMFE solutions of q.
CNMFE Method RDCNMFE Method
Grid | | q n q h n | | order | | q n q d n | | order
5 × 5 8.1734e+00 8.1734e+00
ε = 1 10 × 10 2.2583e+00 1.8557 2.2583e+00 1.8557
20 × 20 5.7873e-01 1.9643 5.7873e-01 1.9643
40 × 40 1.4557e-01 1.9911 1.4557e-01 1.9911
5 × 5 8.2168e+00 8.2168e+00
ε = 0.01 10 × 10 2.2721e+00 1.8546 2.2721e+00 1.8546
20 × 20 5.8240e-01 1.9639 5.8240e-01 1.9639
40 × 40 1.4651e-01 1.9910 1.4651e-01 1.9910
5 × 5 1.4643e+01 1.4643e+01
ε = 0.0001 10 × 10 4.1238e+00 1.8281 4.1238e+00 1.8281
20 × 20 1.0595e+00 1.9605 1.0595e+00 1.9605
40 × 40 2.6680e-01 1.9896 2.6680e-01 1.9896
Table 6. Comparison of L 2 errors and CPU runtime of CNMFE and RDCNMFE solutions.
Table 6. Comparison of L 2 errors and CPU runtime of CNMFE and RDCNMFE solutions.
CNMFE Method RDCNMFE Method
Real time | | u n u h n | | | | q n q h n | | CPU runtime | | u n u d n | | | | q n q d n | | CPU runtime
T = 0.5 1.3087e-03 1.4793e-01 128.368s 1.3087e-03 1.4793e-01 56.044s
T = 1.0 7.9192e-04 1.4557e-01 254.327s 7.9192e-04 1.4557e-01 60.044s
T = 1.5 4.8003e-04 1.4453e-01 390.405s 4.8003e-04 1.4453e-01 69.740s
T = 2.0 2.9118e-04 1.4011e-01 522.115s 2.9118e-04 1.4011e-01 76.308s
T = 2.5 1.7665e-04 1.3271e-01 650.523s 1.7665e-04 1.3271e-01 83.345s
T = 3.0 1.0718e-04 1.2395e-01 781.210s 1.0718e-04 1.2395e-01 92.238s
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