Next Article in Journal
Cavitation Bubble Cloud Break-Off Mechanisms at Micro-Channels
Next Article in Special Issue
Computational Fluid Dynamics Study of the Hydrodynamic Characteristics of a Torpedo-Shaped Underwater Glider
Previous Article in Journal
On the Choice of Interface Parameters in Robin–Robin Loosely Coupled Schemes for Fluid–Structure Interaction
Previous Article in Special Issue
On Solving the Nonlinear Falkner–Skan Boundary-Value Problem: A Review
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Classical and Multisymplectic Schemes for Linearized KdV Equation: Numerical Results and Dispersion Analysis

by
Adebayo Abiodun Aderogba
1 and
Appanah Rao Appadu
2,*
1
Department of Mathematics, Obafemi Awolowo University, Ile-Ife 220282, Nigeria
2
Department of Mathematics and Applied Mathematics, Nelson Mandela University, Gqeberha 6031, South Africa
*
Author to whom correspondence should be addressed.
Fluids 2021, 6(6), 214; https://doi.org/10.3390/fluids6060214
Submission received: 28 April 2021 / Revised: 30 May 2021 / Accepted: 4 June 2021 / Published: 8 June 2021

Abstract

:
We construct three finite difference methods to solve a linearized Korteweg–de-Vries (KdV) equation with advective and dispersive terms and specified initial and boundary conditions. Two numerical experiments are considered; case 1 is when the coefficient of advection is greater than the coefficient of dispersion, while case 2 is when the coefficient of dispersion is greater than the coefficient of advection. The three finite difference methods constructed include classical, multisymplectic and a modified explicit scheme. We obtain the stability region and study the consistency and dispersion properties of the various finite difference methods for the two cases. This is one of the rare papers that analyse dispersive properties of methods for dispersive partial differential equations. The performance of the schemes are gauged over short and long propagation times. Absolute and relative errors are computed at a given time at the spatial nodes used.

1. Introduction

In this paper, we solve a linearised Korteweg-de-Vries equation with specified initial and boundary conditions. The three methods include classical, multisymplectic and a modified explicit scheme adapted from Wang et al. [1]. In 1895 [2], two Dutchmen, namely Korteweg and de Vries, derived a nonlinear partial differential equation of the form
u t + u u x + δ 2 u x x x = 0 ,
which describes the long time asymptotic behaviour of a small but finite amplitude of one-dimensional shallow water waves. In the equation above, u = u ( x , t ) measures the elevation (height of water above equilibrium level) at time t and position x while δ 2 is referred to as the dispersion coefficient. There are two different mechanisms that are present, namely;
  • Nonlinearity ( u u x ) , which tends to steepen those parts having negative slope.
  • Dispersion, which makes dispersive wave components of different wave frequencies propagate at different velocities.
The delicate balance between these two effects leads to travelling waves of permanent form, the so-called solitary wave. It is usual to refer to the solitary wave as the single soliton solution, but when more than one of them appears in a solution, they are then termed as solitons. If one of these two competing effects is lost, solitons become unstable and eventually cease to exist. In this respect, solitons are completely different from linear waves.
The KdV equation has also been found to describe a number of important physical phenomena such as magnetohydrodynamic waves in a warm plasma [3], elastic waves in an anharmonic crystal [4], ion-acoustic waves in a plasma [5], the long-lived giant red spot in the highly turbulent Jovian atmosphere and the propagation of short laser pulses in optical fibres [6].
The existence of unique solutions for some classes of initial data has been established in Lax [7]. There exist many integral invariants of the KdV equation, three of these serve as benchmarks to test the efficiency of numerical solvers. If u ( x , t ) is the solution of the KdV equation given by Equation (1) above, the three invariants are
F 1 = 0 L u d x ,
F 2 = 1 2 0 L u 2 d x ,
F 3 = 0 L 1 2 δ 2 ( u x ) 2 1 6 u 3 d x ,
which represent mass, momentum and energy conservation, respectively.
Li and vu-Quoc [8] stated that in some areas, the ability to preserve the invariant properties of the original differential equations is a criterion to judge the success of a numerical simulation. The discrete forms of the three conservation laws are
F 1 h ( v ¯ ) = i = 1 n v i Δ x ,
F 2 h ( v ¯ ) = 1 2 i = 1 n v i + v i 1 2 2 Δ x ,
F 3 h ( v ¯ ) = i = 1 n 1 2 δ 2 | Δ + v i | 2 1 6 ( v i ) 3 Δ x .
There are several good reasons to work with KdV equation as a prototype. The reasons are detailed below:
  • It is a model of a nonlinear hyperbolic equation with smooth solutions for all times.
  • It is non-dissipative and therefore is a natural testbed for comparing conservative vs. dissipative discretization.
  • It is notorious. It is well known that unexpected, nonlinear instabilities occasionally arise from reasonable-looking finite difference method. For instance, Zhao and Qin [9] solved u t + η u u x + δ 2 u x x x = 0 with u ( t = 0 , x ) = u 0 ( x ) = cos ( π x ) for x [ 0 , 2 ] , η = 1 , δ = 0.022 using periodic boundary conditions and employing the Zabusky–Kruskal scheme. They tried various Δ x , Δ t combinations satisfying the linear stability bound, yet they always obtained blow-up phenomena for t > 21 π . Setting Δ x = 0.01 , Δ t = 0.0001 , the solution, using an explicit scheme, is qualitatively correct for a while. Around t = 5 , i.e., after 50,000 time steps, error accumulates in the solution so that the linear stability bound is violated. After a few more steps, the solution blows up.
The design and development of symplectic methods for Hamiltonian ODEs has yielded very powerful numerical schemes with beautiful geometric properties. Symplectic and other symmetric methods have been noted for their superior performance, especially for long time integration [10,11,12]. The Korteweg–de-Vries equation has been extensively studied in numerous studies using symplectic and multisymplectic methods [13]. Because of nonlinear instability, all those methods that can remove the phenomenon of unphysical oscillations are entirely implicit or semi-explicit except for the 6-point scheme that was proposed very recently in [14] based on the concept of multisymplectic schemes. However, due to stability constraint on the time step, the 6-point scheme is somewhat slow. Wang et al. [1] attempted to construct a scheme that not only removes oscillation phenomenon for long time propagation but is also faster than the 6-point scheme.
Very recently, the authors in [15] used two existing schemes proposed by Zabusky and Kruskal [4] and Wang et al. [1] to solve u t + 6 u u x + β u x x x = 0 with initial conditions u ( x , t = 0 ) = 2 μ 2 sech 2 ( μ x ) with μ > 0 [16]. Appadu et al. [15] also constructed two novel methods obtained by modifying the scheme proposed by Zabusky and Kruskal. The performance of the four methods is compared in regard to dispersion and dissipation errors and ability to conserve mass, momentum and energy by using two numerical experiments that involve solitons. It is worthy to note that sine-cosine and canonical transformation methods proposed and employed in [17,18] have proven useful in obtaining exact soliton solutions and solutions of the Navier–Stokes equation, respectively. We next discuss dispersive characteristics of numerical methods.
The term with the lowest even order spatial derivative in the truncation error produces amplitude error in the numerical solution, and this is responsible for numerical dissipation. The leading odd spatial derivative in the truncation error produces small-scale waves as different Fourier components propagate at different phase speeds, and this causes numerical dispersion [19]. The relative phase error (RPE) is a measure of the dispersive character of a scheme. This quantity is a ratio and measures the velocity of the computed waves to that of the physical waves [20,21]. The relative phase error is obtained using the relation [22]
R P E = a r g ( ξ n u m ) a r g ( ξ e x a c t )
where ξ n u m is the amplification factor of the numerical scheme and ξ e x a c t is the exact amplification factor. The relative phase error of numerical schemes discretizing 1D linear advection equation ( u t + β u x = 0 ) and 1D advection-diffusion equation ( u t + β u x = α u x x ) is calculated as [21,23,24,25]
R P E = 1 c w arctan I m ( ξ n u m ) R e ( ξ n u m ) .
Plots of relative phase error vs. w at some values of Δ x , Δ t for a few schemes discretizing 1D linear advection and 1D advection-diffusion equation were obtained in [21] and [24], respectively. Plots of RPE vs. w x vs. w y were obtained in [23,25] for numerical schemes discretizing 2D advection-diffusion and 3D advection-diffusion equations. Ascher and McLachlan [26] obtained the dispersion relation of the partial differential equation
u t = 2 ϵ u u x + ρ u x + ν u x x x
On considering the linearized version of the PDE
u t = ρ u x + ν u x x x .
Appadu et al. [15] considered the linearized form u t + β u x x x = 0 of the PDE u t + γ u u x + β u x x x = 0 to study dispersion analysis of the KdV equation. Some work on computing the optimal temporal step size by minimizing the integrated error at a given Δ x was done by Appadu et al. [27]. The integrated error was obtained as the square of dispersion error.
The paper is organized as follows. The two numerical experiments considered are described in Section 2. Section 3 is devoted to Scheme 1 applied to numerical experiment 1 and details the following: derivation, stability, consistency, presentation of numerical results and dispersion analysis. Section 4 and Section 5 give information on work done on Schemes 2 and 3 when used to solve numerical experiment 1. Section 6, Section 7 and Section 8 concerns the derivation, stability, consistency, presentation of numerical results and dispersion analysis of Schemes 1, 2, 3 when solving numerical experiment 2. We highlight salient features of the paper in Section 9.

