Next Article in Journal
On the Simulations of Second-Order Oscillatory Problems with Applications to Physical Systems
Previous Article in Journal
Fascination with Fluctuation: Luria and Delbrück’s Legacy
Previous Article in Special Issue
A High-Order Approximate Solution for the Nonlinear 3D Volterra Integral Equations with Uniform Accuracy
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Space-Time Legendre-Petrov-Galerkin Method for Third-Order Differential Equations

1
Faculty of Science, Inner Mongolia University of Technology, Hohhot 010021, China
2
School of Mathematical Sciences, Inner Mongolia University, Hohhot 010021, China
*
Author to whom correspondence should be addressed.
Axioms 2023, 12(3), 281; https://doi.org/10.3390/axioms12030281
Submission received: 14 January 2023 / Revised: 10 February 2023 / Accepted: 22 February 2023 / Published: 8 March 2023
(This article belongs to the Special Issue Numerical Methods for Fractional and Integer PDEs)

Abstract

:
In this article, a space-time spectral method is considered to approximate third-order differential equations with non-periodic boundary conditions. The Legendre-Petrov-Galerkin discretization is employed in both space and time. In the theoretical analysis, rigorous proof of error estimates in the weighted space-time norms is obtained for the fully discrete scheme. We also formulate the matrix form of the fully discrete scheme by taking appropriate test and trial functions in both space and time. Finally, extensive numerical experiments are conducted for linear and nonlinear problems, and spectral accuracy is derived for both space and time. Moreover, the numerical results are compared with those computed by other numerical methods to confirm the efficiency of the proposed method.

1. Introduction

Spectral methods [1,2,3,4,5] play an increasingly important role in numerical methods for solving partial differential equations (PDEs) of classical and fractional orders. In most applications of time-dependent problems [6,7], spectral methods are applied in space combined with time discretization using finite difference methods. However, such a combination leads to a mismatch in the accuracy in the space and time of the fully discrete scheme. In recent years, some researchers proposed space-time spectral methods [8,9,10,11] for time-dependent problems to attain high-order accuracy in space and time simultaneously. In [12], Shen and Wang presented a new space-time spectral method based on a Legendre-Galerkin method in space and a dual Petrov-Galerkin formulation in time. In [13], new space-time spectral and structured spectral element methods were described for approximating solutions of fourth order problems with homogeneous boundary conditions, and the spectral accuracy was proved in both space and time. In [14], a novel multi-implicit space-time spectral element method was proposed for advection-diffusion-reaction problems characterized by multiple time scales. Authors in [15] investigated a space-time spectral approximation to handle multi-dimensional space-time variable-order fractional Schr o ¨ dinger equations. In [16], Legendre spectral methods were employed in both space and time discretization for solving multi-term time-fractional diffusion equations, and Fourier-like basis functions were constructed in space.
In this paper, a space-time Legendre-Petrov-Galerkin method is considered for the linear third-order differential equations, see [17]:
t u + x 3 u = f , ( x , t ) I x × I t , u ( ± 1 , t ) = x u ( 1 , t ) = 0 , t I ¯ t , u ( x , 1 ) = u 0 ( x ) , x I x ,
where the spatial domain is I x = ( 1 , 1 ) and time interval is I t = ( 1 , 1 ] . Without loss of generality, we assume that u 0 ( x ) = 0 .
The study of the above model is of great significance for general third-order problems. The Korteweg-de Vries (KdV) equation [18,19,20,21,22,23] is a typical third-order nonlinear differential equation with an important physics application background. There are some efficient numerical methods to solve the problem (1). Considering the nonsymmetric property of the third-order differential operator, Ma and Sun proposed a Legendre-Petrov-Galerkin method in space and the Crank-Nicolson method in time for solving third-order differential equations in [17]. They also analyzed in detail the stability and L 2 -norm convergence of the fully discrete schemes and extended the application of the proposed method to the KdV equation by performing Chebyshev collocation treatment on the nonlinear terms. In [24], Shen developed a new dual Petrov-Galerkin method to solve third-order differential equations, where the main feature of the proposed method is to choose trail functions and test functions satisfying underlying and “dual” boundary conditions, respectively. The author not only presented the error estimates of the fully discrete numerical schemes in the theoretical analysis, but also verified the theoretical results and demonstrated the efficiency of the proposed method through extensive numerical experiments. In [25], a new pseudo-spectral method was investigated for third-order differential equations in which zeros of P N 2 ( 2 , 1 ) ( x ) were used as collocation points. In [26], the author proposed spectral Chebyshev collocation algorithms for the approximation of the KdV equation with non-periodic boundary conditions, and discussed single- and multi-domain approaches combined with the backward Euler/Crank-Nicolson schemes in time. In [27], the error estimates of semi-discrete and fully discrete schemes were given for the KdV equations by applying the Legendre pseudo-spectral methods in space and finite difference methods in time. Qin and Ma developed a Legendre-tau-Galerkin method in time for solving nonlinear evolution equations in [28] and also considered the multi-interval forms. In numerical examples, the generalized KdV equations was considered, and its fully discrete scheme was given by combining the Legendre-Petrov-Galerkin methods in space with multi-interval forms of the Legendre-tau-Galerkin schemes in time. Furthermore, numerical results were compared with those computed by other methods in [17] under the same conditions. In this paper, in order to solve the linear third-order differential Equation (1) with high order accuracy in both space and time, we investigate a space-time spectral method. It is worth noting that considering the nonsymmetric property of third-order and first-order differential operators in space and time, respectively, we apply Petrov-Galerkin methods in both space and time.
The organization of this paper is as follows. In Section 2, on the basis of introducing some notations and definitions, we give the weak form and space-time Legendre-Petrov-Galerkin scheme for the problem (1). In Section 3, some corresponding lemmas are provided, and error estimates in the weighted space-time norms are obtained for the fully discrete scheme. In Section 4, a detailed implementation of the proposed method is presented by selecting the appropriate test and trial functions in both space and time. In Section 5, extensive numerical tests including nonlinear problems are conducted, and the numerical results are compared with those obtained by other methods to assess the efficiency and accuracy of our method. Finally, some conclusions are drawn in Section 6.

