Next Article in Journal
Ozone Generation Study for Indoor Air Purification from Volatile Organic Compounds Using a Cold Corona Discharge Plasma Model
Previous Article in Journal
A Privacy-Enhancing Mechanism for Federated Graph Neural Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Two High-Accuracy Linear Finite Difference Schemes for Rosenau–KdV–RLW Equation

1
College of Big Data and Artificial Intelligence, Chengdu Technological University, Chengdu 611730, China
2
Faculty of Science, Civil Aviation Flight University of China, Guanghan 618307, China
3
Key Laboratory of Nuclear Power Systems and Equipment, Shanghai Jiao Tong University, Shanghai 200030, China
*
Author to whom correspondence should be addressed.
Symmetry 2025, 17(4), 566; https://doi.org/10.3390/sym17040566
Submission received: 6 March 2025 / Revised: 3 April 2025 / Accepted: 6 April 2025 / Published: 8 April 2025

Abstract

:
Two numerical methods are investigated for the initial–boundary value problem of a nonlinear Rosenau–KdV–RLW equation with homogeneous boundary conditions. With the premise of achieving second-order theoretical accuracy in the temporal direction, two-level linearization discretization and three-level extrapolated linearization discretization are applied to nonlinear terms, respectively. To achieve a higher theoretical accuracy in the spatial direction, the Richardson extrapolation combination technique is employed; thereby, a two-level linearized difference scheme and a three-level linear difference scheme for the Rosenau–KdV–RLW equation are proposed, both with a theoretical accuracy of O ( τ 2 + h 4 ) . The two-level difference scheme also reasonably simulates the conservation property of the problem. The convergence and stability of the two schemes are proven using mathematical induction and discrete functional analysis methods. The numerical results demonstrate the effectiveness of both schemes.

1. Introduction

Nonlinear waves in nature are a vital research area of scientific inquiry, with many scholars dedicated to developing mathematical models to explain these phenomena. Korteweg and de Vries established a partial differential equation for shallow water waves that propagate unidirectionally when studying small-amplitude, long waves in shallow water, known as the Korteweg–de Vries (KdV) equation [1]
u t + u x + u u x u x x x = 0
which has plenty of applications in numerous fields of physics, such as magnetohydrodynamic waves in plasma and ion-sound waves. When investigating long-wave motions in shallow water, Peregrine [2] introduced the regularized long-wave (RLW) equation
u t + u x + u u x u x x t = 0
which can explain different scenarios involving nonlinear dispersive waves from another perspective and attracted more attention due to its ability to accurately simulate most applications of the KdV Equation (1). In further research, scholars discovered that the KdV equation cannot describe wave–wave and wave–wall interactions. To overcome this shortcoming, the Rosenau equation [3,4] was proposed
u t + u x x x x t + u x + u u x = 0
and many numerical methods have been discussed [5,6,7]. To explore more complex nonlinear wave phenomena, the Rosenau–KdV–RLW equation [8,9] can be derived by adding the viscous terms u x x t and u x x x to the Rosenau Equation (3):
u t u x x t + u x x x x t + u x + u x x x + u u x = 0 .
The Rosenau–KdV–RLW Equation (4) provides a more reasonable description of the dynamic characteristics of dispersive shallow water waves. Razborova et al. [10,11] gave the constraint conditions for the existence of soliton solutions to the Rosenau–KdV–RLW Equation (4) through the Ansatz method and obtained exact soliton solutions. Furthermore, the conservation laws for the Rosenau–KdV–RLW equation have been analyzed using the Lie symmetry analysis method [12].
Numerous studies have investigated numerical methods for the Rosenau–KdV–RLW Equation (4), including the finite element method [13], the B-spline differential quadrature method [14], the meshless radial basis function (RBF) collocation method [15], the Runge–Kutta method [16,17], and the finite difference method [18,19,20,21,22,23]. Among the finite difference approaches, the two-level nonlinear scheme [22] necessitates iterative nonlinear solvers, leading to high computational costs. In contrast, the three-level linear scheme [19] avoids nonlinear iterations but requires additional storage and lacks self-starting capabilities. To enhance the numerical accuracy, Ghiloufi [20] developed fourth-order spatially accurate schemes for the Rosenau–KdV–RLW equation using Richardson extrapolation. For two-dimensional cases, Labidi et al. [21] proposed a linearized conservative finite difference scheme that preserved the mass, admitted a unique solution, and was unconditionally stable.
In this paper, we consider the following initial and boundary value problem:
u t u x x t + u x x x x t + u x + u x x x + u u x = 0 , x ( x L , x R ) , t ( 0 , T ] ,
u ( x , 0 ) = u 0 ( x ) , x [ x L , x R ] ,
u ( x L , t ) = u ( x R , t ) = 0 , u x x ( x L , t ) = u x x ( x R , t ) = 0 , t [ 0 , T ]
where u 0 x is a known smooth function. Problem (5)–(7) has the conservative quantity [13,23]
Q ( t ) = x L x R u ( x , t ) d x = x L x R u 0 ( x ) d x = Q ( 0 )
in which Q ( 0 ) is a constant only related to the initial conditions.
The outline of this paper is as follows. In Section 2, we present a two-level linearized finite difference scheme which includes the following components: (i) a detailed Richardson extrapolation derived via Taylor expansion in Section 2.1, (ii) a difference scheme with a theoretical accuracy of O ( τ 2 + h 4 ) and an analysis of its conservation law in Section 2.2, and (iii) a theoretical analysis of the convergence and stability in Section 2.3. Subsequently, in Section 3.1, we construct a three-level linear difference scheme that achieves the same theoretical accuracy, along with a corresponding convergence and stability analysis. Finally, in Section 4, we conduct extensive numerical experiments, including waveform simulations of the numerical solutions, accuracy tests, and comparisons with existing results in the literature, to validate the proposed schemes.

2. The First Method: A Two-Level Linearized Finite Difference Scheme

2.1. Preliminaries