2. Numerical Experiment

This paper is dedicated to the analysis of three numerical methods for the approximation of two different forms of linear KdV equations.

2.1. Case 1 (Numerical Experiment 1)

We consider the linear dispersive KdV equation [28]
u t + 2 u x + u x x x = 0
with x [ 0 , 2 π ] and t [ 0 , 4.0 ] .
The initial condition is u ( x , 0 ) = sin ( x ) , boundary conditions are
u ( 0 , t ) = sin ( t )
and
u ( 2 π , t ) = sin ( 2 π t ) .
The exact solution is u ( x , t ) = sin ( x t ) . This problem was solved using the Adomian decomposition method [28], Laplace–Adomian decomposition method [29], Homotopy perturbation method [29], Bernstein–Laplace–Adomian method [29] and Reduced Differential Transform method [29].

2.2. Case 2 (Numerical Experiment 2)

We considered a new case when the coefficient of dispersion was greater than that of advection. We solve
u t + 2 u x + 5 u x x x = 0
with x [ 0 , 2 π ] and t [ 0 , 4 ] . The initial condition is u ( x , 0 ) = sin ( x ) , and the boundary conditions are
u ( 0 , t ) = sin ( 3 t )
and
u ( 2 π , t ) = sin ( 2 π + 3 t ) .
The exact solution is u ( x , t ) = sin ( x + 3 t ) .

3. Scheme 1 for Numerical Experiment 1

A classical finite difference scheme given by
v i n + 1 = v i n 1 k 3 h ( v i 1 n + v i n + v i + 1 n ) ( v i + 1 n v i 1 n ) η 2 k h 3 ( v i + 2 n 2 v i + 1 n + 2 v i 1 n v i 2 n )
was proposed in [4] for the solution of the nonlinear equation u t + u u x + δ 2 u x x x = 0 . The scheme is adapted to solve u t + 2 u x + u x x x = 0 as given in Equation (12). Therefore, Scheme 1 is given by
v i n + 1 = v i n 1 2 k h ( v i + 1 n v i 1 n ) k h 3 ( v i + 2 n 2 v i + 1 n + 2 v i 1 n v i 2 n ) ,
for i = 2 , 3 , 4 , , N P 2 and n = 2 , 3 , , i t m a x 1 .

3.1. Stability of Scheme 1 for Numerical Experiment 1

In this section, the stability region of Scheme 1 is obtained. We substitute v i n by ξ n e I θ i h in Equation (18). This gives
ξ = ξ 1 2 k h ( e I θ h e I θ h ) k h 3 ( e 2 I θ h 2 e I θ h + 2 e I θ h e 2 I θ h ) .
After some rearrangements, we get
ξ 2 + A I ξ 1 = 0 ,
where
A = 4 sin ( w ) k h + k h 3 ( cos ( w ) 1 ) .
Therefore,
ξ = 1 2 ( I A ± A 2 + 4 ) .
We denote the amplification factor of the physical and the computational modes by ξ 1 and ξ 2 , respectively.
ξ 1 = 1 2 ( I A + 4 A 2 ) ,
and
ξ 2 = I A 4 A 2 .
If we seek amplification factor ξ that is not purely imaginary, we require 4 A 2 0 , which implies that | A | 2 . This implies that we need k such that
| 4 k h sin w + 2 k h 3 ( sin 2 w 2 sin w ) | 2 .
Note that the inequality is dominated by 2 k h 3 ( sin ( 2 w ) 2 sin ( w ) ) as h 0 . The maximum is when cos ( w ) = 1 2 . We obtain the stability region as
k 1 | 3 1 h 3 2 1 h 3 | .
If we choose h = π / 10 , (22) gives k 0.012775 . We can also obtain the stability region by use of 2D plots, as shown in Figure 1 and Figure 2. The stability region when h = π / 10 is 0 < k 0.012 , as illustrated in Figure 1b and Figure 2b.
The procedure used in this section is the von Neumann approach. This procedure will be employed to determine the expression for the amplification factor of the schemes in the later sections. The region is obtained by imposing | ξ 1 | .

3.2. Consistency of Scheme 1 for Numerical Experiment 1

The scheme in Equation (18) is given by
v i n + 1 = v i n 1 2 k h ( v i + 1 n v i 1 n ) k h 3 ( v i + 2 n 2 v i + 1 n + 2 v i 1 n v i 2 n ) .
We use the Taylor series about the point ( n , i ) in order to determine the order of accuracy of the scheme. By the Taylor’s expansion,
v i n + 1 = v + k v t + k 2 2 v t t + k 3 6 v t t t + k 4 24 v t t t t +
v i n 1 = v k v t + k 2 2 v t t k 3 6 v t t t + k 4 24 v t t t t +
so that
v i n + 1 v i n 1 = 2 k v t + 2 k 3 6 v t t t +
Furthermore
v i + 1 n = v + h v x + h 2 2 v x x + h 3 6 v x x x + h 4 24 v x x x x +
and
v i 1 n = v h v x + h 2 2 v x x h 3 6 v x x x + h 4 24 v x x x x +
so that
v i + 1 n v i 1 n = 2 h v x + 2 h 3 6 v x x x +
In addition
v i + 2 n = v + 2 h v x + ( 2 h ) 2 2 v x x + ( 2 h ) 3 6 v x x x + ( 2 h ) 4 24 v x x x x +
and
v i 2 n = v 2 h v x + ( 2 h ) 2 2 v x x ( 2 h ) 3 6 v x x x + ( 2 h ) 4 24 v x x x x +
so that
v i + 2 n v i 2 n = 4 h v x + 2 ( 2 h ) 3 6 v x x x +
We obtain
v t + 2 v x + v x x x = k 2 6 v t t t 1 3 h 2 v x x x +
The accuracy of the scheme is quadratic both in space and in time.
The detailed consistency analysis is discussed above. The same procedure will be followed throughout the entire paper. We may not discuss it in detail for other methods.

3.3. Numerical Results

In this section, the approximation of the linear dispersive Equation (12) using Scheme 1 given in Equation (18) is presented. Within the stability region, the spatial and the temporal step sizes employed are h = π / 10 and k = 0.001 , respectively. The solution profiles are shown in Figure 3. These are compared with the exact solution u ( x , t ) = sin ( x t ) . The profile of absolute errors vs. x is also presented at T = 2.0 and T = 4.0 . Figure 4 displays the absolute error profiles for the scheme. Table 1 displays L 1 and L errors at some values of k when h = π / 10 .

3.4. Dispersion Analysis

