Next Article in Journal
Representing Blurred Image without Deblurring
Previous Article in Journal
Night Vision Anti-Halation Algorithm of Different-Source Image Fusion Based on Low-Frequency Sequence Generation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Efficient Legendre–Galerkin Approximation for Fourth-Order Elliptic Problems with SSP Boundary Conditions and Variable Coefficients

1
School of Information, Guizhou University of Finance and Economics, Guiyang 550025, China
2
Postdoctoral Scientific Research Station, ShijiHengtong Technology Co., Ltd., Guiyang 550014, China
3
School of Management, Hefei University of Technology, Hefei 230009, China
4
College of Mathematics and Information Science, Guiyang University, Guiyang 550005, China
5
Financial Department, Guizhou University of Finance and Economics, Guiyang 550025, China
6
Computational Mathematics Research Center, Guizhou University of Finance and Economics, Guiyang 550025, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(10), 2236; https://doi.org/10.3390/math11102236
Submission received: 9 April 2023 / Revised: 7 May 2023 / Accepted: 8 May 2023 / Published: 10 May 2023
(This article belongs to the Section Mathematics and Computer Science)

Abstract

:
Under simply supported plate (SSP) boundary conditions, a numerical method based on the higher-order Legendre polynomial approximation was studied and developed for fourth-order problems with variable coefficients. We first divide the SSP boundary conditions into two types, namely, forced boundary conditions and natural boundary conditions. According to the forced boundary conditions, an appropriate Sobolev space is defined, and a variational formulation and a discrete scheme associated with the original problem are established. Then, the existence and uniqueness of this weak solution and approximate solution are proved. By using the Céa lemma and the tensor Jacobian polynomial approximation, we further obtain the error estimation for the numerical solutions. In addition, we use the orthogonality of Legendre polynomials to construct a set of effective basis functions and derive the equivalent tensor product linear system associated with the discrete scheme, respectively. Finally, some numerical tests were carried out to validate our algorithm and theoretical analysis.

1. Introduction

Fourth-order problems are important in many materials and engineering fields, such as fluid problems [1,2,3] and clamped rod problems [4,5,6]. In recent decades, engineers and mathematicians have proposed numerous numerical methods to solve fourth-order problems, including the finite element method [7,8,9,10], finite difference method [11,12], and spectral method [13,14,15,16]. In [17], a Legendre–Galerkin spectral method was proposed by Bialecki and Karageorghis to solve the biharmonic Dirichlet problem. In [18], Zhuang proposed a Legendre–Galerkin spectral element method for solving one-dimensional fourth-order equations. In [19], based on the dimension reduction technique, Li and An presented an effective spectral method to solve fourth-order problems with variable coefficients. In [20,21], Shen presented an efficient spectral-Galerkin method based on Legendre and Chebyshev polynomial approximations for second-and fourth-order equations. In [22], Eftekhari and Rashidinia studied the numerical solutions of time-fractional subdiffusion equations with distributed order by using block-pulse functions and Legendre polynomials. However, the existing numerical methods are mainly based on the fourth-order problem with clamped-plate boundary conditions. In [23], Chen et al. used the Legendre–Galerkin method to study the biharmonic eigenvalue problem of clamped plates, simply supported plates, and the Cahn–Hilliard model.
When defining the Sobolev space, especially in the case of SSP boundary conditions, it is required that its elements satisfy both forced and natural boundary conditions, leading to a complex construction of the basis functions. Therefore, defining a Sobolev space based solely on mandatory boundary conditions is of great significance, but it also poses certain challenges for theoretical analysis. Therefore, establishing a numerical method based on higher-order polynomial approximations in the Sobolev space with forced boundary conditions is of great importance. This will contribute to further studies in the analysis and implementation of meshless methods, such as radial basis functions (RBFs), spectral meshless radial point interpolation (SMRPI), the singular boundary method (SBM), etc. [24,25,26,27].
The aim of the current work is to develop a numerical method based on the higher-order Legendre polynomial approximation for fourth-order problems with variable coefficients under SSP boundary conditions. We first divide the SSP boundary conditions into two types, namely, forced boundary conditions and natural boundary conditions. With forced boundary conditions, an appropriate Sobolev space is defined, and a variational formulation and its discrete scheme associated with the original problem are established. Then, we obtain the existence and uniqueness of the solution. By using the Céa lemma and the tensor Jacobian polynomial approximation, we obtain the error estimation of the solution. In addition, we use the orthogonality of Legendre polynomials to construct a set of effective basis functions, and derive the equivalent tensor product linear system associated with the discrete scheme. Finally, some numerical tests were carried out to validate our algorithm and theoretical analysis.
The paper is organized as follows. In Section 2, we define the Sobolev space and derive the equivalent form. In Section 3, we prove the existence and uniqueness of solutions and error estimates. In Section 4, we provide a detailed description of the algorithm design. In Section 5, we use our algorithm on three-dimensional resource problems and two-dimensional eigenvalue problems. In Section 6, we perform numerical tests to illustrate the convergence and spectral accuracy of our algorithm. Finally, we state our concluding remarks in Section 7.

2. Sobolev Spaces and Equivalent Variational Formulation