2. Space-Time Legendre-Petrov-Galerkin Scheme

We now introduce some notations. Let ω be a positive weight function in a bounded domain Ω . The norm is denoted by · Ω , ω in L ω 2 ( Ω ) whose inner product is given by ( u , v ) Ω , ω = Ω u v ω d Ω . Additionally, ω is dropped if ω 1 . Let X be a Banach space with norm · X and define L 2 ( ( a , b ) ; X ) = { v : a b v X d t < + } . Throughout this paper, C denotes a generic positive constant. In the following, denote ω ˜ α , β = ( 1 t ) α ( 1 + t ) β and ω α , β = ( 1 x ) α ( 1 + x ) β to distinguish the weight functions on I t from I x , where α , β are two parameters. Specific values are used in the article.
Definition 1 
([29]). Let A = ( a i j ) m × n and B p × q , then the tensor product of A and B is defined as the matrix
A B = a 11 B a 1 n B a m 1 B a m n B m p × n q .
Moreover, for arbitrary matrices A , B and C, the following properties hold:
vec ( A B C ) = ( C T A ) vec ( B ) , ( A B ) T = A T B T ,
where vec ( A ) = [ a 11 , , a m 1 , a 12 , , a m 2 , , a 1 n , , a m n ] T .
Denote Ω : = I x × I t . Let
H 0 1 , 2 ( I x ) = { v H 2 ( I x ) : v ( ± 1 ) = x v ( 1 ) = 0 } , H 0 1 ( I x ) = { v H 1 ( I x ) : v ( ± 1 ) = 0 } ,
and
H 0 1 ( I t ) = { v H 1 ( I t ) : v ( 1 ) = 0 } , H + 0 1 ( I t ) = { v H 1 ( I t ) : v ( 1 ) = 0 } .
Then, applying the integration by parts, the weak form of Problem (1) is to find u ( x , t ) H 0 1 , 2 ( I x ) H 0 1 ( I t ) such that
( t u , v ) Ω ( x 2 u , x v ) Ω = ( f , v ) Ω , v H 0 1 ( I x ) H + 0 1 ( I t ) .
Let P κ denote the set of polynomials of degree ≤ κ on [ 1 , 1 ] and denote L = ( M , N ) , where M and N are a pair of given positive integers. In order to present the fully discrete space-time spectral scheme, we introduce the following finite-dimensional spaces:
V N = P N ( I x ) H 0 1 , 2 ( I x ) , W N 1 = P N 1 ( I x ) H 0 1 ( I x ) ,
and
S M = P M ( I t ) H 0 1 ( I t ) , S M * = P M ( I t ) H + 0 1 ( I t ) .
Then we obtain the following space-time Legendre-Petrov-Galerkin scheme of (1): Find u L V N S M satisfying
( t u L , v ) Ω ( x 2 u L , x v ) Ω = ( f , v ) Ω , v W N 1 S M * .
Remark 1. 
Since Equation (1) is first-order in time, it is natural to use a “dual Petrov-Galerkin method". The key idea of the method is to use trial functions satisfying the underlying boundary conditions of the differential equations and test functions satisfying the “dual" boundary conditions, namely, S M and S M * are a pair of “dual" approximation spaces.

3. Error Estimate