For the domain [ x L , x R ] × [ 0 , T ] , let h = ( x R x L ) / J be the step size of the spatial grid and τ be the step size of the temporal direction such that x j = x L + j h ( 0 j J ) , t n = n τ ( n = 0 , 1 , 2 , , N , N = [ T / τ ] ). Denote u j n = u ( x j , t n ) as the exact value of u ( x , t ) and U j n u ( x j , t n ) as the approximation of u ( x , t ) at point ( x j , t n ) , respectively. Define
( U j n ) x = U j + 1 n U j n h , ( U j n ) x ¯ = U j n U j 1 n h , ( U j n ) x ^ = U j + 1 n U j 1 n 2 h , ( U j n ) x ¨ = U j + 2 n U j 2 n 4 h , ( U j n ) t = U j n + 1 U j n τ , U j n + 1 2 = U j n + 1 + U j n 2 , U n , V n = h j = 1 J 1 U j n V j n , U n 2 = U n , U n , U n = max 1 j J 1 | U j n |
and
Z h 0 = { U = ( U j ) | U 2 = U 1 = U 0 = U J = U J + 1 = U J + 2 = 0 , j = 2 , 1 , 0 , , J , J + 1 , J + 2 } .
According to Taylor expansion, if u ( x , t ) is smooth enough, the following results hold:
( u j n ) t = ( u t ) j n + 1 2 + O ( τ 2 ) ,
( u j n + 1 2 ) x ^ = ( u x ) j n + 1 2 + 1 6 h 2 ( 3 u x 3 ) j n + 1 2 + O ( h 4 ) ,
( u j n + 1 2 ) x ¨ = ( u x ) j n + 1 2 + 2 3 h 2 ( 3 u x 3 ) j n + 1 2 + O ( h 4 ) .
Then, the combination of (10) and (11) yields
4 3 ( u j n + 1 2 ) x ^ 1 3 ( u j n + 1 2 ) x ¨ = ( u x ) j n + 1 2 + O ( h 4 ) .
Similarly, according to
( u j n + 1 2 ) x x ¯ = ( 2 u x 2 ) j n + 1 2 + 1 12 h 2 ( 4 u x 4 ) j n + 1 2 + O ( h 4 ) , ( u j n + 1 2 ) x ^ x ^ = ( 2 u x 2 ) j n + 1 2 + 1 3 h 2 ( 4 u x 4 ) j n + 1 2 + O ( h 4 ) , ( u j n + 1 2 ) x x ¯ x ^ = ( 3 u x 3 ) j n + 1 2 + 1 4 h 2 ( 5 u x 5 ) j n + 1 2 + O ( h 4 ) , ( u j n + 1 2 ) x x ¯ x ¨ = ( 3 u x 3 ) j n + 1 2 + 3 4 h 2 ( 5 u x 5 ) j n + 1 2 + O ( h 4 ) , ( u j n + 1 2 ) x x x ¯ x ¯ = ( 4 u x 4 ) j n + 1 2 + 1 6 h 2 ( 6 u x 6 ) j n + 1 2 + O ( h 4 ) , ( u j n + 1 2 ) x x ¯ x ^ x ^ = ( 4 u x 4 ) j n + 1 2 + 5 12 h 2 ( 6 u x 6 ) j n + 1 2 + O ( h 4 ) ,
we also have
4 3 ( u j n + 1 2 ) x x ¯ 1 3 ( u j n + 1 2 ) x ^ x ^ = ( 2 u x 2 ) j n + 1 2 + O ( h 4 ) ,
3 2 ( u j n + 1 2 ) x x ¯ x ^ 1 2 ( u j n + 1 2 ) x x ¯ x ¨ = ( 3 u x 3 ) j n + 1 2 + O ( h 4 ) ,
5 3 ( u j n + 1 2 ) x x x ¯ x ¯ 2 3 ( u j n + 1 2 ) x x ¯ x ^ x ^ = ( 4 u x 4 ) j n + 1 2 + O ( h 4 )
for τ , h 0 .
Lemma 1.
If u ( x , t ) is smooth enough, then
2 3 [ u j n ( u j n + 1 ) x ^ + u j n + 1 ( u j n ) x ^ ] 1 6 [ u j n ( u j n + 1 ) x ¨ + u j n + 1 ( u j n ) x ¨ ] = ( u u x ) j n + 1 2 + O ( τ 2 + h 4 )
holds for τ , h 0 .
Proof of Lemma 1.
Since
u j n = u j n + 1 2 τ 2 · ( u t ) j n + 1 2 + O ( τ 2 ) ,
u j n + 1 = u j n + 1 2 + τ 2 · ( u t ) j n + 1 2 + O ( τ 2 ) ,
4 3 ( u j n + 1 ) x ^ 1 3 ( u j n + 1 ) x ¨ = ( u x ) j n + 1 2 + τ 2 · ( 2 u x t ) j n + 1 2 + O ( τ 2 + h 4 ) ,
4 3 ( u j n ) x ^ 1 3 ( u j n ) x ¨ = ( u x ) j n + 1 2 τ 2 · ( 2 u x t ) j n + 1 2 + O ( τ 2 + h 4 )
from (17)–(20), we have
2 3 [ u j n ( u j n + 1 ) x ^ + u j n + 1 ( u j n ) x ^ ] 1 6 [ u j n ( u j n + 1 ) x ¨ + u j n + 1 ( u j n ) x ¨ ] = 1 2 { u j n [ 4 3 ( u j n + 1 ) x ^ 1 3 ( u j n + 1 ) x ¨ ] + u j n + 1 [ 4 3 ( u j n ) x ^ 1 3 ( u j n ) x ¨ ] } = 1 2 ( u j n + 1 2 A τ ) · [ ( u x ) j n + 1 2 + B τ ] + 1 2 ( u j n + 1 2 + A τ ) · [ ( u x ) j n + 1 2 B τ ] + O ( τ 2 + h 4 ) = u j n + 1 2 · ( u x ) j n + 1 2 A B τ 2 + O ( τ 2 + h 4 ) = ( u u x ) j n + 1 2 + O ( τ 2 + h 4 )
where A = 1 2 ( u t ) | j n + 1 2 , B = 1 2 ( 2 u x t ) | j n + 1 2 . This completes the proof. □

2.2. The Two-Level Numerical Scheme and the Conservative Law

Next, we propose a finite difference scheme for the problem (5)–(7) as follows:
( U j n ) t 4 3 ( U j n ) x x ¯ t + 1 3 ( U j n ) x ^ x ^ t + 5 3 ( U j n ) x x x ¯ x ¯ t 2 3 ( U j n ) x x ¯ x ^ x ^ t + 4 3 ( U j n + 1 2 ) x ^ 1 3 ( U j n + 1 2 ) x ¨ + 3 2 ( U j n + 1 2 ) x x ¯ x ^ 1 2 ( U j n + 1 2 ) x x ¯ x ¨ + φ 1 ( U j n , U j n + 1 ) φ 2 ( U j n , U j n + 1 ) = 0 , j = 1 , 2 , , J 1 , n = 1 , 2 , , N 1 ,
U j 0 = u 0 ( x j ) , j = 0 , 1 , 2 , , J 1 , J ,
U n Z h 0 , n = 0 , 1 , 2 , , N 1 , N ,
where
φ 1 ( U j n , U j n + 1 ) = 2 3 [ U j n ( U j n + 1 ) x ^ + U j n + 1 ( U j n ) x ^ ] , φ 2 ( U j n , U j n + 1 ) = 1 6 [ U j n ( U j n + 1 ) x ¨ + U j n + 1 ( U j n ) x ¨ ] .
The numerical simulation of the conservation law (8) based on the difference scheme (21)–(23) is given as follows.
Theorem 1.
Suppose u 0 H 2 ; then, the scheme (21)–(23) has the discrete conservative quantity
Q n = h j = 1 J 1 U j n = Q n 1 = = Q 0 , n = 1 , 2 , , N .
Proof of Theorem 1.
Through summation by parts [24], we obtain
h j = 1 J 1 φ 1 ( U j n , U j n + 1 ) = 2 h 3 j = 1 J 1 U j n ( U j n + 1 ) x ^ + 2 h 3 j = 1 J 1 U j n + 1 ( U j n ) x ^ = 2 h 3 j = 1 J 1 U j n ( U j n + 1 ) x ^ 2 h 3 j = 1 J 1 ( U j n + 1 ) x ^ U j n = 0 .
Similarly,
h j = 1 J 1 φ 2 ( U j n , U j n + 1 ) = 0 .
Accordingly, multiplying (21) with h and summing up for j from 1 to J 1 , we have
h j = 1 J 1 ( U j n ) t = 0 .
According to the definition of Q n , multiplying (25) by τ leads to (24). □

2.3. The Convergence and Stability of Scheme (21)–(23)