A perturbation for u ( x , t ) is
e α t + I θ x ,
where α is the dispersion relation. We consider u t + 2 u x + u x x x = 0 . Then,
u t = α u ( x , t ) , u x = I θ u ( x , t ) , u x x x = I θ 3 u ( x , t ) . Substituting these values in Equation (12), we obtain
α + 2 I θ I θ 3 = 0 ,
leading to
α = I θ ( θ 2 2 ) .
This implies that the perturbation for u ( x , t ) can be written as a function of θ alone as e I θ [ ( θ 2 2 ) t + x ] . The amplification factor is determined from the relation
ξ e x a c t = u ( x , t n + 1 ) u ( x , t n ) = e I θ ( θ 2 2 ) k .
Relative phase error (RPE) is defined [27] as
R P E = a r g ( ξ n u m e r i c a l ) a r g ( ξ e x a c t ) .
We obtain plots of the arguments of ξ e x a c t , ξ 1 , ξ 2 vs. w [ 0 , π ] in Figure 5. For values of w [ 0 , 1 ] , the graphs of the arguments of both ξ e x a c t and ξ 1 are very close to each other, as illustrated in Figure 5a. For values of w [ 0 , 0.5 ] , the graphs for the arguments of ξ e x a c t and ξ 2 are very close to each other, as depicted in Figure 5b, and we note that a r g ( ξ 2 ) and a r g ( ξ e x a c t ) are of opposite signs for 0.5 < w < π .

4. Scheme 2 for Numerical Experiment 1

In 2007, Wang et al. [14] constructed the following scheme to solve
u t + η u u x + δ 2 u x x x = 0 :
v i n + 1 v i n + v i + 1 n v i + 1 n 1 2 k + η 2 h ( v i + 1 n + v i n ) ( v i + 1 n v i n ) + μ 2 h 3 ( v i + 2 n 3 v i + 1 n + 3 v i n v i 1 n ) = 0 .
where η is the coefficient of the nonlinear term u u x . The scheme is multisymplectic and can remove the dispersive oscillations and preserves approximately several conservation laws of the KdV equation [14].
To discretize u t + 2 u x + u x x x = 0 , we propose
1 2 k ( v i n + 1 v i n + v i + 1 n v i + 1 n 1 ) + 2 h ( v i + 1 n v i n ) + 1 h 3 ( v i + 2 n 3 v i + 1 n + 3 v i n v i 1 n ) = 0 .
This gives
v i n + 1 v i n + v i + 1 n v i + 1 n 1 = 4 k h ( v i + 1 n v i n ) 2 k h 3 ( v i + 2 n 3 v i + 1 n + 3 v i n v i 1 n ) ,
which can be rewritten as
v i n + 1 = v i n v i + 1 n + v i + 1 n 1 4 k h ( v i + 1 n v i n ) 2 k h 3 ( v i + 2 n 3 v i + 1 n + 3 v i n v i 1 n ) ,
for i = 2 , 3 , , N P 2 and n = 2 , 3 , , i t m a x 1 .

4.1. Stability of Scheme 2 for Numerical Experiment 1

Substituting v i n by ξ n e I θ i h and simplifying gives
ξ = 1 e I w + ξ 1 e I w 4 k h ( e I w 1 ) 2 k h 3 ( e 2 I w 3 e I w + 3 e I w ) .
After some rearrangements, we get where
A = ( 1 cos ( w ) I sin ( w ) ) + 4 k h ( cos ( w ) 1 + I sin ( w ) )
+ 2 k h 3 ( cos ( 2 w ) + I sin ( 2 w ) 3 ( cos ( w ) + I sin ( w ) ) + 3 ( cos ( w ) I sin ( w ) ) )
B = ( cos ( w ) + I sin ( w ) )
and therefore, we get
ξ 1 , 2 = 1 2 ( A ± A 2 4 B ) ,
with ξ 1 = 1 2 ( A + A 2 4 B ) and ξ 2 = 1 2 ( A A 2 4 B ) . The range of values of the temporal step size k for which | ξ | 1 is shown in the profiles of the amplification factor ξ (see Figure 6 and Figure 7) given that w = θ h [ π , π ] and h = π 10 . It is observed that 0 < k < 0.01 .

4.2. Consistency of Scheme 2 for Numerical Experiment 1

We recall that the scheme is given by
v i n + 1 = v i n v i + 1 n + v i + 1 n 1 4 k h ( v i + 1 n v i n ) 2 k h 3 ( v i + 2 n 3 v i + 1 n + 3 v i n v i 1 n ) .
Taylor series expansion about ( n , i ) after simplification gives
2 k v t + 1 3 k 3 v t t t + k h v t x 1 2 k 2 h v t t x + 1 2 k h 2 v t x x + 4 k v x + 2 k h v x x + 2 3 k h 2 v x x x + 2 k v x x x + = 0 .
We obtain
v t + 2 v x + v x x x = 1 6 k 2 v t t t h 2 v t x + k h 4 v t t x h 2 4 v t x x h v x x +
Since v t x + 2 v x x + v x x x x 0 , hence
v t + 2 v x + v x x x = 1 6 k 2 v t t t + k h 4 v t t x h 2 4 v t x x 1 3 h 2 v x x x + .
The last equation shows that the scheme is second order accurate both spatially and temporally.

4.3. Numerical Results

In this section, the approximation of the linear dispersive Equation (12) by Scheme 2 given in (25) is presented. Within the stability region, the spatial and the temporal step size employed are h = π / 10 and k = 0.0001 , respectively. The solution profiles are shown in Figure 8. These are compared with exact solution u ( x , t ) = sin ( x t ) . The profile of absolute errors vs. x is also presented at T = 2.0 and T = 4.0 . Figure 9 displays the absolute error profiles for the multisymplectic scheme. We display L 1 and L errors in Table 2.

4.4. Dispersion Analysis

Arguments of numerical amplification factors ξ 1 , 2 derived in Section 4.1 are compared with the exact amplification factor within the stability region. The comparison is shown in Figure 10. We obtain plots of the arguments of ξ e x a c t , ξ 1 , ξ 2 vs. w [ 0 , π ] in Figure 10. For values of w [ 0 , 1 ] , the graphs for the arguments of both ξ e x a c t and ξ 1 are very close to each other, as illustrated in Figure 10a. Figure 10b shows that the arguments of ξ e x a c t and ξ 1 are not close for even small values of w .

5. Scheme 3 for Numerical Experiment 1

In 2008, Wang et al. [1] proposed the following scheme to discretize
u t + η u u x + δ 2 u x x x = 0 , namely:
1 2 k ( v i 1 n + 1 v i 1 n + v i + 1 n v i + 1 n 1 ) + η v i 1 n + v i n + v i + 1 n 3 v i + 1 n v i 1 n 2 h
+ μ 2 2 h 3 ( v i + 2 n 2 v i + 1 n + 2 v i 1 n v i 2 n ) = 0 .
In order to discretize u t + 2 u x + u x x x = 0 , we propose
1 2 k ( v i 1 n + 1 v i 1 n + v i + 1 n v i + 1 n 1 ) + 1 h ( v i + 1 n v i 1 n ) + 1 2 h 3 ( v i + 2 n 2 v i + 1 n + 2 v i 1 n v i 2 n ) = 0 .
This gives
v i 1 n + 1 v i 1 n + v i + 1 n v i + 1 n 1 = 2 k h ( v i + 1 n v i 1 n ) k h 3 ( v i + 2 n 2 v i + 1 n + 2 v i 1 n v i 2 n ) = 0 ,
which can be written explicitly as
v i n + 1 = v i n v i + 2 n + v i + 2 n 1 2 k h ( v i + 2 n v i n ) k h 3 ( v i + 3 n 2 v i + 2 n + 2 v i n v i 1 n ) ,
where i = 2 , 3 , , N P 3 and n = 2 , 3 , , i t m a x 1 .

5.1. Stability of Scheme 3 for Numerical Experiment 1

Substituting v i n by ξ n e I θ i h and simplifying gives
ξ = 1 e 2 I θ h + ξ 1 e 2 I θ h 2 k h ( e 2 I θ h 1 ) k h 3 ( e 3 I θ h 2 e 2 I θ h + 2 e I θ h ) ,
After some rearrangements, we get
ξ 2 + A ξ + B = 0 ,
where
A = 2 k h ( cos ( 2 w ) 1 + I sin ( 2 w ) ) +
k h 3 ( cos ( 3 w ) 2 cos ( 2 w ) + 2 cos ( w ) + I [ sin ( 3 w ) 2 sin ( 2 w ) + sin ( w ) ] )
( 1 cos ( 2 w ) I sin ( 2 w ) )
and
B = ( cos ( 2 w ) + I sin ( 2 w ) ) .
Therefore,
ξ 1 , 2 = 1 2 ( A ± A 2 4 B ) .
We employ the condition | ξ | 1 to determine the appropriate range for the temporal step size when the spatial step size is π 10 with w [ π , π ] . The temporal step size is based on the behaviour of both ξ 1 = 1 2 ( A + A 2 4 B ) and ξ 2 = 1 2 ( A A 2 4 B ) . The region of stability, as shown in Figure 11 and Figure 12, implies that the scheme is stable for all 0 < k 0.001 .