Now, in order to analyze the error estimates for the scheme (7), we give a suitable comparison function introduced in [17,30]:
P N u ( x ) = ¯ x 2 P N 2 x 2 u ( x ) , v H 2 ( I x ) ,
which satisfies P N u ( ± 1 ) = x P N u ( 1 ) = 0 , x P N u ( 1 ) = x u ( 1 ) and P N : H 0 1 , 2 ( I x ) V N such that
( x 2 ( P N u u ) , x v ) = 0 , v W N 1 ,
where
¯ x 1 v ( x ) = x 1 v ( y ) d y , ¯ x m v ( x ) = ( ¯ x 1 ) m v ( x ) ,
and P N 2 is the Legendre-Galerkin projection operator.
Lemma 1 
([17,30]). If u H 0 1 , 2 ( I x ) H r ( I x ) and r 2 ,
x l ( P N u u ) I x , ω l 2 , l 2 C N l r x r u I x , ω r 2 , r 2 , 0 l 2 .
Orthogonal projection operator in time introduced in [12] is given by Π M : L ω ˜ 0 , 1 2 ( I t ) S M such that
( Π M u u , v ) I t , ω ˜ 0 , 1 = 0 , v S M .
Define H ^ 1 ( I t ) : = { v : v H 1 ( I t ) L ω ˜ 0 , 2 2 ( I t ) } , then considering the fact that ω ˜ 0 , 1 t v S M ( v S M * ) ,  one can observe u H ^ 1 ( I t ) ,
t ( Π M u u ) , v I t = ( Π M u u , ω ˜ 0 , 1 t v ) I t , ω ˜ 0 , 1 = 0 , v S M * .
Lemma 2 
([12]). If u L ω ˜ 0 , 1 2 ( I t ) and t k u L ω ˜ k , k 1 2 ( I t ) with 1 k s , we have
t l ( Π M u u ) I t , ω ˜ l , l 1 C M l s t s u I t , ω ˜ s , s 1 , l s , l = 0 , 1 .
Let A r ( Ω ) and B s ( Ω ) denote the sets of measurable functions satisfying u A r ( Ω ) < + and u B s ( Ω ) < + , respectively, where for integers r 2 , s 0 ,
u A r ( Ω ) = ( x r t u L ω ˜ 2 , 0 2 ( I t ; L ω r 2 , r 2 2 ( I x ) ) 2 + x r u L ω ˜ 0 , 1 2 ( I t ; L ω r 2 , r 2 2 ( I x ) ) 2 ) 1 2 , u B s ( Ω ) = ( x 2 t s u L ω ˜ s , s 1 2 ( I t ; L 2 ( I x ) ) 2 + t s u L ω ˜ s , s 1 2 ( I t ; L ω 2 , 2 2 ( I x ) ) 2 ) 1 2 .
Theorem 1. 
Suppose u L and u are the solutions of (1) and (7), respectively. If u A r ( Ω ) B s ( Ω ) L ω ˜ 1 , 1 2 ( I t ; H 0 1 , 2 ( I x ) ) H ^ 1 ( I t ; L 2 ( I x ) ) for integers r 2 , s 0 , then
u u L Ω , ω 1 , 0 ω ˜ 0 , 1 C ( N r u A r ( Ω ) + M s u B s ( Ω ) ) .
Proof. 
Denote U = P N Π M u . In order to derive the error estimates, we decompose the error into two parts: u L u = ( u L U ) + ( U u ) and denote u ˜ = u L U . Then according to (4) and (7), we have v W N 1 S M * ,
( t u ˜ , v ) Ω ( x 2 u ˜ , x v ) Ω = t ( u U ) , v Ω + x 2 ( U u ) , x v Ω .
According to the definition of P N and Π M , we can see for the right-hand terms of (17)
t ( u U ) , v Ω = t ( P N u P N Π M u ) , v Ω + t ( u P N u ) , v Ω = t ( u P N u ) , v Ω ,
x 2 ( U u ) , x v Ω = x 2 ( P N Π M u Π M u ) , x v Ω + x 2 ( Π M u u ) , x v Ω = x 2 ( Π M u u ) , x v Ω .
Then (17) can be simplified as follows:
( t u ˜ , v ) Ω ( x 2 u ˜ , x v ) Ω = t ( u P N u ) , v Ω + x 2 ( Π M u u ) , x v Ω .
Furthermore, taking v = ω 1 , 0 ω ˜ 1 , 1 u ˜ ( W N 1 S M * ) in (20), we obtain for the first term
( t u ˜ , v ) Ω = ( t u ˜ , ω 1 , 0 ω ˜ 1 , 1 u ˜ ) Ω = I x ( ω 1 , 0 ω ˜ 1 , 1 u ˜ 2 ) | 1 1 ( u ˜ , ω 1 , 0 t [ ω ˜ 1 , 1 u ˜ ] ) I t d x = ( u ˜ , ω 1 , 0 ω ˜ 1 , 1 t u ˜ ) Ω ( u ˜ , u ˜ ω 1 , 0 t ω ˜ 1 , 1 ) Ω ,
namely,
( t u ˜ , v ) Ω = ( u ˜ , ω 1 , 0 ω ˜ 0 , 2 u ˜ ) Ω = u ˜ Ω , ω 1 , 0 ω ˜ 0 , 2 2 .
For the second term of (20), we denote η ( x , t ) = ω 1 , 0 u ˜ , then
( x 2 u ˜ , x v ) Ω = ( x 2 u ˜ , ω ˜ 1 , 1 x [ ω 1 , 0 u ˜ ] ) Ω = ( x 2 [ η ω 1 , 0 ] , ω ˜ 1 , 1 x η ) Ω = ( x [ ω 1 , 0 x η + η x ω 1 , 0 ] , ω ˜ 1 , 1 x η ) Ω = ( x [ ω 1 , 0 x η ] , ω ˜ 1 , 1 x η ) Ω + ( x η , ω ˜ 1 , 1 x η ) Ω = ( x ω 1 , 0 x η + ω 1 , 0 x 2 η , ω ˜ 1 , 1 x η ) Ω + ( x η , ω ˜ 1 , 1 x η ) Ω = ( x η , ω ˜ 1 , 1 x η ) Ω ( ω 1 , 0 x 2 η , ω ˜ 1 , 1 x η ) Ω + ( x η , ω ˜ 1 , 1 x η ) Ω = ( x 2 η , ω 1 , 0 ω ˜ 1 , 1 x η ) Ω + 2 ( x η , ω ˜ 1 , 1 x η ) Ω ,
where
( x 2 η , ω 1 , 0 ω ˜ 1 , 1 x η ) Ω = I t ( ω 1 , 0 ω ˜ 1 , 1 ( x η ) 2 ) | 1 1 x η , ω ˜ 1 , 1 ( x ω 1 , 0 x η + ω 1 , 0 x 2 η ) I x d t = I t 0 2 ω ˜ 1 , 1 ( x η ) 2 ( 1 ) d t ( x η , ω ˜ 1 , 1 x η ) Ω + ( x η , ω ˜ 1 , 1 ω 1 , 0 x 2 η ) Ω ,
namely
( x 2 η , ω 1 , 0 ω ˜ 1 , 1 x η ) Ω = x η ( 1 ) I t , ω ˜ 1 , 1 2 1 2 ( x η , ω ˜ 1 , 1 x η ) Ω ,
then we can obtain for (23)
( x 2 u ˜ , x v ) Ω = x η ( 1 ) I t , ω ˜ 1 , 1 2 + 3 2 ( x η , ω ˜ 1 , 1 x η ) Ω = x η ( 1 ) I t , ω ˜ 1 , 1 2 + 3 2 x η Ω , ω ˜ 1 , 1 2 = x [ ω 1 , 0 u ˜ ] ( 1 ) I t , ω ˜ 1 , 1 2 + 3 2 x [ ω 1 , 0 u ˜ ] Ω , ω ˜ 1 , 1 2 .
By the Cauchy-Schwarz inequality and Young’s inequality, other terms of (20) can be estimated as follows:
t ( u P N u ) , v Ω = t ( u P N u ) , ω 1 , 0 ω ˜ 1 , 1 u ˜ Ω t ( u P N u ) Ω , ω 1 , 0 ω ˜ 2 , 0 u ˜ Ω , ω 1 , 0 ω ˜ 0 , 2 1 2 t ( u P N u ) Ω , ω 1 , 0 ω ˜ 2 , 0 2 + 1 2 u ˜ Ω , ω 1 , 0 ω ˜ 0 , 2 2 ,
x 2 ( Π M u u ) , x v Ω = x 2 ( Π M u u ) , ω ˜ 1 , 1 x [ ω 1 , 0 u ˜ ] Ω x 2 ( Π M u u ) Ω , ω ˜ 1 , 1 x [ ω 1 , 0 u ˜ ] Ω , ω ˜ 1 , 1 1 2 x 2 ( Π M u u ) Ω , ω ˜ 1 , 1 2 + 1 2 x [ ω 1 , 0 u ˜ ] Ω , ω ˜ 1 , 1 2 .
Collecting (21) to (28) leads to
u ˜ Ω , ω 1 , 0 ω ˜ 0 , 2 2 + x [ ω 1 , 0 u ˜ ] ( 1 ) I t , ω ˜ 1 , 1 2 + 3 2 x [ ω 1 , 0 u ˜ ] Ω , ω ˜ 1 , 1 2 1 2 t ( u P N u ) Ω , ω 1 , 0 ω ˜ 2 , 0 2 + 1 2 u ˜ Ω , ω 1 , 1 ω ˜ 0 , 2 2 + 1 2 x 2 ( Π M u u ) Ω , ω ˜ 1 , 1 2 + 1 2 x [ ω 1 , 0 u ˜ ] Ω , ω ˜ 1 , 1 2 ,
namely,
u ˜ Ω , ω 1 , 0 ω ˜ 0 , 2 C t ( u P N u ) Ω , ω 1 , 0 ω ˜ 2 , 0 + x 2 ( Π M u u ) Ω , ω ˜ 1 , 1 .
Furthermore, according to Lemmas 1 and 2, for the right-hand terms of (30), we can obtain estimates
t ( u P N u ) Ω , ω 1 , 0 ω ˜ 2 , 0 C t ( u P N u ) Ω , ω 2 , 2 ω ˜ 2 , 0 C N r x r t u Ω , ω r 2 , r 2 ω ˜ 2 , 0 2 ,
x 2 ( Π M u u ) Ω , ω ˜ 1 , 1 C x 2 ( Π M u u ) Ω , ω ˜ 0 , 1 C M s t s x 2 u Ω , ω ˜ s , s 1 ,
then
u ˜ Ω , ω 1 , 0 ω ˜ 0 , 2 C N r x r t u Ω , ω r 2 , r 2 ω ˜ 2 , 0 2 + M s t s x 2 u Ω , ω ˜ s , s 1 .
On the other hand, we obtain
U u Ω , ω 2 , 2 ω ˜ 0 , 1 P N Π M u P N u Ω , ω 2 , 2 ω ˜ 0 , 1 + P N u u Ω , ω 2 , 2 ω ˜ 0 , 1 C Π M u u Ω , ω 2 , 2 ω ˜ 0 , 1 + P N u u Ω , ω 2 , 2 ω ˜ 0 , 1 C M s t s u Ω , ω 2 , 2 ω ˜ s , s 1 + N r x r u Ω , ω r 2 , r 2 ω ˜ 0 , 1 .
According to the above estimates (33) and (34) and the triangle inequality, we derive the final error estimate
u u L Ω , ω 1 , 0 ω ˜ 0 , 1 u ˜ Ω , ω 1 , 0 ω ˜ 0 , 1 + U u Ω , ω 1 , 0 ω ˜ 0 , 1 C ( u ˜ Ω , ω 1 , 0 ω ˜ 0 , 2 + U u Ω , ω 2 , 2 ω ˜ 0 , 1 ) C ( N r ( x r t u Ω , ω r 2 , r 2 ω ˜ 2 , 0 + x r u Ω , ω r 2 , r 2 ω ˜ 0 , 1 ) + M s ( x 2 t s u Ω , ω ˜ s , s 1 + t s u Ω , ω 2 , 2 ω ˜ s , s 1 ) ) .
Remark 2. 
Similar to the proof of error estimates, by taking v = ω 1 , 0 ω ˜ 1 , 1 u L ( W N 1 S M * ) in scheme (7), we can easily obtain the stability results. Assume f L ω ˜ 2 , 0 2 ( I t ; L ω 1 , 0 2 ( I x ) ) , then u L is the solution of scheme (7) satisfying u L Ω , ω 1 , 0 ω ˜ 0 , 2 C f Ω , ω 1 , 0 ω ˜ 2 , 0 . Furthermore, there exists a zero solution if f = 0 , namely, the existence and uniqueness of u L can be proved easily.