Lemma 2
([25]). For U Z h 0 , we have
U x ¨ 2 U x ^ 2 U x 2 .
Lemma 3
([24]). (The discrete Sobolev inequality) Suppose that U = { U j | j = 0 , 1 , 2 , , J } is a mesh function defined on [ x L , x R ] ; then,
U C 0 U U x + U
holds, where C 0 is a constant which is independent of U and the step size h.
Lemma 4
([24]). (The discrete Gronwall inequality) Suppose that { w n | n = 0 , 1 , 2 , , N ; N τ T } is a non-negative mesh function satisfying w n A + τ l = 1 n B l w l , where A and B l ( l = 0 , 1 , 2 , , N ) are non-negative constants; then,
max 1 n N | w n | A exp ( 2 τ l = 1 N B l )
for 0 n N , where τ is sufficiently small such that τ · ( max 1 n N B l ) 1 2 .
Lemma 5
([18]). Suppose that u 0 H 2 ; then, the solution to problem (5)–(7) has the following estimations:
u L 2 C , u x L 2 C , u x x L 2 C , u L C .
The truncation error of scheme (21)–(23) can be obtained as
r j n = ( u j n ) t 4 3 ( u j n ) x x ¯ t + 1 3 ( u j n ) x ^ x ^ t + 5 3 ( u j n ) x x x ¯ x ¯ t 2 3 ( u j n ) x x ¯ x ^ x ^ t + 4 3 ( u j n + 1 2 ) x ^ 1 3 ( u j n + 1 2 ) x ¨ + 3 2 ( u j n + 1 2 ) x x ¯ x ^ 1 2 ( u j n + 1 2 ) x x ¯ x ¨ + φ 1 ( u j n , u j n + 1 ) φ 2 ( u j n , u j n + 1 ) , j = 1 , 2 , · , J 1 ; n = 1 , 2 , , N 1 ,
u j 0 = u 0 ( x j ) , j = 0 , 1 , 2 , , J 1 , J ,
u n Z h 0 , n = 0 , 1 , 2 , , N 1 , N .
According to (9), (12)–(15), and Lemma 1, when τ , h 0 , the following fact holds:
| r j n | = O ( τ 2 + h 4 ) .
Theorem 2.
Suppose that u 0 H 2 ; then, the solution of scheme (21)–(23) converges to the solution to problem (5)–(7) of the order O ( τ 2 + h 4 ) according to the norm · , provided that both τ and h are sufficiently small.
Proof of Theorem 2.
Denote: e j n = u j n U j n . Subtracting (26)–(28) from (21)–(23), we have
r j n = ( e j n ) t 4 3 ( e j n ) x x ¯ t + 1 3 ( e j n ) x ^ x ^ t + 5 3 ( e j n ) x x x ¯ x ¯ t 2 3 ( e j n ) x x ¯ x ^ x ^ t + 4 3 ( e j n + 1 2 ) x ^ 1 3 ( e j n + 1 2 ) x ¨ + 3 2 ( e j n + 1 2 ) x x ¯ x ^ 1 2 ( e j n + 1 2 ) x x ¯ x ¨ + φ 1 ( u j n , u j n + 1 ) φ 1 ( U j n , U j n + 1 ) φ 2 ( u j n , u j n + 1 ) + φ 2 ( U j n , U j n + 1 ) j = 1 , 2 , , J 1 , n = 1 , 2 , , N 1 ,
e j 0 = 0 , j = 0 , 1 , 2 , , J 1 , J ,
e n Z h 0 , n = 1 , 2 , , N 1 , N .
From Lemma 5 and (29), two constants C u and C r exist which are independent of τ and h such that
u n C u , u x n C u , r n C r ( τ 2 + h 4 ) , n = 1 , 2 , , N 1 .
It follows from (31) and (32) that
e 0 = 0 , U 0 C u .
Assume that
e l + e x l + e x x l C l ( τ 2 + h 4 ) , l = 1 , 2 , , n , ( n N 1 ) ,
where C l ( l = 1 , 2 , , n ) is a constant which is also independent of τ and h. Then, from Lemma 3 and the Cauchy–Schwarz inequality, we obtain
| e l C 0 e l e x l + e l 1 2 C 0 ( 2 e l + e x l ) 3 2 C 0 C l ( τ 2 + h 4 ) , l = 1 , 2 , , n
and
U l u l + e l C u + 3 2 C 0 C l ( τ 2 + h 4 t ) , l = 1 , 2 , , n .
Taking the inner product of (30) and e n + 1 2 , from the boundary condition (32), through summation by parts [24], and with the following results,
e x ^ n + 1 2 , e n + 1 2 = 0 , e x ¨ n + 1 2 , e n + 1 2 = 0 , e x x ¯ x ^ n + 1 2 , e n + 1 2 = 0 , e x x ¯ x ¨ n + 1 2 , e n + 1 2 = 0 ,
we have
1 2 e n t 2 + 2 3 e x n t 2 1 6 e x ^ n t 2 + 5 6 e x x n t 2 1 3 e x x ^ n t 2 = r n , e n + 1 2 φ 1 ( u n , u n + 1 ) φ 1 ( U n , U n + 1 ) , e n + 1 2 + φ 2 ( u n , u n + 1 ) φ 2 ( U n , U n + 1 ) , e n + 1 2 .
According to Lemma 5 and the Mean Value Theorem, one can obtain
( u j n + 1 ) x ^ = u ( x j + 1 , t n + 1 ) u ( x j 1 , t n + 1 ) 2 h = x u ( x ξ j , t n + 1 ) , ( x j 1 ξ j x j + 1 ) , ( u j n + 1 ) x ¨ = u ( x j + 2 , t n + 1 ) u ( x j 2 , t n + 1 ) 4 h = x u ( x η j , t n + 1 ) , ( x j 2 η j x j + 2 ) ,
that is,
u x ^ n + 1 C u , u x ¨ n + 1 C u .
If τ and h are sufficiently small such that
3 2 C 0 · ( max 0 l n C l ) ( τ 2 + h 4 ) 1
from (37), (39) and (40), Lemma 2, and the Cauchy–Schwarz inequality, we obtain
φ 1 ( u n , u n + 1 ) φ 1 ( U n , U n + 1 ) , e n + 1 2 = 2 3 h j = 1 J 1 [ e j n ( u j n + 1 ) x ^ + U j n ( e j n + 1 ) x ^ ] e j n + 1 2 2 3 h j = 1 J 1 [ u j n + 1 ( e j n ) x ^ + e j n + 1 ( U j n ) x ^ ] e j n + 1 2 = 2 3 h j = 1 J 1 [ e j n ( u j n + 1 ) x ^ + U j n ( e j n + 1 ) x ^ ] e j n + 1 2 2 3 h j = 1 J 1 u j n + 1 ( e j n ) x ^ e j n + 1 2 + 2 3 h j = 1 J 1 U j n [ ( e j n + 1 ) x ^ e j n + 1 2 + e j n + 1 ( e j n + 1 2 ) x ^ ] 1 3 C u ( e n 2 + e x n 2 + 2 e n + 1 2 2 ) + 1 3 ( C u + 3 2 C 0 C n ( τ 2 + h 4 ) ) ( 2 e x n + 1 2 + 2 e n + 1 2 2 + e n + 1 2 + e x n + 1 2 2 ) 1 3 C u ( 2 e n 2 + e x n 2 + e n + 1 2 ) + 1 6 ( C u + 1 ) ( 5 e x n + 1 2 + e x n 2 + 4 e n + 1 2 + 2 e n 2 )
in which we use the following identity:
h j = 1 J 1 e j n + 1 ( U j n ) x ^ e j n + 1 2 = h j = 1 J 1 e j n + 1 e j n + 1 2 ( U j n ) x ^ = h j = 1 J 1 U j n ( e j n + 1 e j n + 1 2 ) x ^ = h j = 1 J 1 U j n e j + 1 n + 1 e j + 1 n + 1 2 e j 1 n + 1 e j 1 n + 1 2 2 h = h j = 1 J 1 U j n ( e j + 1 n + 1 e j + 1 n + 1 2 e j 1 n + 1 e j + 1 n + 1 2 ) + ( e j 1 n + 1 e j + 1 n + 1 2 e j 1 n + 1 e j 1 n + 1 2 ) 2 h = h j = 1 J 1 U j n [ ( e j n + 1 ) x ^ e j + 1 n + 1 2 + ( e j 1 n + 1 ) ( e j + 1 n + 1 2 ) x ^ ] .
Again,
φ 2 ( u n , u n + 1 ) φ 2 ( U n , U n + 1 ) , e n + 1 2 = 1 6 h j = 1 J 1 [ e j n ( u j n + 1 ) x ¨ + U j n ( e j n + 1 ) x ¨ ] e j n + 1 2 + 1 6 h j = 1 J 1 [ u j n + 1 ( e j n ) x ¨ + e j n + 1 ( U j n ) x ¨ ] e j n + 1 2 = 1 6 h j = 1 J 1 [ e j n ( u j n + 1 ) x ¨ + U j n ( e j n + 1 ) x ¨ ] e j n + 1 2 + 1 6 h j = 1 J 1 u j n + 1 ( e j n ) x ¨ e j n + 1 2 1 6 h j = 1 J 1 U j n [ ( e j n + 1 ) x ¨ e j n + 1 2 + e j n + 1 ( e j n + 1 2 ) x ¨ ] 1 12 C u ( e n 2 + e x n 2 + 2 e n + 1 2 2 ) + 1 12 ( C u + 3 2 C 0 C n ( τ 2 + h 4 ) ) ( 2 e x n + 1 2 + 2 e n + 1 2 2 + e n + 1 2 + e x n + 1 2 2 ) 1 12 C u ( 2 e n 2 + e x n 2 + e n + 1 2 ) + 1 24 ( C u + 1 ) ( 5 e x n + 1 2 + e x n 2 + 4 e n + 1 2 + 2 e n 2 )
in which
h j = 1 J 1 e j n + 1 ( U j n ) x ¨ e j n + 1 2 = h j = 1 J 1 U j n [ ( e j n + 1 ) x ¨ e j + 1 n + 1 2 + ( e j 1 n + 1 ) ( e j + 1 n + 1 2 ) x ¨ ]
is also used, and
r n , e n + 1 2 = 1 2 r n , e n + 1 + e n 1 2 r n 2 + 1 4 ( e n + 1 2 + e n 2 ) .
Substituting (41)–(45) into (38) yields
e n t 2 + 4 3 e x n t 2 1 3 e x ^ n t 2 + 5 3 e x x n t 2 2 3 e x x ^ n t 2 r n 2 + 1 2 ( e n + 1 2 + e n 2 ) + 5 6 C u ( 2 e n 2 + e x n 2 + e n + 1 2 ) + 5 12 ( C u + 1 ) ( 5 e x n + 1 2 + e x n 2 + 4 e n + 1 2 + 2 e n 2 ) r n 2 + 5 2 ( C u + 1 ) ( e n + 1 2 + e n 2 + e x n + 1 2 + e x n 2 ) .
Let
B n = e n 2 + 4 3 e x n 2 1 3 e x ^ n 2 + 5 3 e x x n 2 2 3 e x x ^ n 2 .
Multiplying (46) by τ and summing from 1 to n, we have
B n + 1 B 1 + τ k = 1 n r k 2 + 5 ( C u + 1 ) τ k = 1 n + 1 ( e k 2 + e x k 2 + e x x k 2 ) .
Accordingly, it follows from (33) and (35) that
τ k = 1 n r k 2 n τ max 1 k n r k 2 T ( C r ) 2 ( τ 2 + h 4 ) 2
and
B 1 C 1 2 ( τ 2 + h 4 ) 2 .
Choose a sufficiently small value of τ such that τ < 1 10 ( C u + 1 ) . Substituting (48) and (49) into (47), from Lemma 4, we obtain
e n + 1 2 + e x n + 1 2 + e x x n + 1 2 B n + 1 ( T ( C r ) 2 + C 1 2 ) ( τ 2 + h 4 ) 2 exp ( 10 T ( C u + 1 ) ) ( C n + 1 ) 2 ( τ 2 + h 4 ) 2 ,
where C n + 1 = ( T C r + C 1 ) exp ( 5 T ( C u + 1 ) ) is obviously a constant, which is independent of n. Through induction,
e n   O ( τ 2 + h 4 ) , e x n   O ( τ 2 + h 4 ) , e x x n O ( τ 2 + h 4 )
holds for n = 1 , 2 , , N 1 . Finally, according to Lemma 3, we have
e n O ( τ 2 + h 4 ) , n = 1 , 2 , , N 1 .
Theorem 3.
Suppose that u 0 H 2 ; then, the solution of scheme (21)–(23) satisfies the following:
U n C ˜ 0 , n = 1 , 2 , , N ,
provided that both τ and h are sufficiently small, where C ˜ 0 is a constant unrelated to both τ and h.
Proof of Theorem 3.
For sufficiently small values of τ and h, from Theorem 2, we obtain
U n u n + e n C ˜ 0 .
From Theorems 2 and 3, we can directly obtain the results.
Theorem 4.
The solution U n to scheme (21)–(23) is stable in the norm · .