5.2. Consistency of Scheme 3 for Numerical Experiment 1

In this section, the pointwise accuracy of Scheme (26) will be discussed. The scheme is written as
v i n + 1 = v i n v i + 2 n + v i + 2 n 1 2 k h ( v i + 2 n v i n ) k h 3 ( v i + 3 n 2 v i + 2 n + 2 v i n v i 1 n ) .
Using Taylor’s series expansion about ( n , i ) gives
v + k v t + k 2 2 v t t + k 3 6 v t t t + = v ( v + 2 h v x + ( 2 h ) 2 2 v x x + ( 2 h ) 3 6 v x x x + ) + v k v t + 2 h v x
+ 1 2 [ k 2 v t t 4 k h v t x + 4 h 2 v x x ]
+ 1 6 [ k 3 v t t t + 6 k 2 h v t t x 12 k h 2 v t x x + 8 h 3 v x x x ] 2 k h [ v + 2 h v x + ( 2 h ) 2 2 v x x + ( 2 h ) 3 6 v ]
k h 3 [ v + 3 h v x + ( 3 h ) 2 2 v x x + ( 3 h ) 3 6 v x x x ]
k h 3 [ 2 ( v + 2 h v x + ( 2 h ) 2 2 v x x + ( 2 h ) 3 6 v x x x ) + 2 v ( v h v x + h 2 2 v x x h 3 6 v x x x ) ] .
After some simplifications, we get,
v t + 2 v x + v x x x = 1 6 k 2 v t t t + h v x x x x k h 2 v t t x h 2 v t x x 4 3 h 2 v x x x + .
We conclude here that the scheme is second order accurate both in space and time.

5.3. Numerical Results

In this section, the approximation of the linear dispersive Equation (12) using Scheme 3 is presented. Within the stability region, the spatial and the temporal step size employed are h = π / 10 and k = 0.001 , respectively. The solution profiles are shown in Figure 13. These are compared with exact solution u ( x , t ) = sin ( x t ) . The profile of absolute errors is also presented at T = 2.0 and T = 4.0 . Figure 14 displays the absolute error profiles for the multisymplectic scheme. We compare L 1 and L errors in Table 3.

5.4. Dispersion Analysis

The arguments of the numerical amplification factors ξ 1 , 2 derived in Section 7.1 are compared with the exact amplification factor within the stability region. The profiles of the arguments of the amplification factors are shown in Figure 15.

6. Scheme 1 for Numerical Experiment 2

A classical finite difference scheme given by
v i n + 1 = v i n 1 k 3 h ( v i 1 n + v i n + v i + 1 n ) ( v i + 1 n v i 1 n ) + η 2 k h 3 ( v i + 2 n 2 v i + 1 n + 2 v i 1 n v i 2 n )
was proposed by Zabusky and Kruskal [4] for the solution of the nonlinear equation u t + u u x + δ 2 u x x x = 0 . The scheme will be adapted to solve u t + 2 u x + 5 u x x x = 0 and will be referred to as Scheme 1. Scheme 1 is given by
v i n + 1 = v i n 1 2 k h ( v i + 1 n v i 1 n ) + 5 k h 3 ( v i + 2 n 2 v i + 1 n + 2 v i 1 n v i 2 n ) ,
where i = 1 , 2 , 3 , , N P 3 and n = 2 , 3 , , i t m a x 1 .

6.1. Stability of Scheme 1 for Numerical Experiment 2

The amplification factor of this scheme satisfies the equation
ξ 2 + A I ξ 1 = 0 ,
where
A = 4 sin ( w ) k h + 5 k h 3 ( cos ( w ) 1 ) .
Therefore,
ξ 1 , 2 = 1 2 ( A I ± A 2 + 4 ) .
If we seek the amplification factor that is not purely imaginary, we require 4 A 2 0 which implies that | A | 2 . This implies that we need k such that
| 4 sin ( w ) k h + 5 k h 3 ( cos ( w ) 1 ) | 2 .
Note that the inequality is dominated by 10 k h 3 ( sin ( 2 w ) 2 sin ( w ) ) as h 0 . The maximum of this is at the point cos ( w ) = 1 2 . The stability region is
k 1 | 3 1 h 3 2 5 h 3 | .
If we choose h = π / 10 , we obtain k 0.00241869 . The range of values of the temporal step size k for which | ξ | 1 is also shown in the profile of the amplification factors ξ shown in Figure 16 and Figure 17 given that w = θ h [ π , π ] and h = π 10 . The profile is shown both for ξ 1 = 1 2 ( I A + A 2 + 4 ) as well as ξ 1 = 1 2 ( I A A 2 + 4 ) . It can be deduced from the two profiles in Figure 16 and Figure 17 that 0 < k 0.0025 .

6.2. Consistency of Scheme 1 for Numerical Experiment 2

We use Taylor’s series expansion about ( n , i ) in order to determine its order of accuracy. We obtain
v t + 2 v x + 5 v x x x = k 2 6 v t t t 1 6 h 2 v x x x +
and we conclude that the accuracy of the scheme is quadratic both in space and in time.

6.3. Numerical Results

In this section, the approximation of the linear dispersive Equation (15) by Scheme 1 (29) is presented. Within the stability region, the spatial and the temporal step sizes employed are h = π / 10 and k = 0.001 , respectively. The solution profiles are shown in Figure 18. These are compared with exact solution u ( x , t ) = sin ( x + 3 t ) . The profile of absolute errors is also presented at T = 2.0 and T = 4.0 . Figure 19 displays the absolute error profiles of Scheme 1 for Numerical Experiment 2. We compare L 1 and L errors in Table 4.

6.4. Dispersion Analysis

We consider u t + 2 u x + 5 u x x x = 0 . We use same techniques as in Section 3.4 The amplification factor is determined from the relation
ξ e x a c t = u ( x , t n + 1 ) u ( x , t n ) = e I θ ( 5 θ 2 2 ) k .
The relative phase error (RPE) is defined [27]
R P E = a r g ( ξ n u m e r i c a l ) a r g ( ξ e x a c t ) = a r g ( ξ n u m e r i c a l ) θ ( 5 θ 2 2 ) k .
We obtain plots of the arguments of ξ e x a c t , ξ 1 , ξ 2 vs. w [ 0 , π ] in Figure 20. For values of w [ 0 , 1 ] the graphs of the arguments of both ξ e x a c t and ξ 1 are very close to each other, as illustrated in Figure 20a.

7. Scheme 2 for Numerical Experiment 2

Wang et al. [14] proposed
1 2 k ( v i n + 1 v i n + v i + 1 n v i + 1 n 1 ) + η 2 h ( v i + 1 n + v i n ) ( v i + 1 n v i n ) + μ 2 h 3 ( v i + 2 n 3 v i + 1 n + 3 v i n v i 1 n ) = 0 .
For the approximation of the nonlinear KdV equation u t + η u u x + δ 2 u x x x = 0 , we adapt the method in Equation (30) to approximate Equation (15). The proposed method is
1 2 k ( v i n + 1 v i n + v i + 1 n v i + 1 n 1 ) + 2 h ( v i + 1 n v i n ) + 5 h 3 ( v i + 2 n 3 v i + 1 n + 3 v i n v i 1 n ) = 0 .
Analysis the stability, consistency and the dispersion properties of the Scheme given by ((31)) are discussed below.

7.1. Stability of Scheme 2 for Numerical Experiment 2