4. Implementation

In order to present the detailed implementation of the Equation (1) with initial condition u ( x , 1 ) = u 0 ( x ) 0 , we take w = u u 0 such that w 0 : = w ( x , 1 ) = 0 and reformulate the equation of unknown solution w ( x , t ) , then we obtain the discrete scheme: Find w L V N S M satisfying
( t w L , v ) Ω ( x 2 w L , x v ) Ω = ( f , v ) Ω + ( x 2 u 0 , x v ) Ω , v W N 1 S M * .
We define the following basis functions in space and time:
V N = span { ( 1 x ) ϕ i ( x ) } , W N 1 = span { ϕ i ( x ) } , 0 i N 3 , S M = span { ψ j } , S M * = span { ψ j * } , 0 j M 1 ,
where
ϕ i ( x ) = c i + 1 ( L i L i + 2 ) , c i = 1 2 i + 1 , ψ j = L j + L j + 1 , ψ j * = L j L j + 1 .
Taking w L and v in scheme (36) as
w L = ( 1 x ) i = 0 N 3 j = 0 M 1 w j i ϕ i ( x ) ψ j ( t ) , v = ϕ n ( x ) ψ s * ( t ) ,
then we can obtain the matrix form of the scheme (36)
C W A + D W B = F ,
where A = ( a i n ) 0 i , n N 3 is a symmetric matrix with elements
a i n = ( ( 1 x ) ϕ i , ϕ n ) I x = 2 c i + 1 2 ( c i + c i + 2 ) , i = n , 2 c i c i + 1 ( i c i 1 c i ( i + 1 ) c i c i + 1 + ( i + 2 ) c i + 1 c i + 2 ) , i = n + 1 , 2 c i c i 1 c i + 1 , i = n + 2 , 2 i c i 2 c i 1 c i c i + 1 , i = n + 3 ,
and matrix B = ( b i n ) 0 i , n N 3 with elements
b i n = ( 2 L i + 1 ( 1 x ) L i + 1 , L n + 1 ) I x = 0 , i n 1 , 3 c i + 1 + 1 , i = n , ( 1 ) i + n 2 , i n + 1 .
For details about matrices C and D, see [12], and F = ( f s n ) 0 s M 1 , 0 n N 3 with f s n = ( f , ϕ n ψ s * ) Ω + ( x 2 u 0 , ϕ n ψ s * ) Ω , which can be computed by the Legendre-Gauss-type quadrature formulas.
Then according to the properties of matrix multiplication introduced in Section 2, Equation (36) can be formulated as
( A C + B D ) vec ( W ) = vec ( F ) .