3. The Second Method: The Three-Level Linear Finite Difference Scheme

3.1. The Numerical Scheme and the Truncation Error

Similar to the analysis in Section 2.1, we have
u j n 1 = u j n + 1 2 3 τ 2 · ( u t ) j n + 1 2 + O ( τ 2 ) ,
u j n = u j n + 1 2 τ 2 ( u t ) j n + 1 2 + O ( τ 2 )
which imply
3 2 u j n 1 2 u j n 1 = u j n + 1 2 + O ( τ 2 ) .
Therefore, we can construct the following three-level finite difference scheme for problem (5)–(7):
( U j n ) t 4 3 ( U j n ) x x ¯ t + 1 3 ( U j n ) x ^ x ^ t + 5 3 ( U j n ) x x x ¯ x ¯ t 2 3 ( U j n ) x x ¯ x ^ x ^ t + 4 3 ( U j n + 1 2 ) x ^ 1 3 ( U j n + 1 2 ) x ¨ + 3 2 ( U j n + 1 2 ) x x ¯ x ^ 1 2 ( U j n + 1 2 ) x x ¯ x ¨ + ψ 1 ( U j n 1 , U j n , U j n + 1 ) ψ 2 ( U j n 1 , U j n , U j n + 1 ) = 0 , j = 1 , 2 , , J 1 , n = 1 , 2 , , N 1 ,
U j 0 = u 0 ( x j ) , j = 0 , 1 , 2 , , J 1 , J ,
U n Z h 0 , n = 0 , 1 , 2 , , N 1 , N
where
ψ 1 ( U j n 1 , U j n , U j n + 1 ) = 4 3 U j n + 1 2 ( 3 2 U j n 1 2 U j n 1 ) x ^ , ψ 2 ( U j n 1 , U j n , U j n + 1 ) = 1 3 U j n + 1 2 ( 3 2 U j n 1 2 U j n 1 ) x ¨ .
Remark 1.
The difference scheme (53)–(55) is not self-starting, so the two-level difference scheme (21)–(23) can be used to compute the initial value U 1 .
The corresponding truncation error for scheme (53)–(55) is obtained as follows:
r j n = ( u j n ) t 4 3 ( u j n ) x x ¯ t + 1 3 ( u j n ) x ^ x ^ t + 5 3 ( u j n ) x x x ¯ x ¯ t 2 3 ( u j n ) x x ¯ x ^ x ^ t + 4 3 ( u j n + 1 2 ) x ^ 1 3 ( u j n + 1 2 ) x ¨ + 3 2 ( u j n + 1 2 ) x x ¯ x ^ 1 2 ( u j n + 1 2 ) x x ¯ x ¨ + ψ 1 ( u j n 1 , u j n , u j n + 1 ) ψ 2 ( u j n 1 , u j n , u j n + 1 ) , j = 1 , 2 , , J 1 , n = 1 , 2 , , N 1 ,
u j 0 = u 0 ( x j ) , j = 0 , 1 , 2 , , J 1 , J ,
u n Z h 0 , n = 0 , 1 , 2 , , N 1 , N .
Consequently, it follows from (12)–(14) and (52) that
| r j n | = O ( τ 2 + h 4 ) .
Remark 2.
Compared with the scheme (21)–(23), the scheme (53)–(55) has the same truncation error, and both numerical schemes are linear. From this perspective, the scheme (53)–(55) does not have any advantages. In fact, the advantage of scheme (53)–(55) is that it can be applied to generalized models; that is,
u t u x x t + u x x x x t + u x + u x x x + ( u p ) x = 0 .
Moreover, the generalized Rosenau–KdV–RLW equation (60) has also been studied in many works in the literature [23,26,27,28,29,30]. Therefore, a three-level linear scheme for the generalized case is one of our future works.