Scheme (31) can be rewritten explicitly as
v i n + 1 = v i n v i + 1 n + v i + 1 n 1 4 k h ( v i + 1 n v i n ) 10 k h 3 ( v i + 2 n 3 v i + 1 n + 3 v i n v i 1 n )
for all i = 2 , 3 , 4 , , N P 2 and n = 2 , 3 , , i t m a x 1 . The amplification factor satisfies
ξ 2 + A ξ + B = 0 ,
where
A = 4 k h ( e I θ h 1 ) + 10 k h 3 ( e 2 I θ h 3 e I θ h + 3 e I θ h ) ( 1 e I θ h )
and
B = e I θ h .
The roots of this equation are
ξ 1 , 2 = 1 2 ( A ± A 2 + 4 B ) .
We fix h = π / 10 and obtain plots of | ξ 1 | and | ξ 2 | , vs. w [ π , π ] vs. k in Figure 21 and Figure 22, respectively, and we deduce that the stability region is 0 < k < 0.001 .

7.2. Consistency of Scheme 2 for Numerical Experiment 2

In this section, the consistency of the numerical scheme (31) is discussed. We consider Equation (31) and use Taylor’s series expansion about ( n , i ) to get
v t + 2 v x + 5 v x x x = k 3 6 v t t t h 2 v t x + k h 4 v t x x h 2 12 v t x x h v x x h 2 3 v x x x h 3 12 v x x x x 5 h 2 v x x x x +
We note that
v t x + 2 v x x + 5 v x x x x 0
and we therefore obtain
v t + 2 v x + 5 v x x x = k 3 6 v t t t h 2 3 v x x x + k h 4 v t x x h 2 12 v t x x h 3 12 v x x x x +
We deduce that the scheme is of second order accuracy in both time and space.

7.3. Numerical Result

In this section, the approximation of the linear dispersive Equation (15) by Scheme 2, given in Equation (31), is presented. Within the stability region, the spatial and the temporal step sizes employed are h = π / 10 and k = 0.001 , respectively. The solution profiles are shown in Figure 23. These are compared with exact solution u ( x , t ) = sin ( x + 3 t ) . The profile of absolute errors are presented at T = 2.0 and T = 4.0 . Figure 24 displays the absolute error profiles. We display L 1 and L errors in Table 5.

7.4. Dispersion Analysis

We plot the arguments of the numerical amplification factors as derived in Section with the exact amplification factor in Figure 25. The argument of ξ 1 and the argument of exact amplification factor are quite close to each other for w [ 0 , 1 ] .

8. Scheme 3 for Numerical Experiment 2

Wang et al. [1] proposed the scheme
1 2 k ( v i 1 n + 1 v i 1 n + v i + 1 n v i + 1 n 1 ) + η v i 1 n + v i n + v i + 1 n 3 v i + 1 n v i 1 n 2 h
+ μ 2 2 h 3 ( v i + 2 n 2 v i + 1 n + 2 v i 1 n v i 2 n ) = 0
for the numerical approximation of the nonlinear equation. We adapt this scheme to solve the linear dispersive equation u t + 2 u x + 5 u x x x = 0 . The scheme for Equation (15) is
1 2 k ( v i 1 n + 1 v i 1 n + v i + 1 n v i + 1 n 1 ) + 2 v i + 1 n v i 1 n 2 h + 5 2 h 3 ( v i + 2 n 2 v i + 1 n + 2 v i 1 n v i 2 n ) = 0 .
In explicit form, after some index shift, this equation is written as
v i n + 1 = v i n v i + 2 n + v i + 2 n 1 2 k h ( v i + 2 n v i n ) 5 k h 3 ( v i + 3 n 2 v i + 2 n + 2 v i n v i 1 n ) .

8.1. Stability of Scheme 3 for Numerical Experiment 2

We substitute v i n by ξ n e I θ i h , and after simplification we get
ξ = 1 e 2 I θ h + ξ 1 e 2 I θ h 2 k h ( e 2 I θ h 1 ) 5 k h 3 ( e 3 I θ h 2 e 2 I θ h + 2 e I θ h ) + e 2 I θ h .
This is a quadratic equation in ξ , written as ξ 2 + A ξ + B = 0 where
A = 2 k h ( e 2 I θ h 1 ) + 5 k h 3 ( e 3 I θ h 2 e 2 I θ h + 2 e I θ h ) ( 1 e 2 I θ h )
and
B = e 2 I θ h .
The amplification factors ξ 1 , 2 are, therefore, obtained as ξ 1 = 1 2 ( A + A 2 + 4 B ) and ξ 2 = 1 2 ( A A 2 + 4 B ) . The stability constraint for the scheme is computed from each of these amplification factors using h = π 10 for θ h = w [ π , π ] . The stability region is deduced from Figure 26 and Figure 27 as 0 < k 0.001 .

8.2. Consistency of Scheme 3 for Numerical Experiment 2

To discuss the consistency of the scheme in Equation (35), consider the Taylor expansion about ( n , i ) . After simplification, we get
1 2 k ( 2 k v t + 2 h k v t x + 2 k 3 6 v t t t + 2 h 2 k v t x x h k 2 v t t x )
+ 1 h ( 2 h v x + 4 h 2 2 v x x + 8 h 3 6 v x x x + ( 2 h ) 4 24 v x x x x ) + 5 2 h 3 ( 2 h 3 v x x x + 2 h 4 v x x x x + ) = 0 .
We obtain
v t + 2 v x + 5 v x x x = k 2 6 v t t t h 2 v t x x + h k 2 v t t x 4 3 h 2 v x x x 2 3 h 3 v x x x x + ,
hence, the scheme is spatially and temporally accurate of order 2.

8.3. Numerical Results

In this section, the approximate solution of the linear dispersive Equation (15) by Scheme 3, given in Equation (35), is presented. Within the stability region, the spatial and the temporal step sizes employed are h = π / 10 and k = 0.001 , respectively. The solution profiles are shown in Figure 28. These are compared with exact solution u ( x , t ) = sin ( x + 3 t ) . The profile of absolute errors is also presented at T = 2.0 and T = 4.0 . Figure 29 displays the absolute error profiles for the multisymplectic scheme. We display L 1 and L errors in Table 6.

8.4. Dispersion Analysis

The arguments of the numerical amplification factors ξ 1 , 2 are compared with the argument of the exact solution of the linear dispersive Equation (15). The amplification factors are derived in Section 8.1. The comparisons are shown in Figure 30.

9. Conclusions

This paper considers, proposes and analyzes three finite difference schemes for two linear dispersive KdV equations. One of the cases is such that the advective term dominates the dispersive term, while in the second case, the dispersive term dominates the advective term. Stability regions were derived for the schemes, their accuracies were discussed and their dispersion analyses were conducted and presented.
It is observed that for Numerical Experiment 1, the stability region for Scheme 3, 0 < k 0.001 , is narrower compared to the stability region 0 < k 0.01 for Scheme 1 and Scheme 2. The maximum absolute error of Scheme 1 is relatively less than the maximum absolute error for Scheme 2 and Scheme 3 both for short time and long time integration. In addition, the stability restraint is relaxed when Scheme 1 is employed to approximate Numerical Experiment 2 than Scheme 2 and Scheme 3. In this case, the maximum absolute error, when Scheme 2 is employed to solve Numerical Experiment 2 is less compared to Scheme 1 and Scheme 3. In fact, the highest error is recorded for Scheme 1.
A comparison of results of classical finite difference methods with Laplace Adomian Decomposition Method for Numerical Experiment 1 was done in [30], and it was observed that at a low propagation time of 0.1 s, LADM is better than the classical scheme but that at long time propagation (say when time = 4.0), the performance of LADM deteriorates significantly.
We intend to use the knowledge acquired in this paper to construct methods for linearized KdV equations in both 1 D and 2 D with more challenging initial conditions and check which of the three schemes is the best performing. Moreover, we can also construct similar methods for PDEs quite related to the KdV equations, especially those with u u x and u x x x terms present and these examples of PDEs are fractional KdV, modified KdV, KdV–Burgers–Kuramoto, KdV-Burgers and stochastic KdV equations.

Author Contributions

Conceptualization, A.R.A.; methodology, A.A.A. and A.R.A.; software, A.A.A. and A.R.A.; validation, A.A.A., A.R.A.; formal analysis, A.A.A. and A.R.A.; investigation, A.A.A. and A.R.A.; resources, A.A.A. and A.R.A.; writing—original draft preparation, A.R.A.; typing, A.A.A.; writing—review and editing, A.A.A. and A.R.A.; supervision, A.R.A.; project administration, A.R.A.; funding acquisition, A.R.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Acknowledgments