5. Numerical Experiments

In this section, we present some numerical examples, including nonlinear problems, to demonstrate the accuracy and efficiency of the proposed method for third-order partial differential equations. Some numerical results are compared with those computed in [17,27].

5.1. Example 1

Consider the Equation (1) in time interval ( 0 , T ] with exact solution [17]:
u ( x , t ) = sin 2 ( π x ) sin ( 12 x + 12 t ) .
In Figure 1, we plot the time evolution of exact solutions and numerical solutions obtained by the proposed method and one can observe that numerical solutions well simulate the image of exact solutions. In [17], third-order partial differential Equations (1) were considered by combining the Legendre-Petrov-Galerkin methods in space with the Crank-Nicolson scheme for time advancing (see scheme (2.2) in [17]) and L 2 -errors in both space and time were given for the Equation (1) with exact solution (44) in numerical examples. So in order to show the efficiency of the proposed method in this paper, we present the spatial and temporal errors respectively in Table 1 and Table 2, where we compare the numerical results by our methods with those in [17] under the same conditions. By comparison, we can find that the numerical solutions obtained in this paper attain higher accuracy. Moreover, we report the L 2 -error in time and space by semi-log coordinates at t = 2 for the equation in Figure 2, and we can see that the straight lines indicate that the errors decay like exp ( c M ) and exp ( c N ).

5.2. Example 2