3.2. The Convergence and Stability of Scheme (53)–(55)

Next, we can obtain the following result, which is similar to Theorem 2. Here, we only present the convergence of this scheme and omit the details of the proof and the other results.
Theorem 5.
Suppose that u 0 H 2 ; then, the solution for scheme (53)–(55) converges to the solution of problem (5)–(7) of the order O ( τ 2 + h 4 ) according to the norm · provided that both τ and h are sufficiently small.
Proof of Theorem 5.
Subtracting (56)–(58) from (53)–(55) leads to
r j n = ( e j n ) t 4 3 ( e j n ) x x ¯ t + 1 3 ( e j n ) x ^ x ^ t + 5 3 ( e j n ) x x x ¯ x ¯ t 2 3 ( e j n ) x x ¯ x ^ x ^ t + 4 3 ( e j n + 1 2 ) x ^ 1 3 ( e j n + 1 2 ) x ¨ + 3 2 ( e j n + 1 2 ) x x ¯ x ^ 1 2 ( e j n + 1 2 ) x x ¯ x ¨ + ψ 1 ( u j n 1 , u j n , u j n + 1 ) ψ 1 ( U j n 1 , U j n , U j n + 1 ) ψ 2 ( u j n 1 , u j n , u j n + 1 ) + ψ 2 ( U j n 1 , U j n , U j n + 1 ) , j = 1 , 2 , , J 1 , n = 1 , 2 , , N 1 ,
e j 0 = 0 , j = 0 , 1 , 2 , , J 1 , J ,
e n Z h 0 , n = 0 , 1 , 2 , , N 1 , N .
From Lemma 5 and (59), two constants C u and C r exist such that
u n C u , u x n C u , r n C r ( τ 2 + h 4 ) , n = 1 , 2 , , N 1 .
According to (62) and (54), one can obtain
e 0   = 0 , U 0 C u .
For U 1 computed using scheme (21)–(23), we derive
e 1   +   e x 1   +   e x x 1   C 1 ( τ 2 + h 4 )
where C 1 is independent of τ and h.
Suppose that
e l   +   e x l   +   e x x l   C l ( τ 2 + h 4 ) , l = 2 , 3 , , n , ( n N 1 )
in which C l ( l = 2 , 3 , , n ) is a constant, which also is independent of τ and h. The application of Lemma 3 and the Cauchy–Schwarz inequality yields
e l C 0 e l e x l   +   e l 1 2 C 0 ( 2 e l   +   e x l ) 3 2 C 0 C l ( τ 2 + h 4 ) ,
U l   u l +   e l C u + 3 2 C 0 C l ( τ 2 + h 4 ) , l = 1 , 2 , , n .
Taking the inner product of (22) with e n + 1 2 and noticing that
e x ^ n + 1 2 , e n + 1 2 = 0 , e x ¨ n + 1 2 , e n + 1 2 = 0 , e x x ¯ x ^ n + 1 2 , e n + 1 2 = 0 , e x x ¯ x ¨ n + 1 2 , e n + 1 2 = 0 ,
according to condition (63) and summation by parts [24], we obtain
1 2 e n t 2 + 2 3 e x n t 2 1 6 e x ^ n t 2 + 5 6 e x x n t 2 1 3 e x x ^ n t 2 = r n , e n + 1 2 ψ 1 ( u j n 1 , u j n , u j n + 1 ) ψ 1 ( U j n 1 , U j n , U j n + 1 ) , e n + 1 2 + ψ 2 ( u j n 1 , u j n , u j n + 1 ) ψ 2 ( U j n 1 , U j n , U j n + 1 ) , e n + 1 2 .
Choose sufficiently small values for τ and h such that
3 2 C 0 · ( max 0 l n C l ) ( τ 2 + h 4 ) 1 .
Then, combining (69) and (71) and applying Lemma 5 and the Cauchy–Schwarz inequality leads to
ψ 1 ( u j n 1 , u j n , u j n + 1 ) ψ 1 ( U j n 1 , U j n , U j n + 1 ) , e n + 1 2 = 4 3 h j = 1 J 1 u j n + 1 2 ( 3 2 u j n 1 2 u j n 1 ) x ^ e j n + 1 2 + 4 3 h j = 1 J 1 U j n + 1 2 ( 3 2 U j n 1 2 U j n 1 ) x ^ e j n + 1 2 = 4 3 h j = 1 J 1 u j n + 1 2 ( 3 2 e j n 1 2 e j n 1 ) x ^ e j n + 1 2 4 3 h j = 1 J 1 e j n + 1 2 ( 3 2 U j n 1 2 U j n 1 ) x ^ e j n + 1 2 = 4 3 h j = 1 J 1 u j n + 1 2 ( 3 2 e j n 1 2 e j n 1 ) x ^ e j n + 1 2 + 4 3 h j = 1 J 1 ( 3 2 U j n 1 2 U j n 1 ) ( e j n + 1 2 ) x ^ ( e j + 1 n + 1 2 + e j 1 n + 1 2 ) 2 3 C u h j = 1 J 1 ( 3 | ( e j n ) x ^ | + | ( e j n 1 ) x ^ | ) · | e j n + 1 2 | + 2 3 h j = 1 J 1 ( 3 | U j n | + | U j n 1 | ) · | ( e j n + 1 2 ) x ^ | · ( | e j + 1 n + 1 2 | + | e j 1 n + 1 2 | ) C u ( e x ^ n 2 + e n + 1 2 2 ) + 1 3 C u ( e x ^ n 1 2 + e n + 1 2 2 ) + 8 3 [ C u + 3 2 C 0 · max ( C n 1 , C n ) ( τ 2 + h 4 ) ] · h j = 1 J 1 | ( e j n + 1 2 ) x ^ | · ( | e j + 1 n + 1 2 | + | e j 1 n + 1 2 | ) 1 3 C u ( 3 e x n 2 + e x n 1 2 + 2 e n + 1 2 + 2 e n 2 ) + 4 3 ( C u + 1 ) ( e x n + 1 2 + e x n 2 + e n + 1 2 + e n 2 )
in which a result similar to (42) is applied:
h j = 1 J 1 e j n + 1 2 ( 3 2 U j n 1 2 U j n 1 ) x ^ e j n + 1 2 = h j = 1 J 1 ( 3 2 U j n 1 2 U j n 1 ) ( e j n + 1 2 e j n + 1 2 ) x ^ = h j = 1 J 1 ( 3 2 U j n 1 2 U j n 1 ) e j + 1 n + 1 2 e j + 1 n + 1 2 e j 1 n + 1 2 e j 1 n + 1 2 2 h = h j = 1 J 1 ( 3 2 U j n 1 2 U j n 1 ) ( e j + 1 n + 1 2 e j + 1 n + 1 2 e j 1 n + 1 2 e j + 1 n + 1 2 ) + ( e j 1 n + 1 2 e j + 1 n + 1 2 e j 1 n + 1 2 e j 1 n + 1 2 ) 2 h = h j = 1 J 1 ( 3 2 U j n 1 2 U j n 1 ) ( e j n + 1 2 ) x ^ ( e j + 1 n + 1 2 + e j 1 n + 1 2 ) .
Additionally,
ψ 2 ( u j n 1 , u j n , u j n + 1 ) ψ 2 ( U j n 1 , U j n , U j n + 1 ) , e n + 1 2 = 1 3 h j = 1 J 1 u j n + 1 2 ( 3 2 u j n 1 2 u j n 1 ) x ¨ e j n + 1 2 1 3 h j = 1 J 1 U j n + 1 2 ( 3 2 U j n 1 2 U j n 1 ) x ¨ e j n + 1 2 = 1 3 h j = 1 J 1 u j n + 1 2 ( 3 2 e j n 1 2 e j n 1 ) x ¨ e j n + 1 2 + 1 3 h j = 1 J 1 e j n + 1 2 ( 3 2 U j n 1 2 U j n 1 ) x ¨ e j n + 1 2 = 1 3 h j = 1 J 1 u j n + 1 2 ( 3 2 e j n 1 2 e j n 1 ) x ¨ e j n + 1 2 1 3 h j = 1 J 1 ( 3 2 U j n 1 2 U j n 1 ) ( e j n + 1 2 ) x ¨ ( e j + 1 n + 1 2 + e j 1 n + 1 2 ) 1 6 C u h j = 1 J 1 ( 3 | ( e j n ) x ¨ | + | ( e j n 1 ) x ¨ t | ) · | e j n + 1 2 | + 1 6 h j = 1 J 1 ( 3 | U j n | + | U j n 1 | ) · | ( e j n + 1 2 ) x ¨ | · ( | e j + 1 n + 1 2 | + t | e j 1 n + 1 2 | ) 1 4 C u ( e x ¨ n 2 + e n + 1 2 2 ) + 1 12 C u ( e x ¨ n 1 2 + e n + 1 2 2 ) + 2 3 [ C u + 3 2 C 0 · max ( C n 1 , C n ) ( τ 2 + h 4 ) ] · h j = 1 J 1 | ( e j n + 1 2 ) x ¨ | · ( | e j + 1 n + 1 2 | + | e j 1 n + 1 2 | ) 1 12 C u ( 3 e x n 2 + e x n 1 2 + 2 e n + 1 2 + 2 e n 2 ) + 1 3 ( C u + 1 ) ( e x n + 1 2 + e x n 2 + e n + 1 2 + e n 2 )
and
r n , e n + 1 2 = 1 2 r n , e n + 1 + e n 1 2 r n 2 +   1 4 ( e n + 1 2 +   e n 2 ) .
Substituting (72)–(75) into (70), we obtain
e n t 2 +   4 3 e x n t 2   1 3 e x ^ n t 2 +   5 3 e x x n t 2   2 3 e x x ^ n t 2 r n 2 +   1 2 ( e n + 1 2 +   e n 2 ) +   5 12 C u ( 3 e x n 2 +   e x n 1 2 +   2 e n + 1 2 +   2 e n 2 ) + 5 3 ( C u + 1 ) ( e x n + 1 2 +   e x n 2 +   e n + 1 2 +   e n 2 ) r n 2 +   10 3 ( C u + 1 ) ( e n + 1 2 +   e n 2 +   e x n + 1 2 +   e x n 2 +   e x n 1 2 ) .
Let
B n =   e n 2 +   4 3 e x n 2   1 3 e x ^ n 2 +   5 3 e x x n 2   2 3 e x x ^ n 2 .
Multiplying (76) by τ and summing up from 1 to n, from Lemma 2, we have
e n + 1 2 +   e x n + 1 2 +   e x x n + 1 2 B n + 1 B 1 + τ k = 1 n r k 2 +   10 τ k = 0 n + 1 ( C u + 1 ) ( e k 2 +   e x k 2 +   e x x k 2 ) .
Therefore, it follows from (64) and (66) that
τ _ k = 1 n r k 2 n τ max 1 k n r k 2 T ( C r ) 2 ( τ 2 + h 4 ) 2 , B 1 = C 1 2 ( τ 2 + h 4 ) 2 .
If τ is small enough such that τ < 1 20 ( C u + 1 ) , from Lemma 4 and (77), we obtain
e n + 1 2 +   e x n + 1 2 +   e x x n + 1 2 ( T ( C r ) 2 + C 1 2 ) ( τ 2 + h 4 ) 2 exp ( 20 T ( C u + 1 ) ) ( C n + 1 ) 2 ( τ 2 + h 4 ) 2 , n = 1 , 2 , , N 1
where
C n + 1 = ( T C r + C 1 ) exp ( 10 T ( C u + 1 ) ) .
Through induction, it is obvious that the following results hold:
e n   O ( τ 2 + h 4 ) , e x n   O ( τ 2 + h 4 ) , e x x n O ( τ 2 + h 4 ) .
Finally, according to Lemma 3, we obtain e n O ( τ 2 + h 4 ) , n = 1 , 2 , , N 1 .