We begin by considering the fourth-order model problem as follows:
Δ 2 ψ [ α ( x , y ) ψ ] + β ( x , y ) ψ = f ( x , y ) , ( x , y ) Ω ,
ψ = Δ ψ = 0 , ( x , y ) Ω ,
where α ( x , y ) and β ( x , y ) are non-negative functions.
We denote by H s ( Ω ) the usual s-th order space, and denote by · s , Ω and | · | s , Ω the norm and semi-norm in H s ( Ω ) , respectively. Specifically, when s = 0 , we have
H 0 ( Ω ) = L 2 ( Ω ) = { ψ : Ω | ψ | 2 d x d y < } ,
equipped with the following inner product and norm
( ψ , ϕ ) = Ω ψ ϕ d x d y , ψ = ( Ω | ψ | 2 d x d y ) 1 2 .
Define a Sobolev space as follows:
H * 2 ( Ω ) = H 0 1 ( Ω ) H 2 ( Ω ) ,
equipped with the following inner product and norm:
( ψ , ϕ ) 2 , Ω = | α | = 0 2 Ω D α ψ D α ϕ d x d y , ψ 2 , Ω = ( | α | = 0 2 D α ψ 2 ) 1 2 .
Using the Green formula, we can obtain the weak form of (1) and (2). To find ψ H * 2 ( Ω ) , such that
a ( ψ , ϕ ) = F ( ϕ ) , ϕ H * 2 ( Ω ) ,
where
a ( ψ , ϕ ) = Ω Δ ψ Δ ϕ d x d y + Ω α ψ ϕ d x d y + Ω β ψ ϕ d x d y , F ( ϕ ) = Ω f ϕ d x d y .
Define an approximation space X N ( Ω ) = ( P N × P N ) H * 2 ( Ω ) , where P N is an N-degree polynomial space. Then a discrete scheme associated with (3) is as follows: Find ψ N X N ( Ω ) , such that
a ( ψ N , ϕ N ) = F ( ϕ N ) , ϕ N X N ( Ω ) .

3. Existence and Uniqueness of Solutions and Error Estimates

Without the loss of generality, we shall confine our discussion to the following assumptions:
α * : = sup ( x , y ) Ω ¯ α ( x , y ) < , β * : = sup ( x , y ) Ω ¯ β ( x , y ) < ,
where Ω = ( 1 , 1 ) × ( 1 , 1 ) .
Lemma 1. 
For any ψ , ϕ H * 2 ( Ω ) , the following equalities hold:
Ω x x ψ y y ϕ d x d y = Ω x y ψ x y ϕ d x d y ,
Ω x x ψ y y ψ d x d y = Ω x y ψ x y ψ d x d y .
Proof. 
According to the formula of integration by parts, we derive that
Ω x x ψ y y ϕ d x d y = 1 1 x ψ y y ϕ | x = 1 x = 1 d y 1 1 x ψ x y ϕ | y = 1 y = 1 d x + Ω x y ψ x y ϕ d x d y = 1 1 x ψ ( 1 , y ) y y ϕ ( 1 , y ) x ψ ( 1 , y ) y y ϕ ( 1 , y ) d y 1 1 x ψ ( x , 1 ) x y ϕ ( x , 1 ) x ψ ( x , 1 ) x y ϕ ( x , 1 ) d x + Ω x y ψ x y ϕ d x d y .
Using boundary conditions (2), we obtain that
ψ ( ± 1 , y ) = ϕ ( ± 1 , y ) = ψ ( x , ± 1 ) = ϕ ( x , ± 1 ) = 0 .
It is concluded from (8) that
y y ϕ ( ± 1 , y ) = x ψ ( x , ± 1 ) = 0 .
Namely, (6) follows. We can obtain (7) by taking ϕ = ψ in (6). This completes our proof. □
Lemma 2. 
For any ψ H * 2 ( Ω ) , the following inequality holds:
Ω | ψ | 2 + | x ψ | 2 + | y ψ | 2 d x d y 4 Ω | x x ψ | 2 + | y y ψ | 2 d x d y .
Proof. 
Using boundary conditions and the Cauchy–Schwarz inequality, we have
Ω | ψ | 2 d x d y = Ω | 1 x x ψ | 2 d x d y Ω ( x + 1 ) ( 1 1 | x ψ | 2 d x ) d x d y 1 1 ( 1 1 ( x + 1 ) d x ) ( 1 1 | x ψ | 2 d x ) d y = 2 Ω | x ψ | 2 d x d y .
Similarly, we can obtain that
Ω | ψ | 2 d x d y 2 Ω | y ψ | 2 d x d y .
It follows from the above equalities that
Ω | ψ | 2 d x d y Ω | x ψ | 2 + | y ψ | 2 d x d y .
In addition, we derive that
Ω | x ψ | 2 d x d y = 1 1 ψ x ψ | x = 1 x = 1 d y Ω ψ x x ψ d x d y = Ω ψ x x ψ d x d y ( Ω | ψ | 2 d x d y ) 1 2 ( Ω | x x ψ | 2 d x d y ) 1 2 1 4 Ω | ψ | 2 d x d y + Ω | x x ψ | 2 d x d y 1 2 Ω | x ψ | 2 d x d y + Ω | x x ψ | 2 d x d y .
That is
1 2 Ω | x ψ | 2 d x d y Ω | x x ψ | 2 d x d y .
Similarly, we can obtain that
1 2 Ω | y ψ | 2 d x d y Ω | y y ψ | 2 d x d y .
Thus, we have
Ω | x ψ | 2 + | y ψ | 2 d x d y 2 Ω | x x ψ | 2 + | y y ψ | 2 d x d y .
We know from (9) and (10) that the desired result follows. □
Theorem 1. 
Let α ( x , y ) , β ( x , y ) satisfy the assumptions (5). Then, let a ( ψ , ϕ ) be a continuous and coercive form defined on H * 2 ( Ω ) × H * 2 ( Ω ) , i.e.,
| a ( ψ , ϕ ) | max { 1 , α * , β * } ψ 2 , Ω ϕ 2 , Ω , a ( ψ , ψ ) 1 5 ψ 2 , Ω 2 .
Proof. 
From Lemma 1, we derive that
Ω Δ ψ Δ ϕ d x d y = Ω ( x x ψ x x ϕ + x x ψ y y ϕ + y y ψ x x ϕ + y y ψ y y ϕ ) d x d y = Ω ( x x ψ x x ϕ + 2 x y ψ x y ϕ + y y ψ y y ϕ ) d x d y .
By using the Cauchy–Schwarz inequality, we can find that
| a ( ψ , ϕ ) | = | Ω Δ ψ Δ ϕ d x d y + Ω α ψ ϕ d x d y + Ω β ψ ϕ d x d y | Ω ( | x x ψ x x ϕ | + 2 | x y ψ x y ϕ | + | y y ψ y y ϕ | ) d x d y + α * Ω ( | x ψ x ϕ | + | y ψ y ϕ | ) d x d y + β * Ω | ψ ϕ | d x d y max { 1 , α * , β * } ψ 2 , Ω ϕ 2 , Ω .
On the other hand, by Lemma 2, we have
a ( ψ , ψ ) = Ω ( x x ψ x x ψ + 2 x y ψ x y ψ + y y ψ y y ψ ) d x d y + Ω α ( x ψ x ψ + y ψ y ψ ) d x d y + Ω β ψ ψ d x d y Ω ( | x x ψ | 2 + 2 | x y ψ | 2 + | y y ψ | 2 ) d x d y 1 5 ψ 2 , Ω 2 .
This completes our proof. □
Lemma 3. 
If f ( x , y ) L 2 ( Ω ) , then F ( ϕ ) is a bounded linear function defined on H * 2 ( Ω ) , i.e.,
| F ( ϕ ) | ϕ 2 , Ω ,
where a b means that a M b with M being a positive constant.
Proof. 
By the Cauchy–Schwarz inequality, we derive that
| F ( ϕ ) | = | Ω f ϕ d x d y | ( Ω | f | 2 d x d y ) 1 2 ( Ω | ϕ | 2 d x d y ) 1 2 ( Ω | ϕ x x | 2 + | ϕ y y | 2 + 2 | ϕ x y | 2 + | ϕ x | 2 + | ϕ y | 2 + | ϕ | 2 d x d y ) 1 2 = ϕ 2 , Ω .
This completes our proof. □
Theorem 2. 
If f ( x , y ) L 2 ( Ω ) , then the weak form (3) and discrete scheme (4) exist under unique solutions, ψ H * 2 ( Ω ) and ψ N X N ( Ω ) , respectively.
Lemma 4. 
Let ψ and ψ N be the solutions of (3) and (4), respectively. Then it holds that
ψ ψ N 2 , Ω inf ϕ N X N ( Ω ) ψ ϕ N 2 , Ω .
Proof. 
We obtain from (3) and (4) that
a ( ψ , ϕ N ) = F ( ϕ N ) , a ( ψ N , ϕ N ) = F ( ϕ N ) , ϕ N X N ( Ω ) ,
which lead to
a ( ψ ψ N , ϕ N ) = 0 , ϕ N X N ( Ω ) .
From Theorem 1 and (11), we arrive at
ψ ψ N 2 , Ω 2 a ( ψ ψ N , ψ ψ N ) = a ( ψ ψ N , ψ ϕ N + ϕ N ψ N ) = a ( ψ ψ N , ψ ϕ N ) + a ( ψ ψ N , ϕ N ψ N ) ψ ψ N 2 , Ω ψ ϕ N 2 , Ω ,
which implies that
ψ ψ N 2 , Ω ψ ϕ N 2 , Ω , ϕ N X N ( Ω ) .
Using (12) and the arbitrariness of the ϕ N , we can obtain the desired results. This completes our proof. □
From Theorem 7.4 in [28], we can obtain the following results:
Lemma 5. 
Let t and p be nonnegative real numbers, such that neither t 1 2 nor p 1 2 is an integer. There exists an operator Π ˜ N t , p , 0 from H t Ω H 0 p Ω into ( P N × P N ) H 0 p Ω , such that, for any real numbers r and s , 0 r t s , and for any function φ in H s Ω H 0 p Ω , the following estimate holds:
φ Π ˜ N t , p , 0 φ 2 , Ω N r s φ s , Ω .
Theorem 3. 
Let ψ and ψ N be the solutions of (3) and (4), respectively. If ψ H s Ω H 0 1 Ω , then it holds that
ψ ψ N 2 , Ω N 2 s ψ s , Ω .
Proof. 
From Lemmas 4 and 5, we derive that
ψ ψ N 2 , Ω inf ϕ N X N ψ ϕ N 2 , Ω ψ Π ˜ N 2 , 1 , 0 ψ 2 , Ω N 2 s ψ s , Ω .
Thus, the desired result follows. □