Consider the following KdV equation [24,27]:
t u + u x u + x 3 u = 0 , x ( a , b ) , t > 0 , u ( x , 0 ) = u 0 ( x ) , x ( a , b ) ,
with exact solution
u ( x , t ) = 12 κ 2 sech 2 ( κ ( x 4 κ 2 t x 0 ) ) ,
where κ and x 0 are given parameters.
In Figure 3, we show temporal and spatial L 2 -error using semi-log coordinates at t = 6 for the KdV Equation (45) with a = 50 , b = 50 , κ = 0.3 , x 0 = 20 . We can obviously observe that the errors are of the form e c K , where K = N for spatial errors, and K = M for temporal errors, which indicate the exponential convergence in both time and space.
In [27], a Legendre pseudo-spectral method was proposed for the KdV Equation (45) combined with finite difference methods in time (see scheme (2.3) in [27]), and temporal and spatial errors at t = 1 were given for the equation with exact solution (46) by taking a = 40 , b = 40 , κ = 0.3 , x 0 = 0 in the numerical examples. In Table 3 and Table 4, we compare the temporal and spatial errors, respectively, obtained by our method with those in [27] under the same conditions. We can observe from the results of comparison that the proposed method in this paper attains higher accuracy with smaller N.
Moreover, in Figure 4, we plot the time evolution of numerical solutions for the KdV Equation (45) with exact solution (46) by taking a = 30 , b = 30 , κ = 0.3 , x 0 = 20 and a = 30 , b = 30 , κ = 0.3 , x 0 = 0 respectively.

5.3. Example 3

Consider the following KdV equation [17,27]:
t u + ( 1 + 12 u ) x u + x 3 u = 0 , x ( a , b ) , t > 0 , u ( x , 0 ) = u 0 ( x ) , x ( a , b ) ,
with exact solution
u ( x , t ) = 1 4 κ 2 sech 2 1 2 ( κ x ( κ + κ 3 ) t + x 0 ) ,
where κ and x 0 are given parameters.
In [27], the KdV Equation (47) was considered with exact solution (48) by taking a = 12 , b = 12 , κ = 1 , x 0 = 0 in numerical examples, where relative L -errors were presented in numerical results compared with those computed by backward Euler/forward Euler methods in [26]. However, no specific error estimates were reported neither in space nor time. In this example, we present the spatial L 2 -error estimates by taking M = 6 and temporal L 2 -error estimates by taking N = 54 conducted by our method in Table 5. One can easily observe that exponential convergence is obtained both in space and time.

6. Conclusions

In this article, we investigate a space-time Legendre-Petrov-Galerkin method for solving the linear third-order differential equations with non-periodic boundary conditions. In the theoretical analysis, rigorous proof of error estimates in the weighted space-time norms is presented. In the numerical experiments, L 2 -error estimates are obtained by the proposed method and numerical results indicate the exponential convergence both in space and time. In addition, some numerical results are compared with those given by other numerical methods. By noticing the results, we can see that the proposed space-time spectral method in this paper can attain higher accuracy.
It is pointed out in some papers that multi-domain spectral methods in space and multi-interval spectral methods in time not only reduce the scale of the problems but also reach better accuracy. So, we try to investigate multi-domain forms in space or multi-interval forms in time of the space-time Legendre-Petrov-Galerkin methods in the forthcoming study.

Author Contributions

Conceptualization, S.T.; software, S.T.; validation, S.T. and H.L.; writing—original draft, S.T.; writing—review & editing, H.L.; funding acquisition, H.L. All authors have read and agreed to the published version of the manuscript.

Funding

This work is supported by the National Natural Science Foundation of China (12161063), Natural Science Foundation of Inner Mongolia Autonomous Regions (2021MS01018), Program for Innovative Research Team in Universities of Inner Mongolia Autonomous Region (NMGIRT2207).

Data Availability Statement

Data is contained within the article.