4. Numerical Experiments

The solitary-wave solution to the Rosenau–KdV–RLW Equation (4) is
u ( x , t ) = 35 ( 313 13 457 ) 12 ( 13 457 241 ) × sec h 4 [ 2 457 26 24 × ( x 72 13 457 241 t ) ]
and the corresponding initial function is
u 0 ( x ) = u ( x , 0 ) = 35 ( 313 13 457 ) 12 ( 13 457 241 ) × sec h 4 [ 2 457 26 24 × x ] .
Fix x L = 30 , x R = 120 and T = 40 . Define
o r d e r l 2 = log 2 ( e n ( h , τ ) / e 4 n ( h 2 , τ 4 ) ) , o r d e r l = log 2 ( e n ( h , τ ) / e 4 n ( h 2 , τ 4 ) ) .

4.1. The Numerical Results of Scheme (21)–(23)

For the two-level difference scheme (21)–(23), the changes in the numerical solution U j n at different times t when τ = 0.05 and h = 0.05 are exhibited in Figure 1. It can be seen from Figure 1 that the solitary wave has not changed in shape with time t.
For various values of τ and h, Table 1, Table 2 and Table 3 present the errors in the numerical solution, the results of the accuracy tests, and the discrete conserved quantities at different time levels, respectively. It is worth noting that Table 2 specifically focuses on verifying the order of spatial accuracy. Indeed, the definitions of the error norms o r d e r l 2 and o r d e r l demonstrate that confirming the fourth-order spatial accuracy inherently validates the second-order temporal accuracy as well.
Remark 3.
When we consider numerical verification of the theoretical accuracy for both schemes, the order is obtained through pairwise comparison. Since there are no comparable data in the first column, there are blank values in Table 2.

4.2. The Numerical Results of Scheme (53)–(55)

Similarly, to verify the effectiveness of the numerical scheme (53)–(55), we also plotted waveforms of the numerical solution based on (53)–(55) at different times t when τ = 0.05 and h = 0.05 , as in Figure 2.
The errors in the numerical solutions and the accuracy tests for the three-level difference scheme (53)–(55) at various times are shown in Table 4 and Table 5. Similar to Table 2, there are blank values in Table 5 because there are no comparable data in the first column.

4.3. Comparison of the Numerical Solutions