4. Algorithm Design

We will discuss the details of the algorithm’s implementation. We begin by constructing the space X N . Let
φ i ( x ) = 1 4 i + 6 [ L i ( x ) L i + 2 ( x ) ] , i = 0 , 1 , , N 2 , φ j ( y ) = 1 4 j + 6 [ L j ( y ) L j + 2 ( y ) ] , j = 0 , 1 , , N 2 ,
where L k is a k-degree Legendre polynomial. It is obvious that
X N ( Ω ) = span { φ i ( x ) φ j ( y ) , i , j = 0 , 1 , , N 2 } .
Next, we shall derive the equivalent matrix form associated with the discrete scheme (4). We expand ψ N ( x , y ) by
ψ N ( x , y ) = i = 0 N 2 j = 0 N 2 ψ i j φ i ( x ) φ j ( y ) .
Setting
Ψ = ψ 00 ψ 01 ψ 0 , N 2 ψ 10 ψ 11 ψ 1 , N 2 ψ N 2 , 0 ψ N 2 , 1 ψ N 2 , N 2 .
We denote by Ψ ¯ a column vector with ( N 1 ) 2 elements consisting of the N 1 columns of Ψ . Let ϕ N ( x , y ) = φ k ( x ) φ t ( y ) , ( k , t = 0 , 1 , , N 2 ) , then we derive that
Ω Δ ψ N Δ ϕ N d x d y = i = 0 N 2 j = 0 N 2 Ω Δ [ φ i ( x ) φ j ( y ) ] Δ [ φ k ( x ) φ t ( y ) ] d x d y ψ i j = i = 0 N 2 j = 0 N 2 ( a k i b t j + c k i d t j + d k i c t j + b k i a t j ) ψ i j = A ( k , : ) Ψ B ( t , : ) T + C ( k , : ) Ψ D ( t , : ) T + D ( k , : ) Ψ C ( t , : ) T + B ( k , : ) Ψ A ( t , : ) T = [ B ( t , : ) A ( k , : ) + D ( t , : ) C ( k , : ) + C ( t , : ) D ( k , : ) + A ( t , : ) B ( k , : ) ] Ψ ¯ ,
where
A = ( a k i ) , B = ( b k i ) , C = ( c k i ) , D = ( d k i ) , a k i = 1 1 φ k ( x ) φ i ( x ) d x , b k i = 1 1 φ k ( x ) φ i ( x ) d x , c k i = 1 1 φ k ( x ) φ i ( x ) d x , d k i = 1 1 φ k ( x ) φ i ( x ) d x .
In addition, A ( k , : ) indicates the k-th row of the matrix A, and ⊗ denotes the tensor product of the matrices, i.e., B A = ( b k i A ) . Likewise, we can derive that
Ω α ( x , y ) ψ N ϕ N d x d y = i = 0 N 2 j = 0 N 2 Ω α ( x , y ) [ φ i ( x ) φ j ( y ) ] [ φ k ( x ) φ t ( y ) ] d x d y ψ i j = i = 0 N 2 j = 0 N 2 Ω α ( x , y ) [ φ i ( x ) φ k ( x ) φ j ( y ) φ t ( y ) + φ i ( x ) φ k ( x ) φ j ( y ) φ t ( y ) ] d x d y ψ i j = M ( k + ( N 1 ) t , : ) Ψ ¯ ,
where
M = m k + ( N 1 ) t , i + ( N 1 ) j , m k + ( N 1 ) t , i + ( N 1 ) j = Ω α ( x , y ) ( φ i ( x ) φ k ( x ) φ j ( y ) φ t ( y ) + φ i ( x ) φ k ( x ) φ j ( y ) φ t ( y ) ) d x d y .
Ω β ( x , y ) ψ N ϕ N d x d y = i = 0 N 2 j = 0 N 2 Ω β ( x , y ) φ i ( x ) φ k ( x ) φ j ( y ) φ t ( y ) d x d y ψ i j = Q ( k + ( N 1 ) t , : ) Ψ ¯ , f k + ( N 1 ) t = Ω f ( x , y ) ϕ N d x d y = Ω f ( x , y ) φ k ( x ) φ t ( y ) d x d y ,
where
Q = q k + ( N 1 ) t , i + ( N 1 ) j , F = f k + ( N 1 ) t , q k + ( N 1 ) t , i + ( N 1 ) j = 1 1 1 1 β ( x , y ) φ i ( x ) φ k ( x ) φ j ( y ) φ t ( y ) d x d y .
Thus, we can obtain the equivalent matrix form associated with the discrete scheme (4) as follows:
( B A + D C + C D + A B + M + Q ) Ψ ¯ = F .
Note that when α and β are nonnegative constants, the coefficient matrices A , B , C , D , M , Q in (13) are all sparse. Thus, we can use the sparse solver to solve (13) effectively. When α and β are general nonnegative functions, the coefficient matrices M , Q in (13) may be full and their elements can only be computed by using the Gauss–Legendre quadrature. For this case, we can effectively solve (13) by using a preconditioned iterative method. The linear system (13) can be solved efficiently.