Acknowledgments

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

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Boyd, J.P. Chebyshev and Fourier Spectral Methods; Courier Corporation: Mineola, NY, USA, 2001; ISBN 0-486-41183-4. [Google Scholar]
  2. Canuto, C.; Hussaini, M.Y.; Quarteroni, A.; Zang, T.A. Spectral Methods: Fundamentals in Single Domains; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2007; ISBN 978-3-540-30725-9. [Google Scholar]
  3. Canuto, C.; Hussaini, M.Y.; Quarteroni, A.; Zang, T.A. Spectral Methods: Evolution to Complex Geometries and Applications to Fluid Dynamics; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2007; ISBN 978-3-540-30727-3. [Google Scholar]
  4. Guo, B. Spectral Methods and Their Applications; World Scientific: Singapore, 1998; ISBN 9-810-23333-7. [Google Scholar]
  5. Shen, J.; Tang, T.; Wang, L.L. Spectral Methods: Algorithms, Analysis and Applications; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2011; ISBN 978-3-540-71040-0. [Google Scholar]
  6. Bernardi, C.; Maday, Y. Spectral methods. Handb. Numer. Anal. 1997, 5, 209–485. [Google Scholar] [CrossRef]
  7. Canuto, C.; Hussaini, M.Y.; Quarteroni, A.; Zang, T.A. Spectral Methods in Fluid Dynamics; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2012; ISBN 978-3-540-52205-8. [Google Scholar]
  8. Tal-Ezer, H. Spectral methods in time for hyperbolic equations. SIAM J. Numer. Anal. 1986, 23, 11–26. [Google Scholar] [CrossRef] [Green Version]
  9. Fakhar-Izadi, F.; Dehghan, M. Space-time spectral method for a weakly singular parabolic partial integro-differential equation on irregular domains. Comput. Math. Appl. 2014, 67, 1884–1904. [Google Scholar] [CrossRef]
  10. Shan, Y.; Liu, W.; Wu, B. Space-time Legendre-Gauss-Lobatto collocation method for two-dimensional generalized Sine-Gordon equation. Appl. Numer. Math. 2017, 12, 92–107. [Google Scholar] [CrossRef]
  11. Tang, S.; Li, H.; Yin, B. A space-time spectral method for multi-dimensional Sobolev equations. J. Math. Anal. Appl. 2021, 499, 124937. [Google Scholar] [CrossRef]
  12. Shen, J.; Wang, L. Fourierization of the Legendre-Galerkin method and a new space-time spectral method. Appl. Numer. Math. 2007, 57, 710–720. [Google Scholar] [CrossRef]
  13. Zhang, C.; Yao, H.; Li, H. New space-time spectral and structured spectral element methods for high order problems. J. Comput. Appl. Math. 2019, 351, 153–166. [Google Scholar] [CrossRef]
  14. Pei, C.; Mark, S.; Hussaini, M.Y. New multi-implicit space-time spectral element methods for advection-diffusion-reaction problems. J. Sci. Comput. 2019, 78, 653–686. [Google Scholar] [CrossRef]
  15. Bhrawy, A.H.; Zaky, M.A. An improved collocation method for multi-dimensional space-time variable-order fractional Schrödinger equations. Appl. Numer. Math. 2017, 111, 197–218. [Google Scholar] [CrossRef]
  16. Zheng, M.; Liu, F.; Anh, V.; Turner, I. A high-order spectral method for the multi-term time-fractional diffusion equations. Appl. Math. Model. 2016, 40, 4970–4985. [Google Scholar] [CrossRef]
  17. Ma, H.; Sun, W. A Legendre-Petrov-Galerkin and Chebyshev collocation method for third-order differential equations. SIAM J. Numer. Anal. 2000, 38, 1425–1438. [Google Scholar] [CrossRef]
  18. Ma, H.; Guo, B. The Fourier pseudo-spectral method with a restrain operator for the Korteweg-de Vries equation. J. Comput. Phys. 1986, 65, 120–137. [Google Scholar]
  19. Djidjeli, K.; Price, W.G.; Twizell, E.H.; Wang, Y. Numerical methods for the solution of the third and fifth-order dispersive Korteweg-de Vries equations. J. Comput. Appl. Math. 1995, 58, 307–336. [Google Scholar] [CrossRef] [Green Version]
  20. Carey, G.F.; Shen, Y. Approximations of the KdV equation by least squares finite elements. Comput. Methods Appl. Mech. Eng. 1991, 93, 1–11. [Google Scholar] [CrossRef]
  21. Chan, T.F.; Kerkhoven, T. Fourier methods with extended stability intervals for the Korteweg-de Vries equation. SIAM J. Numer. Anal. 1985, 22, 441–454. [Google Scholar] [CrossRef]
  22. Kovalyov, M. On the structure of the two-soliton interaction for the Korteweg-de Vries equation. J. Differ. Equ. 1999, 152, 431–438. [Google Scholar] [CrossRef] [Green Version]
  23. van Groesen, E. Andonowati, Variational derivation of KdV-type models for surface water waves. Phys. Lett. A 2007, 366, 195–201. [Google Scholar] [CrossRef]
  24. Shen, J. A new dual-Petrov-Galerkin method for third and higher odd-order differential equations: Application to the KDV equation. SIAM J. Numer. Anal. 2003, 41, 1595–1619. [Google Scholar] [CrossRef]
  25. Huang, W.; Sloan, D.M. The pseudo-spectral method for third-order differential equations. SIAM J. Numer. Anal. 1992, 29, 1626–1647. [Google Scholar] [CrossRef] [Green Version]
  26. Pavoni, D. Single and multidomain Chebyshev collocation methods for the Korteweg-de Vries equation. Calcolo 1988, 25, 311–346. [Google Scholar] [CrossRef]
  27. Li, J.; Ma, H.; Sun, W. Error analysis for solving the Korteweg-de Vries equation by a Legendre pseudo-spectral method. Numer. Methods Partial Differ. Equations Int. J. 2000, 16, 513–534. [Google Scholar] [CrossRef]
  28. Qin, Y.; Ma, H. Legendre-tau-Galerkin and spectral collocation method for nonlinear evolution equations. Appl. Numer. Math. 2020, 153, 52–65. [Google Scholar] [CrossRef]
  29. Laub, A.J. Matrix Analysis for Scientists and Engineers; SIAM: Davis, CA, USA, 2005; ISBN 978-0-898715-76-7. [Google Scholar]
  30. Ma, H.; Sun, W. Optimal error estimates of the Legendre-Petrov-Galerkin method for the Korteweg-de Vries equation. SIAM J. Numer. Anal. 2001, 39, 1380–1394. [Google Scholar] [CrossRef]