From Table 1 and Table 4, it can be seen that although both numerical schemes are linear, scheme (21)–(23) is more efficient in its computation than scheme (53)–(55) because the absolute error in the numerical solution based on scheme (21)–(23) is smaller. The reason for this is that the three-level scheme introduces more truncation errors when extrapolating. However, as stated in Remark 2, scheme (21)–(23) cannot be used for the more complex generalized Rosenau–KdV–RLW Equation (60).
In [20], Ghilouf et al. presented four different finite difference schemes with the same accuracy as the numerical scheme presented in this paper. Choose the two-level nonlinear scheme (Scheme A in [20]) and the three-level linearized compact scheme (Scheme D in [20]) and compare them with scheme (21)–(23) in this paper. Fix the time step τ = 0.002 and the final time T = 1 . The · norms for the corresponding absolute error when h = 0.1 , 0.05 , and 0.025 are listed in Table 6. From the results in Table 6, it can be seen that the two-level linearized scheme (21)–(23) in this paper is superior to the two-level nonlinear scheme (Scheme A in [20]) but slightly inferior to the three-level compact difference scheme (Scheme D in [20]) because Scheme D in [20] requires greater computational costs.

5. Conclusions

In this paper, the two difference schemes proposed for solving the initial–boundary value problem of the nonlinear Rosenau–KdV–RLW Equations (5)–(7) demonstrate satisfactory theoretical accuracy, as confirmed by various numerical experiments. The two-level scheme in particular accurately preserves conservative quantity (8). As linear schemes, both formulations offer computational advantages by eliminating the need for nonlinear iterations, thereby significantly reducing the computational costs. Moreover, the numerical methodology and the analytical techniques developed in this study, when combined with other novel analysis technology [31], can be extended to investigating more complex equations, including the generalized Rosenau–KdV–RLW equation and the Rosenau–Kawahara–RLW equation.

Author Contributions

Methodology, J.H. and K.Z.; software, Z.C.; validation, J.H.; formal analysis, Z.C.; draft preparation, J.H.; supervision, K.Z.; project administration, K.Z.; funding acquisition, J.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Talent Program of Chengdu Technological University (No. 2024RC021), the Fundamental Research Funds for the Central Universities of Civil Aviation Flight University of China (No. PHD2023-047), and the Opening Fund of Provincial Key Lab of Applied Nuclear Techniques in Geosciences (No. gnzds201902).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

We are grateful to the anonymous reviewers for their valuable suggestions and comments.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Korteweg, D.J.; de Vires, G. On the change of form of long waves advancing in a rectangular canal, and on a new type of long stationary waves. Philos. Mag. 1895, 39, 422–443. [Google Scholar] [CrossRef]
  2. Peregrine, D.H. Calculations of the development of an undular bore. J. Fluid Mech. 1966, 25, 321–330. [Google Scholar]
  3. Rosenau, P. A quasi-continuous description of a nonlinear transmission line. Phys. Scr. 1986, 34, 827–829. [Google Scholar]
  4. Rosenau, P. Dynamics of dense discrete systems: High order effects. Prog. Theor. Phys. 1988, 79, 1028–1042. [Google Scholar]
  5. Kim, Y.D.; Lee, H.Y. The convergence of finite element Galerkin solution for the Rosenau equation. Korean J. Comput. Appl. Math. 1998, 5, 171–180. [Google Scholar]
  6. Chung, S.K.; Pani, A.K. Numerical methods for the Rosenau equation. Appl. Anal. 2001, 77, 351–369. [Google Scholar]
  7. Hu, J.S.; Zheng, K.L. Two conservative difference schemes for the generalized Rosenau equation. Bound. Value Probl. 2010, 2010, 543503. [Google Scholar] [CrossRef]
  8. Özer, S. Numerical solution of the Rosenau-KdV-RLW equation by operator splitting techniques based on B-spline collocation method. Numer. Methods Partial Differ. Equ. 2019, 35, 1928–1943. [Google Scholar]
  9. Özer, S. Two efficient numerical methods for solving Rosenau-KdV-RLW equation. Kuwait J. Sci. 2021, 48, 14–24. [Google Scholar]
  10. Razborova, P.; Moraru, L.; Biswas, A. Perturbation of dispersive shallow water waves with Rosenau-KdV-RLW equation and power law nonlinearity. Rom. J. Phys. 2014, 59, 658–676. [Google Scholar]
  11. Razborova, P.; Ahmed, B.; Biswas, A. Solitons, shock waves and conservation laws of Rosenau-KdV-RLW equation with power law nonlinearity. Appl. Math. Inform. Sci. 2014, 8, 485–491. [Google Scholar]
  12. Razborova, P.; Kara, A.H.; Biswas, A. Additional conservation laws for Rosenau-KdV-RLW equation with power law nonlinearity by Lie symmetry. Nonlin. Dyn. 2015, 79, 743–748. [Google Scholar]
  13. Ak, T.; Karakoc, S.B.G.; Biswas, A. Numerical scheme to dispersive shallow water waves. J. Comput. Theor. Nanos. 2016, 13, 7084–7092. [Google Scholar]
  14. Kaur, A.; Kanwar, V.; Ramos, H. A conservative algorithm based on a hybrid block method and tension B-spline differential quadrature method for Rosenau–KdV–RLW equation. Math. Meth. Appl. Sci. 2024, 47, 8638–8650. [Google Scholar]
  15. Korkmaz, B.; Dereli, Y. Numerical solution of the Rosenau-KdV-RLW equation by using RBFs collocation method. Int. J. Mod. Phys. C 2016, 27, 1650117. [Google Scholar]
  16. Ahmat, M.; Qiu, J. Compact ETDRK scheme for nonlinear dispersive wave equations. Comput. Appl. Math. 2021, 40, 286. [Google Scholar]
  17. Shallu; Kukreja, V.K. An efficient collocation algorithm with SSP-RK43 scheme to solve Rosenau-KdV-RLW equation. Int. J. Appl. Comput. Math. 2021, 7, 161. [Google Scholar]
  18. Pan, X.T.; Wang, Y.J.; Zhang, L.M. Numerical analysis of a pseudo-compact C-N conservative scheme for the Rosenau-KdV equation coupling with the Rosenau-RLW equation. Bound. Value Probl. 2015, 2015, 65. [Google Scholar]
  19. Wongsaijai, B.; Poochinapan, K. A three-level average implicit finite difference scheme to solve equation obtained by coupling the Rosenau-KdV equation and the Rosenau-RLW equation. Appl. Math. Comput. 2014, 245, 289–304. [Google Scholar]
  20. Ghiloufi, A.; Omrani, K. New conservative difference schemes with fourth-order accuracy for some model equation for nonlinear dispersive waves. Numer. Methods Partial. Differ. Equ. 2018, 34, 451–500. [Google Scholar]
  21. Labidi, S.; Rahmeni, M.; Omrani, K. Numerical approach of dispersive shallow water waves with Rosenau-KdV-RLW equation in (2 + 1)-dimensions. Discret. Cont. Dyn.-S 2023, 16, 2157–2176. [Google Scholar] [CrossRef]
  22. Wang, X.F.; Dai, W.Z. A three-level linear implicit conservative scheme for the Rosenau-KdV-RLW equation. J. Comput. Appl. Math. 2018, 330, 295–306. [Google Scholar]
  23. Verma, A.K.; Rawani, M.K. Numerical solutions of generalized Rosenau-KDV-RLW equation by using Haar wavelet collocation approach coupled with nonstandard finite difference scheme and quasilinearization. Numer. Methods Partial Differ. Equ. 2023, 39, 1085–1107. [Google Scholar] [CrossRef]
  24. Zhou, Y.L. Application of Discrete Functional Analysis to the Finite Difference Method; International Academic Publishers: Beijing, China, 1990. [Google Scholar]
  25. Zheng, K.L.; Hu, J.S. High-order conservative Crank-Nicolson scheme for regularized long wave equation. Adv. Differ. Equ. 2013, 2013, 287. [Google Scholar]
  26. Shumoua, F.A.; Fatimah, A.A.; Hany, N.H. An efficient numerical technique for investigating the generalized Rosenau-KDV-RLW equation by using the Fourier spectral method. AIMS Math. 2024, 9, 8661–8688. [Google Scholar]
  27. Li, S.; Kravchenko, O.V.; Qu, K. On the L convergence of a novel fourth-order compact and conservative difference scheme for the generalized Rosenau-KdV-RLW equation. Numer. Algorithms 2023, 94, 789–816. [Google Scholar] [CrossRef]
  28. Aydin, A. A convergent two-level linear scheme for the generalized Rosenau-KdV-RLW equation. Turk. J. Math. 2019, 43, 2226–2245. [Google Scholar] [CrossRef]
  29. Cai, J.X.; Hong, Q.; Yang, B. Local structure-preserving methods for the generalized Rosenau-RLW-KdV equation with power law nonlinearity. Chin. Phys. B 2017, 26, 100202. [Google Scholar]
  30. Wang, X.F.; Dai, W.Z. A new conservative finite difference scheme for the generalized Rosenau-KdV-RLW equation. Comput. Appl. Math. 2020, 39, 237. [Google Scholar]
  31. Nas, M.; Yalçın, S.; Bayram, H. A class of analytic functions defined by a second order differential inequality and error function. Int. J. Appl. Comput. Math. 2024, 10, 42. [Google Scholar] [CrossRef]