5. Extension of the Algorithm

In this part, we will extend our algorithm to three-dimensional resource problems and two-dimensional fourth-order eigenvalue problems.

5.1. Three-Dimensional Resource Problems

We consider the model:
Δ 2 ψ [ α ( x , y , z ) ψ ] + β ( x , y , z ) ψ = f , ( x , y , z ) Ω ,
ψ = Δ ψ = 0 , ( x , y , z ) Ω ,
where α and β are non-negative functions, and Ω = ( 1 , 1 ) × ( 1 , 1 ) × ( 1 , 1 ) .

5.1.1. Case of Constant Coefficients

We can expand ψ N ( x , y , z ) by
ψ N ( x , y , z ) = i = 0 N 2 j = 0 N 2 q = 0 N 2 ψ i j q φ i ( x ) φ j ( y ) φ q ( z ) .
Setting
Ψ q = ψ 00 q ψ 01 q ψ 0 , N 2 q ψ 10 q ψ 11 q ψ 1 , N 2 q ψ N 2 , 0 q ψ N 2 , 1 q ψ N 2 , N 2 q .
We denote by Ψ ¯ q the vector formed by the columns of Ψ q . Let Ψ = ( Ψ ¯ 0 , Ψ ¯ 1 , , Ψ ¯ N 2 ) , and denote by Ψ ¯ the vectors formed by the columns of Ψ . Let ϕ N ( x , y , z ) = φ k ( x ) φ t ( y ) φ l ( z ) , ( k , t , l = 0 , 1 , , N 2 ) , then we derive that
Ω Δ ψ N Δ ϕ N d x d y d z = i = 0 N 2 j = 0 N 2 q = 0 N 2 Ω Δ [ φ i ( x ) φ j ( y ) φ q ( z ) ] Δ [ φ k ( x ) φ t ( y ) φ l ( z ) ] d x d y d z ψ i j q = i = 0 N 2 j = 0 N 2 q = 0 N 2 ( a k i b t j b l q + c k i d t j b l q + c k i b t j d l q + d k i c t j b l q + b k i a t j b l q + b k i c t j d l q + d k i b t j c l q + b k i d t j c l q + b k i b t j a l q ) ψ i j q = [ B ( l , : ) B ( t , : ) A ( s , : ) + B ( l , : ) D ( t , : ) C ( s , : ) + D ( l , : ) B ( t , : ) C ( s , : ) + B ( l , : ) C ( t , : ) D ( s , : ) + B ( l , : ) A ( t , : ) B ( s , : ) + D ( l , : ) C ( t , : ) B ( s , : ) + C ( l , : ) B ( t , : ) D ( s , : ) + C ( l , : ) D ( t , : ) B ( s , : ) + A ( l , : ) B ( t , : ) B ( s , : ) ] Ψ ¯ .
Similarly, we can derive that
Ω ψ N ϕ N d x d y d z = i = 0 N 2 j = 0 N 2 q = 0 N 2 Ω [ φ i ( x ) φ j ( y ) φ q ( z ) ] [ φ k ( x ) φ t ( y ) φ l ( z ) ] d x d y d z ψ i j q = i = 0 N 2 j = 0 N 2 q = 0 N 2 ( e k i b t j b l q + b k i e t j b l q + b k i b t j e l q ) ψ i j q = [ B ( l , : ) B ( t , : ) E ( s , : ) + B ( l , : ) E ( t , : ) B ( s , : ) + E ( l , : ) B ( t , : ) B ( s , : ) ] Ψ ¯
where
E = ( e k i ) , e k i = 1 1 φ k ( x ) φ i ( x ) d x .
Ω ψ N ϕ N d x d y = i = 0 N 2 j = 0 N 2 q = 0 N 2 b k i b t j b l q ψ i j q = [ B ( l , : ) B ( t , : ) B ( s , : ) ] Ψ ¯ f ( k + 1 ) + ( N 3 ) t + ( N 3 ) 2 l = Ω f ( x , y , z ) ϕ N d x d y d z = Ω f ( x , y , z ) φ k ( x ) φ t ( y ) φ l ( z ) d x d y d z .
Thus, we can obtain the equivalent matrix form associated with the discrete scheme (4) as follows:
( A + B + C ) Ψ ¯ = F
where
A = B B A + B D C + D B C + B C D + B A B + D C B + C B D + C D B + A B B , B = α ( B B E + B E B + E B B ) , C = β ( B B B ) .