The authors are very grateful to the four anonymous reviewers who provided feedback and suggestions which enabled us to improve the paper considerably.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
KdVKorteweg–de-Vries
PDEPartial differential equation

References

  1. Wang, H.P.; Wang, Y.S.; Hu, Y.Y. An explicit scheme for the KdV equation. Chin. Phys. Lett. 2008, 25, 2335. [Google Scholar]
  2. Korteweg, D.J.; De Vries, G. XLI. On the change of form of long waves advancing in a rectangular canal, and on a new type of long stationary waves. Lond. Edinb. Dublin Philos. Mag. J. Sci. 1895, 39, 422–443. [Google Scholar] [CrossRef]
  3. Kakutani, T.; Kawahara, T.; Taniuti, T. Nonlinear hydromagnetic solitary waves in a collision-free plasma with isothermal electron pressure. J. Phys. Soc. Jpn. 1967, 23, 1138–1149. [Google Scholar] [CrossRef]
  4. Zabusky, N.J.; Kruskal, M.D. Interaction of “solitons” in a collisionless plasma and the recurrence of initial states. Phys. Rev. Lett. 1965, 15, 240. [Google Scholar] [CrossRef] [Green Version]
  5. Washimi, H.; Taniuti, T. Propagation of ion-acoustic solitary waves of small amplitude. Phys. Rev. Lett. 1966, 17, 996. [Google Scholar] [CrossRef]
  6. Hasegawa, A.; Matsumoto, M. Optical solitons in fibers. In Optical Solitons in Fibers; Springer: Berlin/Heidelberg, Germany, 2003; pp. 41–59. [Google Scholar]
  7. Lax, P.D. Development of singularities of solutions of nonlinear hyperbolic partial differential equations. J. Math. Phys. 1964, 5, 611–613. [Google Scholar] [CrossRef]
  8. Li, S.; Vu-Quoc, L. Finite difference calculus invariant structure of a class of algorithms for the nonlinear Klein–Gordon equation. SIAM J. Numer. Anal. 1995, 32, 1839–1875. [Google Scholar] [CrossRef]
  9. Zhao, P.F.; Qin, M.Z. Multisymplectic geometry and multisymplectic Preissmann scheme for the KdV equation. J. Phys. Math. Gen. 2000, 33, 3613. [Google Scholar] [CrossRef]
  10. Budd, C.; Piggott, M. Geometric integration and its applications. In Proceedings of the Workshop on Developments in Numerical Methods for Very High Resolution Global Models, Reading, UK, 5–7 June 2000. [Google Scholar]
  11. Hairer, E.; Lubich, C.; Wanner, G. Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2006; Volume 31. [Google Scholar]
  12. Sanz-Serna, J.M.; Calvo, M.P. Numerical Hamiltonian Problems; Courier Dover Publications: Mineola, NY, USA, 2018. [Google Scholar]
  13. Ascher, U.M.; McLachlan, R.I. On symplectic and multisymplectic schemes for the KdV equation. J. Sci. Comput. 2005, 25, 83–104. [Google Scholar] [CrossRef] [Green Version]
  14. Wang, Y.S.; Wang, B.; Xin, C. Multisymplectic Euler box scheme for the KdV equation. Chin. Phys. Lett. 2007, 24, 312. [Google Scholar]
  15. Appadu, A.R.; Chapwanya, M.; Jejeniwa, O. Some optimised schemes for 1D Korteweg-de-Vries equation. Prog. Comput. Fluid Dyn. Int. J. 2017, 17, 250–266. [Google Scholar] [CrossRef]
  16. Brauer, K. The Korteweg-de Vries Equation: History, Exact Solutions, and Graphical Representation; University of Osnabrück: Osnabrück, Germany, 2000. [Google Scholar]
  17. Al-Mdallal, Q.M.; Syam, M.I. Sine–Cosine method for finding the soliton solutions of the generalized fifth-order nonlinear equation. Chaos Solitons Fractals 2007, 33, 1610–1617. [Google Scholar] [CrossRef]
  18. Al-Mdallal, Q.M. A new family of exact solutions to the unsteady Navier–Stokes equations using canonical transformation with complex coefficients. Appl. Math. Comput. 2008, 196, 303–308. [Google Scholar] [CrossRef]
  19. Durran, D.R. Numerical Methods for Wave Equations in Geophysical Fluid Dynamics; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2013; Volume 32. [Google Scholar]
  20. Morton, K.; Mayers, D. Numerical solution of partial differential equations. J. Fluid Mech. 1998, 363, 349. [Google Scholar]
  21. Appadu, A.; Dauhoo, M.; Rughooputh, S. Control of numerical effects of dispersion and dissipation in numerical schemes for efficient shock-capturing through an optimal Courant number. Comput. Fluids 2008, 37, 767–783. [Google Scholar] [CrossRef]
  22. Niyogi, P. Introduction to Computational Fluid Dynamics; Pearson Education India: Delhi, India, 2006. [Google Scholar]
  23. Appadu, A.; Djoko, J.; Gidey, H. Performance of some finite difference methods for a 3D advection–diffusion equation. Rev. Real Acad. Cienc. Exactas Físicas Nat. Ser. Matemáticas 2018, 112, 1179–1210. [Google Scholar] [CrossRef]
  24. Appadu, A.R. Numerical solution of the 1D advection-diffusion equation using standard and nonstandard finite difference schemes. J. Appl. Math. 2013, 2013, 734374. [Google Scholar] [CrossRef]
  25. Appadu, A.R.; Gidey, H. Time-splitting procedures for the numerical solution of the 2D advection-diffusion equation. Math. Probl. Eng. 2013, 2013, 634657. [Google Scholar] [CrossRef]
  26. Ascher, U.M.; McLachlan, R.I. Multisymplectic box schemes and the Korteweg–de Vries equation. Appl. Numer. Math. 2004, 48, 255–269. [Google Scholar] [CrossRef] [Green Version]
  27. Appadu, A.R.; Lubuma, J.M.; Mphephu, N. Computational study of three numerical methods for some linear and nonlinear advection-diffusion-reaction problems. Prog. Comput. Fluid Dyn. Int. J. 2017, 17, 114–129. [Google Scholar] [CrossRef] [Green Version]
  28. Wazwaz, A.M. An analytic study on the third-order dispersive partial differential equations. Appl. Math. Comput. 2003, 142, 511–520. [Google Scholar] [CrossRef]
  29. Appadu, A.R.; Kelil, A.S. On Semi-Analytical Solutions for Linearized Dispersive KdV Equations. Mathematics 2020, 8, 1769. [Google Scholar] [CrossRef]
  30. Ndala, Y.I. On the Solution of Linearized KdV Equations Using Semi-Analytic and Finite Difference Methods. Bachelor’s Thesis, Nelson Mandela University, Port Elizabeth, South Africa, 2021. [Google Scholar]
Figure 1. Plot of | ξ 1 | vs. k vs. w [ π , π ] of Scheme 1 for Numerical Experiment 1. The spatial step size is h = π / 10 .
Figure 1. Plot of | ξ 1 | vs. k vs. w [ π , π ] of Scheme 1 for Numerical Experiment 1. The spatial step size is h = π / 10 .
Fluids 06 00214 g001
Figure 2. Plot of | ξ 2 | vs. k vs. w [ π , π ] of Scheme 1 for Numerical Experiment 1. The spatial step size is h = π / 10 .
Figure 2. Plot of | ξ 2 | vs. k vs. w [ π , π ] of Scheme 1 for Numerical Experiment 1. The spatial step size is h = π / 10 .
Fluids 06 00214 g002
Figure 3. Plot of exact and numerical profiles (using Scheme 1), vs. x at times 2.0 and 4.0 using h = π / 10 and k = 0.001 (Numerical Experiment 1).
Figure 3. Plot of exact and numerical profiles (using Scheme 1), vs. x at times 2.0 and 4.0 using h = π / 10 and k = 0.001 (Numerical Experiment 1).
Fluids 06 00214 g003
Figure 4. Plot of the absolute error vs. x using Scheme 1 for Numerical Experiment 1. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Figure 4. Plot of the absolute error vs. x using Scheme 1 for Numerical Experiment 1. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Fluids 06 00214 g004
Figure 5. Plot of the arguments of the exact and numerical amplification factors of Scheme 1 for Numerical Experiment 1 with the spatial and temporal step sizes h = π / 10 and k = 0.001 , respectively.
Figure 5. Plot of the arguments of the exact and numerical amplification factors of Scheme 1 for Numerical Experiment 1 with the spatial and temporal step sizes h = π / 10 and k = 0.001 , respectively.
Fluids 06 00214 g005
Figure 6. Plot of | ξ 1 | vs. k vs. w [ π , π ] of Scheme 2 for Numerical Experiment 1. The spatial step size h = π / 10 .
Figure 6. Plot of | ξ 1 | vs. k vs. w [ π , π ] of Scheme 2 for Numerical Experiment 1. The spatial step size h = π / 10 .
Fluids 06 00214 g006
Figure 7. Plot of | ξ 2 | vs. k vs. w [ π , π ] of Scheme 2 for Numerical Experiment 1. The spatial step size h = π / 10 .
Figure 7. Plot of | ξ 2 | vs. k vs. w [ π , π ] of Scheme 2 for Numerical Experiment 1. The spatial step size h = π / 10 .
Fluids 06 00214 g007
Figure 8. Plot of exact and numerical profiles (using Scheme 2), vs. x at times 2.0 and 4.0 using h = π / 10 and k = 0.001 .
Figure 8. Plot of exact and numerical profiles (using Scheme 2), vs. x at times 2.0 and 4.0 using h = π / 10 and k = 0.001 .
Fluids 06 00214 g008
Figure 9. Plot of the absolute error vs. x using Scheme 2 for Numerical Experiment 1. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Figure 9. Plot of the absolute error vs. x using Scheme 2 for Numerical Experiment 1. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Fluids 06 00214 g009
Figure 10. Plot of the arguments of amplification factors of Scheme 2 for Numerical Experiment 1 with spatial and temporal step sizes h = π / 10 and k = 0.001 , respectively.
Figure 10. Plot of the arguments of amplification factors of Scheme 2 for Numerical Experiment 1 with spatial and temporal step sizes h = π / 10 and k = 0.001 , respectively.
Fluids 06 00214 g010
Figure 11. Plot of | ξ 1 | vs. k vs. w [ π , π ] of Scheme 3 for Numerical Experiment 1. The spatial step size h = π / 10 .
Figure 11. Plot of | ξ 1 | vs. k vs. w [ π , π ] of Scheme 3 for Numerical Experiment 1. The spatial step size h = π / 10 .
Fluids 06 00214 g011
Figure 12. Plot of | ξ 2 | vs. k vs. w [ π , π ] of Scheme 3 for Numerical Experiment 1. The spatial step size h = π / 10 .
Figure 12. Plot of | ξ 2 | vs. k vs. w [ π , π ] of Scheme 3 for Numerical Experiment 1. The spatial step size h = π / 10 .
Fluids 06 00214 g012
Figure 13. Plot of the solution profile of Numerical Experiment 1 by Scheme 3. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Figure 13. Plot of the solution profile of Numerical Experiment 1 by Scheme 3. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Fluids 06 00214 g013
Figure 14. Plot of the absolute error vs. x using Scheme 3 for Numerical Experiment 1. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Figure 14. Plot of the absolute error vs. x using Scheme 3 for Numerical Experiment 1. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Fluids 06 00214 g014
Figure 15. Plot of the arguments of amplification factors of Scheme 3 for Numerical Experiment 1 with the spatial and temporal step sizes h = π / 10 and k = 0.001 , respectively.
Figure 15. Plot of the arguments of amplification factors of Scheme 3 for Numerical Experiment 1 with the spatial and temporal step sizes h = π / 10 and k = 0.001 , respectively.
Fluids 06 00214 g015
Figure 16. Plot of | ξ 1 | vs. k vs. w [ π , π ] of Scheme 1 for Numerical Experiment 2. The spatial step size h = π / 10 .
Figure 16. Plot of | ξ 1 | vs. k vs. w [ π , π ] of Scheme 1 for Numerical Experiment 2. The spatial step size h = π / 10 .
Fluids 06 00214 g016
Figure 17. Plot of | ξ 2 | vs. k vs. w [ π , π ] of Scheme 1 for Numerical Experiment 2. The spatial step size h = π / 10 .
Figure 17. Plot of | ξ 2 | vs. k vs. w [ π , π ] of Scheme 1 for Numerical Experiment 2. The spatial step size h = π / 10 .
Fluids 06 00214 g017
Figure 18. Plot of exact and numerical profiles (using Scheme 1) vs. x at times 2.0 and 4.0 using h = π / 10 and k = 0.001 (Numerical Experiment 2).
Figure 18. Plot of exact and numerical profiles (using Scheme 1) vs. x at times 2.0 and 4.0 using h = π / 10 and k = 0.001 (Numerical Experiment 2).
Fluids 06 00214 g018
Figure 19. Plot of the absolute error vs. x using Scheme 1 for Numerical Experiment 2. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Figure 19. Plot of the absolute error vs. x using Scheme 1 for Numerical Experiment 2. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Fluids 06 00214 g019
Figure 20. Plot of the arguments of amplification factors of Scheme 1 for Numerical Experiment 2 with the spatial and temporal step sizes h = π / 10 and k = 0.001 , respectively.
Figure 20. Plot of the arguments of amplification factors of Scheme 1 for Numerical Experiment 2 with the spatial and temporal step sizes h = π / 10 and k = 0.001 , respectively.
Fluids 06 00214 g020
Figure 21. Plot of | ξ 1 | vs. k vs. w [ π , π ] of Scheme 2 for Numerical Experiment 2. The spatial step size h = π / 10 .
Figure 21. Plot of | ξ 1 | vs. k vs. w [ π , π ] of Scheme 2 for Numerical Experiment 2. The spatial step size h = π / 10 .
Fluids 06 00214 g021
Figure 22. Plot of | ξ 2 | vs. k vs. w [ π , π ] of Scheme 2 for Numerical Experiment 2. The spatial step size h = π / 10 .
Figure 22. Plot of | ξ 2 | vs. k vs. w [ π , π ] of Scheme 2 for Numerical Experiment 2. The spatial step size h = π / 10 .
Fluids 06 00214 g022
Figure 23. Plot of exact and numerical profiles (using Scheme 2) vs. x at times 2.0 and 4.0 using h = π / 10 and k = 0.001 (Numerical Experiment 2).
Figure 23. Plot of exact and numerical profiles (using Scheme 2) vs. x at times 2.0 and 4.0 using h = π / 10 and k = 0.001 (Numerical Experiment 2).
Fluids 06 00214 g023
Figure 24. Plot of the absolute error vs. x using Scheme 2 for Numerical Experiment 2. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Figure 24. Plot of the absolute error vs. x using Scheme 2 for Numerical Experiment 2. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Fluids 06 00214 g024
Figure 25. Plot of the arguments of amplification factors of Scheme 2 for Numerical Experiment 2 with the spatial and temporal step sizes h = π / 10 and k = 0.001 , respectively.
Figure 25. Plot of the arguments of amplification factors of Scheme 2 for Numerical Experiment 2 with the spatial and temporal step sizes h = π / 10 and k = 0.001 , respectively.
Fluids 06 00214 g025
Figure 26. Plot of | ξ 1 | vs. k vs. w of Scheme 3 for Numerical Experiment 2. The spatial step size h = π / 10 .
Figure 26. Plot of | ξ 1 | vs. k vs. w of Scheme 3 for Numerical Experiment 2. The spatial step size h = π / 10 .
Fluids 06 00214 g026
Figure 27. Plot of | ξ 2 | vs. k vs. w [ π , π ] of Scheme 3 for Numerical Experiment 2. The spatial step size h = π / 10 .
Figure 27. Plot of | ξ 2 | vs. k vs. w [ π , π ] of Scheme 3 for Numerical Experiment 2. The spatial step size h = π / 10 .
Fluids 06 00214 g027
Figure 28. Plot of exact and numerical profiles (using Scheme 3) vs. x at times 2.0 and 4.0 using h = π / 10 and k = 0.001 (Numerical experiment 2).
Figure 28. Plot of exact and numerical profiles (using Scheme 3) vs. x at times 2.0 and 4.0 using h = π / 10 and k = 0.001 (Numerical experiment 2).
Fluids 06 00214 g028
Figure 29. Plot of the absolute error vs. x using Scheme 3 for Numerical Experiment 2. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Figure 29. Plot of the absolute error vs. x using Scheme 3 for Numerical Experiment 2. The spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Fluids 06 00214 g029
Figure 30. Plot of the arguments of amplification factors of Scheme 3 for Numerical Experiment 2 with the spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Figure 30. Plot of the arguments of amplification factors of Scheme 3 for Numerical Experiment 2 with the spatial and temporal step sizes are h = π / 10 and k = 0.001 , respectively.
Fluids 06 00214 g030
Table 1. L 1 and L errors for various k when h = π / 10 when Scheme 1 is employed to approximate Numerical Experiment 1 at T = 2 and T = 4 .
Table 1. L 1 and L errors for various k when h = π / 10 when Scheme 1 is employed to approximate Numerical Experiment 1 at T = 2 and T = 4 .
Error
Step Sizes k T = 2 T = 4
L 1 ( × 10 1 ) L ( × 10 2 ) L 1 ( × 10 1 ) L ( × 10 2 )
0.001 1.3933 1.7015 1.7752 2.1496
0.002 1.3933 1.7016 1.7751 2.1493
0.003 1.3936 1.7021 1.7753 2.1477
0.004 1.3934 1.7019 1.7747 2.1478
0.005 1.3934 1.7012 1.7746 2.1464
0.006 1.3918 1.6964 1.7736 2.1510
0.007 1.3943 1.6997 1.7752 2.1442
0.008 1.3936 1.6998 1.7738 2.1418
0.009 1.3934 1.7011 1.7752 2.1362
0.01 1.3944 1.7012 1.7725 2.1368
Table 2. L 1 and L errors for various k when h = π / 10 when Scheme 2 is employed to approximate Numerical Experiment 1 at T = 2 and T = 4 .
Table 2. L 1 and L errors for various k when h = π / 10 when Scheme 2 is employed to approximate Numerical Experiment 1 at T = 2 and T = 4 .
Error
Step Sizes k T = 2 T = 4
L 1 ( × 10 1 ) L ( × 10 2 ) L 1 ( × 10 1 ) L ( × 10 2 )
0.001 2.9200 2.9327 4.6733 4.7894
0.002 2.9335 2.9464 4.6955 4.8124
0.003 2.9486 2.9628 4.7174 4.8344
0.004 2.9607 2.9739 4.7402 4.8587
0.005 2.9743 2.9877 4.7627 4.8819
0.006 2.9849 2.9961 4.7860 4.9074
0.007 3.0047 3.0219 4.8069 4.9244
0.008 3.0122 3.0345 4.8314 4.9580
Table 3. L 1 and L errors for various k when h = π / 10 when Scheme 3 is employed to approximate Numerical Experiment 1 at T = 2 and T = 4 .
Table 3. L 1 and L errors for various k when h = π / 10 when Scheme 3 is employed to approximate Numerical Experiment 1 at T = 2 and T = 4 .
Error
Step Sizes k T = 2 T = 4
L 1 ( × 10 1 ) L ( × 10 2 ) L 1 L ( × 10 1 )
0.001 7.2243 7.8696 1.1062 1.2406
0.002 7.2513 7.8993 1.1105 1.2455
0.003 7.2807 7.9356 1.1148 1.2497
0.004 7.3052 7.9589 1.1190 1.2553
0.005 7.3322 7.9887 1.1234 1.2602
0.006 7.3542 8.0054 1.1277 1.2665
0.007 7.3916 8.0616 1.1321 1.2679
0.008 7.4137 8.0783 1.1364 1.2750
0.009 7.4357 8.0950 1.1408 1.2770
0.01 7.4682 8.1382 1.1451 1.2848
Table 4. L 1 and L errors for various k when h = π / 10 when Scheme 1 is employed to approximate Numerical Experiment 2 at T = 2 and T = 4 .
Table 4. L 1 and L errors for various k when h = π / 10 when Scheme 1 is employed to approximate Numerical Experiment 2 at T = 2 and T = 4 .
Error
Step Sizes k T = 2 T = 4
L 1 ( × 10 1 ) L ( × 10 2 ) L 1 L ( × 10 1 )
0.001 1.2362 1.6724 2.0847 3.0605
0.002 1.2322 1.6849 2.0852 3.0651
Table 5. L 1 and L errors for various k when h = π / 10 when Scheme 2 is employed to approximate Numerical Experiment 2 at T = 2 and T = 4 .
Table 5. L 1 and L errors for various k when h = π / 10 when Scheme 2 is employed to approximate Numerical Experiment 2 at T = 2 and T = 4 .
Error
Step Sizes k T = 2 T = 4
L 1 ( × 10 2 ) L ( × 10 3 ) L 1 ( × 10 2 ) L ( × 10 3 )
0.0001 2.6768 3.2056 3.3807 4.5001
0.0002 2.6885 3.2190 3.3954 4.5195
0.0003 2.6997 3.2306 3.4106 4.5405
0.0004 2.7119 3.2460 3.4245 4.5582
0.0005 2.7236 3.2595 3.4391 4.5776
0.0006 2.7362 3.2769 3.4523 4.5935
0.0007 2.7473 3.2883 3.4695 4.6195
0.0008 2.7584 3.2998 3.4827 4.6354
0.0009 2.7710 3.3172 3.4998 4.6614
0.001 2.7816 3.3266 3.5116 4.6739
Table 6. L 1 and L errors for various k when h = π / 10 when Scheme 3 is employed to approximate Numerical Experiment 2 at T = 2 and T = 4 .
Table 6. L 1 and L errors for various k when h = π / 10 when Scheme 3 is employed to approximate Numerical Experiment 2 at T = 2 and T = 4 .
Error
Step Sizes k T = 2 T = 4
L 1 ( × 10 2 ) L ( × 10 3 ) L 1 ( × 10 2 ) L ( × 10 3 )
0.0001 7.8870 9.9051 8.1634 8.24321
0.0002 7.8720 9.8882 8.1440 8.2225
0.0003 7.8554 9.8643 8.1247 8.2082
0.0004 7.8422 9.8545 8.1254 8.1810
0.0005 7.8273 9.8377 8.0860 8.1602
0.0006 7.8107 9.8140 8.0669 8.1652
0.0007 7.7966 9.8007 8.0475 8.1316
0.0008 7.7826 9.7873 8.0282 8.0981
0.0009 7.7661 9.7638 8.0091 8.1029
0.001 7.7529 9.7538 7.9897 8.0567
0.002 7.6051 9.5873 7.7978 7.8503
0.003 7.4446 9.3599 7.6076 7.7051
0.004 8.0514 12.2661 7.6774 18.6819
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Aderogba, A.A.; Appadu, A.R. Classical and Multisymplectic Schemes for Linearized KdV Equation: Numerical Results and Dispersion Analysis. Fluids 2021, 6, 214. https://doi.org/10.3390/fluids6060214

AMA Style

Aderogba AA, Appadu AR. Classical and Multisymplectic Schemes for Linearized KdV Equation: Numerical Results and Dispersion Analysis. Fluids. 2021; 6(6):214. https://doi.org/10.3390/fluids6060214

Chicago/Turabian Style

Aderogba, Adebayo Abiodun, and Appanah Rao Appadu. 2021. "Classical and Multisymplectic Schemes for Linearized KdV Equation: Numerical Results and Dispersion Analysis" Fluids 6, no. 6: 214. https://doi.org/10.3390/fluids6060214

APA Style

Aderogba, A. A., & Appadu, A. R. (2021). Classical and Multisymplectic Schemes for Linearized KdV Equation: Numerical Results and Dispersion Analysis. Fluids, 6(6), 214. https://doi.org/10.3390/fluids6060214

Article Metrics

Back to TopTop