Figure 1. Numerical solutions of u ( x , t ) according to scheme (21)–(23) with τ = 0.05 , h = 0.05 .
Figure 1. Numerical solutions of u ( x , t ) according to scheme (21)–(23) with τ = 0.05 , h = 0.05 .
Symmetry 17 00566 g001
Figure 2. Numerical solutions of u ( x , t ) according to scheme (53)–(55) with τ = 0.05 , h = 0.05 .
Figure 2. Numerical solutions of u ( x , t ) according to scheme (53)–(55) with τ = 0.05 , h = 0.05 .
Symmetry 17 00566 g002
Table 1. The error estimates of the numerical solutions for scheme (21)–(23).
Table 1. The error estimates of the numerical solutions for scheme (21)–(23).
e e
τ = 0.2 τ = 0.05 τ = 0.0125 τ = 0.2 τ = 0.05 τ = 0.0125
h = 0.1 h = 0.05 h = 0.025 h = 0.1 h = 0.05 h = 0.125
t = 102.63467 × 10−21.65735 × 10−39.94049 × 10−57.00687 × 10−24.40715 × 10−32.54754 × 10−4
t = 205.05143 × 10−23.17890 × 10−31.75745 × 10−41.35375 × 10−18.51817 × 10−34.51715 × 10−4
t = 307.45117 × 10−24.69031 × 10−32.37401 × 10−42.00088 × 10−11.25923 × 10−26.08385 × 10−4
t = 409.84930 × 10−26.20064 × 10−32.84942 × 10−42.64761 × 10−11.66644 × 10−27.27054 × 10−4
Table 2. Numerical verification of the theoretical accuracy for scheme (21)–(23).
Table 2. Numerical verification of the theoretical accuracy for scheme (21)–(23).
orderl 2 orderl
τ = 0.2 τ = 0.05 τ = 0.0125 τ = 0.2 τ = 0.05 τ = 0.0125
h = 0.1 h = 0.05 h = 0.025 h = 0.1 h = 0.05 h = 0.125
t = 103.990674.059423.990854.11267
t = 203.990094.176973.990274.23706
t = 303.989714.304293.990024.37191
t = 403.989534.443683.989854.51856
Table 3. Conservative quantity (24) for scheme (21)–(23).
Table 3. Conservative quantity (24) for scheme (21)–(23).
τ = 0.2 τ = 0.05 τ = 0.0125
h = 0.1 h = 0.05 h = 0.025
t = 021.6792583618121.6792583604021.67925835969
t = 1021.6792580322821.6792580374421.67931092312
t = 2021.6792509550321.6792584981521.67936576362
t = 3021.6790079177221.6792438293121.67941983441
t = 4021.6795219345021.6792760443421.67947672631
Table 4. The error estimates of the numerical solutions for scheme (53)–(55).
Table 4. The error estimates of the numerical solutions for scheme (53)–(55).
e e
τ = 0.2 τ = 0.05 τ = 0.0125 τ = 0.2 τ = 0.05 τ = 0.0125
h = 0.1 h = 0.05 h = 0.025 h = 0.1 h = 0.05 h = 0.125
t = 109.35198 × 10−25.35165 × 10−33.35914 × 10−42.49529 × 10−11.36134 × 10−28.49912 × 10−4
t = 202.20014 × 10−11.00773 × 10−26.24682 × 10−45.68603 × 10−12.66997 × 10−21.64330 × 10−3
t = 303.84552 × 10−11.52808 × 10−29.34444 × 10−49.87308 × 10−14.10605 × 10−22.49280 × 10−3
t = 405.86758 × 10−12.10901 × 10−21.26603 × 10−31.50784 × 1005.67519 × 10−23.40179 × 10−3
Table 5. Numerical verification of the theoretical accuracy for scheme (53)–(55).
Table 5. Numerical verification of the theoretical accuracy for scheme (53)–(55).
orderl 2 orderl
τ = 0.2 τ = 0.05 τ = 0.0125 τ = 0.2 τ = 0.05 τ = 0.0125
h = 0.1 h = 0.05 h = 0.025 h = 0.1 h = 0.05 h = 0.125
t = 104.127223.993824.196114.00157
t = 204.448414.011844.412534.02216
t = 304.653394.031474.587524.04191
t = 404.798134.058184.731674.06030
Table 6. Comparison of errors for Scheme (21)–(23), Scheme A, and Scheme D in [20] when τ = 0.002 .
Table 6. Comparison of errors for Scheme (21)–(23), Scheme A, and Scheme D in [20] when τ = 0.002 .
h = 0.1 h = 0.05 h = 0.025
Scheme (21)–(23)9.710410 × 10−46.111019 × 10−53.814381 × 10−6
Scheme A in [20]2.794741 × 10−31.817251 × 10−41.137030 × 10−5
Scheme D in [20]8.370764 × 10−45.160025 × 10−53.174356 × 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

Hu, J.; Zheng, K.; Chen, Z. Two High-Accuracy Linear Finite Difference Schemes for Rosenau–KdV–RLW Equation. Symmetry 2025, 17, 566. https://doi.org/10.3390/sym17040566

AMA Style

Hu J, Zheng K, Chen Z. Two High-Accuracy Linear Finite Difference Schemes for Rosenau–KdV–RLW Equation. Symmetry. 2025; 17(4):566. https://doi.org/10.3390/sym17040566

Chicago/Turabian Style

Hu, Jinsong, Kelong Zheng, and Zhong Chen. 2025. "Two High-Accuracy Linear Finite Difference Schemes for Rosenau–KdV–RLW Equation" Symmetry 17, no. 4: 566. https://doi.org/10.3390/sym17040566

APA Style

Hu, J., Zheng, K., & Chen, Z. (2025). Two High-Accuracy Linear Finite Difference Schemes for Rosenau–KdV–RLW Equation. Symmetry, 17(4), 566. https://doi.org/10.3390/sym17040566

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