Figure 1. Time evolution of exact solutions and numerical solutions for Example 1. (a) Exact solutions u ( x , t ) = sin 2 ( π x ) sin ( 12 x + 12 t ) ; (b) numerical solutions u L ( x , t ) by scheme (7).
Figure 1. Time evolution of exact solutions and numerical solutions for Example 1. (a) Exact solutions u ( x , t ) = sin 2 ( π x ) sin ( 12 x + 12 t ) ; (b) numerical solutions u L ( x , t ) by scheme (7).
Axioms 12 00281 g001
Figure 2. Spectral errors in time and space, respectively, at t = 2 for Example 1. (a) Temporal errors versus M with N = 50 ; (b) spatial errors versus N with M = 40 .
Figure 2. Spectral errors in time and space, respectively, at t = 2 for Example 1. (a) Temporal errors versus M with N = 50 ; (b) spatial errors versus N with M = 40 .
Axioms 12 00281 g002
Figure 3. Spectral errors in time and space, respectively, at t = 6 for Example 2. Take a = 50 , b = 50 , κ = 0.3 , x 0 = 20 . (a) Temporal errors versus M with N = 5 ; (b) spatial errors versus N with M = 130 .
Figure 3. Spectral errors in time and space, respectively, at t = 6 for Example 2. Take a = 50 , b = 50 , κ = 0.3 , x 0 = 20 . (a) Temporal errors versus M with N = 5 ; (b) spatial errors versus N with M = 130 .
Axioms 12 00281 g003
Figure 4. Time evolution of the numerical solutions for Example 2 with different constant x 0 . Take a = 30 , b = 30 , κ = 0.3 . (a) x 0 = 20 ; (b) x 0 = 0 .
Figure 4. Time evolution of the numerical solutions for Example 2 with different constant x 0 . Take a = 30 , b = 30 , κ = 0.3 . (a) x 0 = 20 ; (b) x 0 = 0 .
Axioms 12 00281 g004
Table 1. Temporal errors at t = 1 for Example 1.
Table 1. Temporal errors at t = 1 for Example 1.
NScheme (7)Scheme (2.2) in [17]
M L 2 - Error τ L 2 - Error
6416 1.4063 × 10 6 10 1 3.9301 × 10 3
6418 4.0923 × 10 8 10 2 3.1014 × 10 5
6421  1.3429 × 10 10 10 3 3.0959 × 10 7
6423  2.3504 × 10 12 10 4 3.0959 × 10 9
6425  5.0067 × 10 14 10 5   3.0819 × 10 11
Table 2. Spatial errors at t = 1 for Example 1.
Table 2. Spatial errors at t = 1 for Example 1.
Scheme (7) with M = 30 Scheme (2.2) with τ = 10 5 in [17]
N L 2 - Error N L 2 - Error
32 8.9457 × 10 7 16 3.0866 × 10 1
39  5.0037 × 10 11 32 1.5288 × 10 7
44  6.1458 × 10 14 64  3.0819 × 10 11
Table 3. Spatial errors at t = 1 for Example 2. Take a = 40 , b = 40 , κ = 0.3 , x 0 = 0 .
Table 3. Spatial errors at t = 1 for Example 2. Take a = 40 , b = 40 , κ = 0.3 , x 0 = 0 .
Scheme (7) with M = 3Scheme (2.3) with τ = 1e-06 in [27]
N L 2 - Error N L 2 - Error
40 4.0000 × 10 3 10 1.4367 × 10 0
60 6.7240 × 10 4 20   6.9376 × 10 1
80 8.3138 × 10 5 40   9.2131 × 10 2
100 9.1547 × 10 6 80   1.3874 × 10 3
120 9.6709 × 10 7 160   2.0651 × 10 7
Table 4. Temporal errors at t = 1 for Example 2. Take a = 40 , b = 40 , κ = 0.3 , x 0 = 0 .
Table 4. Temporal errors at t = 1 for Example 2. Take a = 40 , b = 40 , κ = 0.3 , x 0 = 0 .
Scheme (7) with N = 140Scheme (2.3) with N = 160 in [27]
M L 2 - Error τ L 2 - Error
2 1.1230 × 10 5 10 3 8.3542 × 10 5
3 2.4398 × 10 7 10 4 8.3626 × 10 6
4 9.1633 × 10 8 10 5 8.6122 × 10 7
Table 5. Spectral errors at t = 1 for Example 3. Take a = 12 , b = 12 , κ = 1 , x 0 = 0 .
Table 5. Spectral errors at t = 1 for Example 3. Take a = 12 , b = 12 , κ = 1 , x 0 = 0 .
Temporal Errors with N = 54 Spatial Errors with M = 6
M L 2 - Error N L 2 - Error
1 1.8300 × 10 2 14      3.1500 × 10 2
2 2.7000 × 10 3 24      4.5000 × 10 3
3 4.9201 × 10 4 34      3.8479 × 10 4
4 9.4463 × 10 5 44      3.2627 × 10 5
5 9.4819 × 10 6 54      9.4819 × 10 6
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

Tang, S.; Li, H. A Space-Time Legendre-Petrov-Galerkin Method for Third-Order Differential Equations. Axioms 2023, 12, 281. https://doi.org/10.3390/axioms12030281

AMA Style

Tang S, Li H. A Space-Time Legendre-Petrov-Galerkin Method for Third-Order Differential Equations. Axioms. 2023; 12(3):281. https://doi.org/10.3390/axioms12030281

Chicago/Turabian Style

Tang, Siqin, and Hong Li. 2023. "A Space-Time Legendre-Petrov-Galerkin Method for Third-Order Differential Equations" Axioms 12, no. 3: 281. https://doi.org/10.3390/axioms12030281

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