5.1.2. Case of Variable Coefficients

In this section, we assume that α and β are variable coefficients. As in Section 5.1.1, we derive that
Ω α ( x , y , z ) ψ N ϕ N d x d y d z = i = 0 N 2 j = 0 N 2 q = 0 N 2 Ω α ( x , y , z ) [ φ i ( x ) φ j ( y ) φ q ( z ) ] [ φ k ( x ) φ t ( y ) φ l ( z ) ] d x d y d z ψ i j q = G ( k + ( N 1 ) t + ( N 1 ) 2 l , : ) Ψ ¯
where
G = g k + ( N 1 ) t + ( N 1 ) 2 l , i + ( N 1 ) j + ( N 1 ) 2 q , g k + ( N 1 ) t + ( N 1 ) 2 l , i + ( N 1 ) j + ( N 1 ) 2 q = Ω α ( x , y , z ) ( φ i ( x ) φ k ( x ) φ j ( y ) φ t ( y ) φ q ( z ) φ l ( z ) + φ i ( x ) φ k ( x ) φ j ( y ) φ t ( y ) φ q ( z ) φ l ( z ) + φ i ( x ) φ k ( x ) φ j ( y ) φ t ( y ) φ q ( z ) φ l ( z ) ) d x d y d z .
Ω β ( x , y , z ) ψ N ϕ N d x d y = H ( k + ( N 1 ) t + ( N 1 ) 2 l , : ) Ψ ¯ ,
where
H = h k + ( N 1 ) t + ( N 1 ) 2 l , i + ( N 1 ) j + ( N 1 ) 2 q , h k + ( N 1 ) t + ( N 1 ) 2 l , i + ( N 1 ) j + ( N 1 ) 2 q = Ω β ( x , y , z ) ( φ i ( x ) φ k ( x ) φ j ( y ) φ t ( y ) φ q ( z ) φ l ( z ) d x d y d z .
Thus, we can obtain the equivalent matrix form associated with the discrete scheme of (14) and (15) as follows:
( A + G + H ) Ψ ¯ = F .

5.2. Two-Dimensional Fourth-Order Eigenvalue Problem

To clearly express our thoughts, we focus on the case where α and β are nonnegative constants and Ω = ( 1 , 1 ) × ( 1 , 1 ) . We consider following the two-dimensional fourth-order eigenvalue problem:
Δ 2 ψ ( α ψ ) + β ψ = λ ψ , ( x , y ) Ω ,
ψ ( x , y ) = Δ ψ ( x , y ) = 0 , ( x , y ) Ω .
From the Green formula, we can derive a weak form of (16) and (17). That is to find ( λ , ψ 0 ) C × H * 2 ( Ω ) , such that
a ( ψ , ϕ ) = λ b ( ψ , ϕ ) , ϕ H * 2 ( Ω ) ,
where
a ( ψ , ϕ ) = Ω Δ ψ Δ ϕ d x d y + Ω α ψ ϕ d x d y + Ω β ψ ϕ d x d y , b ( ψ , ϕ ) = Ω ψ ϕ d x d y .
A discrete scheme associated with the weak form (18) is as follows: Find ( λ N , ψ N 0 ) C × X N ( Ω ) , such that
a ( ψ N , ϕ N ) = λ N ( ψ N , ϕ N ) , ϕ N X N ( Ω ) .
We expand ψ N ( x , y ) as follows
ψ N ( x , y ) = i = 0 N 2 j = 0 N 2 ψ i j φ i ( x ) φ j ( y ) .
Similar to Section 4, we can obtain the equivalent matrix form associated with the discrete scheme (19) as follows:
( B A + D C + C D + A B + M + Q ) Ψ ¯ = λ ( B B ) Ψ ¯ .

6. Numerical Tests

In this section, we will use a large number of numerical experiments to illustrate the convergence and spectral accuracy of our algorithm. We ran our program in MATLAB 2017a.
Let us begin by defining the following error norms:
ψ ψ N = ( Ω | ψ ψ N | 2 d x d y ) 1 2 , ψ ψ N L = m a x { | ψ ψ N | } , ψ ψ N k , Ω = ( | α | = 0 k D α ( ψ ψ N ) 2 ) 1 2 , k = 1 , 2 .

6.1. Two-Dimensional Resource Problem

Example 1. 
We take α = 4 , β = 8 , ψ ( x , y ) = ( x 2 1 ) 3 ( y 2 1 ) 3 sin ( x y ) . By plugging ψ ( x , y ) into Equations (1) and (2), we can obtain f ( x , y ) . For different N, the errors between the approximate solutions and exact solutions under L 2 norm, 1-norm, and 2-norm are listed in Table 1. To more intuitively demonstrate the efficiency and spectral accuracy, we provide the images of the exact solution and the approximate solution in Figure 1 and the error images between them in Figure 2.
It can be observed from Table 1 that the approximation solution arrives at about 10 15 with N 20 . In Figure 1 and Figure 2, we also observe that our algorithm is convergent, and it reaches about 10 15 accuracy under L norm.
Example 2. 
We take α = sin ( x + y ) + 2 , β = e x + y , ψ ( x , y ) = sin ( π x ) sin ( π y ) . Likewise, putting ψ ( x , y ) into Equations (1) and (2), we can obtain f ( x , y ) . For different N, the errors between the approximate solutions and exact solutions under L 2 norm, 1-norm, and 2-norm are listed in Table 2. We also provide the images of the exact solution and the approximate solution in Figure 3 and the error images between them in Figure 4.
It can be observed from Table 2 that the approximation solution arrives at about 10 13 accuracy with N 20 . We can also observe from Figure 3 and Figure 4 that our algorithm is convergent and arrives at about 10 15 accuracy under L norm.

6.2. Three-Dimensional Resource Problem

Example 3. 
We take α = 1 , β = 1 , ψ ( x , y ) = ( x 2 1 ) 3 ( y 2 1 ) 3 ( z 2 1 ) 3 e x + y + z . For different N, the errors between the approximate solutions and exact solutions under L 2 norm, 1-norm, and 2-norm are listed in Table 3. In addition, we also provide the error figures under three norms in Figure 5.
It can be observed that the approximate solution achieves an accuracy of about 10 10 even when N 16 . In Figure 5, we observe that the algorithm is still convergent and achieves spectral accuracy for the three-dimensional case.
Example 4. 
We take α = 3 , β = sin x sin y sin z + 2 , ψ ( x , y , z ) = ( x 2 1 ) 3 ( y 2 1 ) 3 ( z 2 1 ) 3 sin ( x y z ) . For different N, the L 2 norm, 1-norm, and 2-norm of the errors between the exact solutions and approximate solutions are listed in Table 4.
From Table 4, we can see that the approximation solution achieves an accuracy of about 10 12 even when N 14 . We also observe from Figure 6 that our algorithm is still spectrally accurate in the three-dimensional variable coefficient situation.

6.3. Two-Dimensional Eigenvalue Problem

Example 5. 
We take α = sin ( x + y ) + 2 , β = e x + y . For different N, the numerical results for the first four eigenvalues are presented in Table 5. In order to better demonstrate the convergence and spectral accuracy of our algorithm, we take the numerical solution of N = 50 as a reference solution, and list the error figures of the approximate eigenvalues under the L norm (left) and log–log scale (right) in Figure 7.
It can be seen from Table 5 that the first four eigenvalues achieve accuracies of at least 14 digits when N 20 . We can observe from Figure 7 that our algorithm can converge and achieve spectral accuracy.

7. Conclusions

We developed a numerical method based on the approximation of higher-order Legendre polynomials and a rigorous error analysis for fourth-order problems under SSP boundary conditions and variable coefficients. We have theoretically obtained the existence and uniqueness of solutions and approximations, as well as the error estimation between them. In addition, we have established an effective algorithm for solving the discrete problem, which guarantees the sparsity of the mass and stiffness matrices under constant coefficient conditions. Regarding variable coefficients, we can also use the preconditioned iterative method to effectively solve the problem. The theoretical analysis and algorithms proposed in this paper can be combined with spectral element methods to tackle some nonlinear fourth-order problems in general domains, such as the Cahn–Hilliard model and transmission eigenvalue problems, among others. These represent our future research goals.

Author Contributions

Validation, X.Y.; Investigation, J.J. and X.Z.; Resources, J.Z.; Writing—original draft, H.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This work is supported by the Science and Technology Program of Guizhou Province (no. QKHZC[2023]372) and the Innovation Exploration and Academic Emerging Project of Guizhou University of Finance and Economics (no. 2022XSXMA03).

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Li, D.; Qiao, Z. On the stabilization size of semi-implicit Fourier-spectral methods for 3D Cahn–Hilliard equations. Commun. Math. Sci. 2017, 15, 1489–1506. [Google Scholar] [CrossRef]
  2. Liu, F.; Shen, J. Stabilized semi-implicit spectral deferred correction methods for Allen-Cahn and Cahn-Hilliard equations. Math. Methods Appl. Sci. 2015, 38, 4564–4575. [Google Scholar] [CrossRef]
  3. Shen, J.; Yang, X. Numerical approximations of Allen-Cahn and Cahn-Hilliard equations. Discret. Contin. Dyn. Syst. 2010, 28, 1669–1691. [Google Scholar] [CrossRef]
  4. Cahn, J.W.; Hilliard, J.E. Free energy of a nonuniform system. I. Interfacial free energy. J. Chem. Phys. 1958, 28, 258–267. [Google Scholar] [CrossRef]
  5. Michelson, D.M.; Sivashinsky, G.I. Nonlinear analysis of hydrodynamic instability in laminar flames-II. Numerical experiments. Acta Astronaut. 1977, 4, 1207–1221. [Google Scholar] [CrossRef]
  6. Sivashinsky, G.I. Nonlinear analysis of hydrodynamic instability in laminar flames-I. Derivation of basic equations. Acta Astronaut. 1977, 4, 1177–1206. [Google Scholar] [CrossRef]
  7. Canuto, C. Eigenvalue approximations by mixed methods. RAIRO. Anal. Numrique 1978, 12, 27–50. [Google Scholar] [CrossRef]
  8. Rappaz, J.; Mercier, B.; Osborn, J.; Raviart, P.A. Eigenvalue approximation by mixed and hybrid methods. Math. Comput. 1981, 36, 427–453. [Google Scholar]
  9. Chen, W.; Lin, Q. Approximation of an eigenvalue problem associated with the stokes problem by the stream function-vorticity-pressure method. Appl. Math. 2006, 51, 73–88. [Google Scholar] [CrossRef]
  10. Yang, Y.D.; Jiang, W. Upper spectral bounds and a posteriori error analysis of several mixed finite element approximations for the stokes eigenvalue problem. Sci. China Math. 2013, 56, 1313–1330. [Google Scholar] [CrossRef]
  11. Sousa, E. An explicit high order method for fractional advection diffusion equations. J. Comput. Phys. 2014, 278, 257–274. [Google Scholar] [CrossRef]
  12. Liu, Y.; Du, Y.; Li, H.; He, S.; Gao, W. Finite difference/finite element method for a nonlinear time-fractional fourth-order reaction-diffusion problem. Comput. Math. Appl. 2015, 70, 573–591. [Google Scholar] [CrossRef]
  13. Canuto, C.; Hussaini, M.Y.; Quarteroni, A.; Zang, T.A. Spectral Methods: Evolution to Complex Geometries and Applications to Fluid Dynamics; Springer: New York, NY, USA, 2007. [Google Scholar]
  14. Guo, B.Y.; Jia, H.L. Spectral method on quadrilaterals. Math. Comput. 2010, 79, 2237–2264. [Google Scholar]
  15. Guo, B.Y.; Wang, L.L. Error analysis of spectral method on a triangle. Adv. Comput. Math. 2007, 26, 473–496. [Google Scholar] [CrossRef]
  16. Boyd, J.P. Chebyshev and Fourier Spectral Methods; Courier Corporation: Chelmsford, MA, USA, 2001. [Google Scholar]
  17. Bialecki, B.; Karageorghis, A. A Legendre spectral Galerkin method for the biharmonic Dirichlet problem. SIAM J. Sci. Comput. 2001, 22, 1549–1569. [Google Scholar] [CrossRef]
  18. Zhuang, Q. A Legendre spectral-element method for the one-dimensional fourth-order equations. Appl. Math. Comput. 2011, 218, 3587–3595. [Google Scholar] [CrossRef]
  19. Li, L.; An, J. An efficient spectral method and rigorous error analysis based on dimension reduction scheme for fourth order problems. Numer. Methods Partial Differ. Equ. 2021, 37, 152–171. [Google Scholar] [CrossRef]
  20. Shen, J. Efficient spectral-Galerkin method I. Direct solvers of second-and fourth-order equations using Legendre polynomials. SIAM J. Sci. Comput. 1994, 15, 1489–1505. [Google Scholar] [CrossRef]
  21. Shen, J. Efficient spectral-Galerkin method II. Direct solvers of second-and fourth-order equations using Chebyshev polynomials. SIAM J. Sci. Comput. 1995, 16, 74–87. [Google Scholar] [CrossRef]
  22. Eftekhari, T.; Rashidinia, J. A new operational vector approach for time-fractional subdiffusion equations of distributed order based on hybrid functions. Math. Methods Appl. Sci. 2023, 46, 388–407. [Google Scholar] [CrossRef]
  23. Chen, L.; An, J.; Zhuang, Q. Direct solvers for the biharmonic eigenvalue problems using Legendre polynomials. J. Sci. Comput. 2017, 70, 1030–1041. [Google Scholar] [CrossRef]
  24. Aslefallah, M.; Shivanian, E. Nonlinear fractional integro-differential reaction-diffusion equation via radial basis functions. Eur. Phys. J. Plus 2015, 130, 47. [Google Scholar] [CrossRef]
  25. Shivanian, E.; Aslefallah, M. Stability and convergence of spectral radial point interpolation method locally applied on two-dimensional pseudoparabolic equation. Numer. Methods Partial Differ. Equ. 2017, 33, 724–741. [Google Scholar] [CrossRef]
  26. Aslefallah, M.; Abbasbandy, S.; Shivanian, E. Numerical solution of a modified anomalous diffusion equation with nonlinear source term through meshless singular boundary method. Eng. Anal. Bound. Elem. 2019, 107, 198–207. [Google Scholar] [CrossRef]
  27. Aslefallah, M.; Yüzbaşi, Ş.; Abbasbandy, S. A Numerical Investigation Based on Exponential Collocation Method for Nonlinear SITR Model of COVID-19. CMES-Comput. Model. Eng. Sci. 2023, 136, 1687–1706. [Google Scholar] [CrossRef]
  28. Bernardi, C.; Maday, Y. Spectral methods. Handb. Numer. Anal. 1997, 5, 209–485. [Google Scholar]
Figure 1. Comparison between the exact solution (left) and approximation solution (right) with N = 35.
Figure 1. Comparison between the exact solution (left) and approximation solution (right) with N = 35.
Mathematics 11 02236 g001
Figure 2. The error images between the exact solution ψ ( x , y ) and approximation solution ψ N ( x , y ) with N = 20 (left) and N = 35 (right).
Figure 2. The error images between the exact solution ψ ( x , y ) and approximation solution ψ N ( x , y ) with N = 20 (left) and N = 35 (right).
Mathematics 11 02236 g002
Figure 3. Comparison images of the exact solution (left) and approximation solution (right) with N = 35.
Figure 3. Comparison images of the exact solution (left) and approximation solution (right) with N = 35.
Mathematics 11 02236 g003
Figure 4. Error images comparing the exact solution ψ ( x , y ) and the approximation solution ψ N ( x , y ) with N = 20 (left) and N = 35 (right).
Figure 4. Error images comparing the exact solution ψ ( x , y ) and the approximation solution ψ N ( x , y ) with N = 20 (left) and N = 35 (right).
Mathematics 11 02236 g004
Figure 5. Error figures of the approximate solutions under L 2 norm (left), 1-norm (middle), and 2-norm (right) for different N.
Figure 5. Error figures of the approximate solutions under L 2 norm (left), 1-norm (middle), and 2-norm (right) for different N.
Mathematics 11 02236 g005
Figure 6. Error figures of the approximate solutions under L 2 norm (left), 1-norm (middle) and 2-norm (right) for different N.
Figure 6. Error figures of the approximate solutions under L 2 norm (left), 1-norm (middle) and 2-norm (right) for different N.
Mathematics 11 02236 g006
Figure 7. Error figures between the numerical solution and reference solution under the L norm (left) and log–log scale (right).
Figure 7. Error figures between the numerical solution and reference solution under the L norm (left) and log–log scale (right).
Mathematics 11 02236 g007
Table 1. The errors between the approximate solutions and exact solutions for different N.
Table 1. The errors between the approximate solutions and exact solutions for different N.
N1015202530
ψ ψ N 2.7425 × 10 7 3.7772 × 10 15 2.5901 × 10 17 2.9216 × 10 17 8.2067 × 10 17
ψ ψ N 1 , Ω 6.4867 × 10 6 2.8978 × 10 14 1.8351 × 10 16 2.0932 × 10 16 6.1571 × 10 16
ψ ψ N 2 , Ω 8.5467 × 10 5 1.8442 × 10 12 1.8625 × 10 15 1.9914 × 10 15 4.9614 × 10 15
Table 2. The errors between the approximate solution and exact solution.
Table 2. The errors between the approximate solution and exact solution.
N1015202530
ψ ψ N 1.2534 × 10 5 4.8981 × 10 11 1.3900 × 10 15 5.9664 × 10 16 9.4303 × 10 16
ψ ψ N 1 , Ω 2.8380 × 10 4 1.7303 × 10 10 4.3041 × 10 14 3.3750 × 10 15 5.0537 × 10 15
ψ ψ N 2 , Ω 0.0033 2.0325 × 10 8 9.6800 × 10 13 3.1546 × 10 14 3.2913 × 10 14
Table 3. The errors between the approximate solutions and the exact solutions for different N.
Table 3. The errors between the approximate solutions and the exact solutions for different N.
N1012141618
ψ ψ N 1.8513 × 10 5 1.0605 × 10 7 3.5720 × 10 10 7.9225 × 10 13 2.4289 × 10 15
ψ ψ N 1 , Ω 3.8568 × 10 4 2.7105 × 10 6 1.0828 × 10 8 2.7807 × 10 11 5.0200 × 10 14
ψ ψ N 2 , Ω 0.0047 3.8446 × 10 5 1.7694 × 10 7 5.1558 × 10 10 1.0312 × 10 12
Table 4. The errors between the exact solutions and approximate solutions for different N.
Table 4. The errors between the exact solutions and approximate solutions for different N.
N1012141618
ψ ψ N 4.8359 × 10 9 5.9351 × 10 12 5.6922 × 10 15 3.5687 × 10 17 5.3367 × 10 17
ψ ψ N 1 , Ω 1.2948 × 10 7 1.9396 × 10 10 2.1964 × 10 13 3.5002 × 10 16 3.3728 × 10 16
ψ ψ N 2 , Ω 1.9575 × 10 6 3.4997 × 10 9 4.6127 × 10 12 5.6601 × 10 15 2.4368 × 10 15
Table 5. The numerical results of the first four eigenvalues for different N.
Table 5. The numerical results of the first four eigenvalues for different N.
N λ N 1 λ N 2 λ N 3 λ N 4
535.2544775663993164126.33914595504443177.793597223306051427.801015793001625
1035.2460676597821418126.34139750648265178.093277397853029430.41218968297477
1535.2460676594985998126.341393331936359178.093272608351242430.412179313580339
2035.2460676594985713126.341393331936658178.093272608351157430.412179313579088
2535.2460676594986495126.341393331936516178.093272608351043430.412179313579827
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhang, H.; Yang, X.; Jin, J.; Zhang, X.; Zhang, J. An Efficient Legendre–Galerkin Approximation for Fourth-Order Elliptic Problems with SSP Boundary Conditions and Variable Coefficients. Mathematics 2023, 11, 2236. https://doi.org/10.3390/math11102236

AMA Style

Zhang H, Yang X, Jin J, Zhang X, Zhang J. An Efficient Legendre–Galerkin Approximation for Fourth-Order Elliptic Problems with SSP Boundary Conditions and Variable Coefficients. Mathematics. 2023; 11(10):2236. https://doi.org/10.3390/math11102236

Chicago/Turabian Style

Zhang, Hui, Xingrong Yang, Jiulin Jin, Xu Zhang, and Jun Zhang. 2023. "An Efficient Legendre–Galerkin Approximation for Fourth-Order Elliptic Problems with SSP Boundary Conditions and Variable Coefficients" Mathematics 11, no. 10: 2236. https://doi.org/10.3390/math11102236

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop