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
which describes the long time asymptotic behaviour of a small but finite amplitude of one-dimensional shallow water waves. In the equation above, measures the elevation (height of water above equilibrium level) at time t and position x while is referred to as the dispersion coefficient. There are two different mechanisms that are present, namely;
- Nonlinearity , 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 is the solution of the KdV equation given by Equation (1) above, the three invariants are
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
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 with for , using periodic boundary conditions and employing the Zabusky–Kruskal scheme. They tried various combinations satisfying the linear stability bound, yet they always obtained blow-up phenomena for . Setting , the solution, using an explicit scheme, is qualitatively correct for a while. Around 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 with initial conditions sech with [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]
where is the amplification factor of the numerical scheme and is the exact amplification factor. The relative phase error of numerical schemes discretizing 1D linear advection equation and 1D advection-diffusion equation is calculated as [21,23,24,25]
Plots of relative phase error vs. w at some values of for a few schemes discretizing 1D linear advection and 1D advection-diffusion equation were obtained in [21] and [24], respectively. Plots of RPE vs. vs. 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
On considering the linearized version of the PDE
Appadu et al. [15] considered the linearized form of the PDE 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 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]
with and .
The initial condition is , boundary conditions are
and
The exact solution is 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
with and . The initial condition is , and the boundary conditions are
and
The exact solution is
3. Scheme 1 for Numerical Experiment 1
A classical finite difference scheme given by
was proposed in [4] for the solution of the nonlinear equation The scheme is adapted to solve as given in Equation (12). Therefore, Scheme 1 is given by
for and
3.1. Stability of Scheme 1 for Numerical Experiment 1
In this section, the stability region of Scheme 1 is obtained. We substitute by in Equation (18). This gives
After some rearrangements, we get
where
Therefore,
We denote the amplification factor of the physical and the computational modes by and , respectively.
and
If we seek amplification factor that is not purely imaginary, we require , which implies that . This implies that we need k such that
Note that the inequality is dominated by as The maximum is when We obtain the stability region as
If we choose (22) gives We can also obtain the stability region by use of 2D plots, as shown in Figure 1 and Figure 2. The stability region when is , as illustrated in Figure 1b and Figure 2b.
Figure 1.
Plot of vs. k vs. of Scheme 1 for Numerical Experiment 1. The spatial step size is
Figure 2.
Plot of vs. k vs. of Scheme 1 for Numerical Experiment 1. The spatial step size is
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 .
3.2. Consistency of Scheme 1 for Numerical Experiment 1
The scheme in Equation (18) is given by
We use the Taylor series about the point in order to determine the order of accuracy of the scheme. By the Taylor’s expansion,
so that
Furthermore
and
so that
In addition
and
so that
We obtain
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 and , respectively. The solution profiles are shown in Figure 3. These are compared with the exact solution The profile of absolute errors vs. x is also presented at and . Figure 4 displays the absolute error profiles for the scheme. Table 1 displays and errors at some values of k when .
Figure 3.
Plot of exact and numerical profiles (using Scheme 1), vs. x at times and using and (Numerical Experiment 1).
Figure 4.
Plot of the absolute error vs. x using Scheme 1 for Numerical Experiment 1. The spatial and temporal step sizes are and , respectively.
Table 1.
and errors for various k when when Scheme 1 is employed to approximate Numerical Experiment 1 at and .
3.4. Dispersion Analysis
A perturbation for is
where is the dispersion relation. We consider . Then,
This implies that the perturbation for can be written as a function of alone as The amplification factor is determined from the relation
Relative phase error (RPE) is defined [27] as
We obtain plots of the arguments of vs. in Figure 5. For values of , the graphs of the arguments of both and are very close to each other, as illustrated in Figure 5a. For values of , the graphs for the arguments of and are very close to each other, as depicted in Figure 5b, and we note that and are of opposite signs for
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 and , respectively.
4. Scheme 2 for Numerical Experiment 1
In 2007, Wang et al. [14] constructed the following scheme to solve
where is the coefficient of the nonlinear term . The scheme is multisymplectic and can remove the dispersive oscillations and preserves approximately several conservation laws of the KdV equation [14].
To discretize we propose
This gives
which can be rewritten as
for and
4.1. Stability of Scheme 2 for Numerical Experiment 1
Substituting by and simplifying gives
After some rearrangements, we get where
and therefore, we get
with and The range of values of the temporal step size k for which is shown in the profiles of the amplification factor (see Figure 6 and Figure 7) given that and It is observed that
Figure 6.
Plot of vs. k vs. of Scheme 2 for Numerical Experiment 1. The spatial step size
Figure 7.
Plot of vs. k vs. of Scheme 2 for Numerical Experiment 1. The spatial step size
4.2. Consistency of Scheme 2 for Numerical Experiment 1
We recall that the scheme is given by
Taylor series expansion about after simplification gives
We obtain
Since hence
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 and , respectively. The solution profiles are shown in Figure 8. These are compared with exact solution The profile of absolute errors vs. x is also presented at and . Figure 9 displays the absolute error profiles for the multisymplectic scheme. We display and errors in Table 2.
Figure 8.
Plot of exact and numerical profiles (using Scheme 2), vs. x at times and using and .
Figure 9.
Plot of the absolute error vs. x using Scheme 2 for Numerical Experiment 1. The spatial and temporal step sizes are and , respectively.
Table 2.
and errors for various k when when Scheme 2 is employed to approximate Numerical Experiment 1 at and .
4.4. Dispersion Analysis
Arguments of numerical amplification factors 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 vs. in Figure 10. For values of , the graphs for the arguments of both and are very close to each other, as illustrated in Figure 10a. Figure 10b shows that the arguments of and are not close for even small values of
Figure 10.
Plot of the arguments of amplification factors of Scheme 2 for Numerical Experiment 1 with spatial and temporal step sizes and , respectively.
5. Scheme 3 for Numerical Experiment 1
In 2008, Wang et al. [1] proposed the following scheme to discretize
namely:
In order to discretize we propose
This gives
which can be written explicitly as
where and
5.1. Stability of Scheme 3 for Numerical Experiment 1
Substituting by and simplifying gives
After some rearrangements, we get
where
and
Therefore,
We employ the condition to determine the appropriate range for the temporal step size when the spatial step size is with The temporal step size is based on the behaviour of both and The region of stability, as shown in Figure 11 and Figure 12, implies that the scheme is stable for all .
Figure 11.
Plot of vs. k vs. of Scheme 3 for Numerical Experiment 1. The spatial step size
Figure 12.
Plot of vs. k vs. of Scheme 3 for Numerical Experiment 1. The spatial step size
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
Using Taylor’s series expansion about gives
After some simplifications, we get,
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 and , respectively. The solution profiles are shown in Figure 13. These are compared with exact solution The profile of absolute errors is also presented at and . Figure 14 displays the absolute error profiles for the multisymplectic scheme. We compare and errors in Table 3.
Figure 13.
Plot of the solution profile of Numerical Experiment 1 by Scheme 3. The spatial and temporal step sizes are and , respectively.
Figure 14.
Plot of the absolute error vs. x using Scheme 3 for Numerical Experiment 1. The spatial and temporal step sizes are and , respectively.
Table 3.
and errors for various k when when Scheme 3 is employed to approximate Numerical Experiment 1 at and .
5.4. Dispersion Analysis
The arguments of the numerical amplification factors 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.
Figure 15.
Plot of the arguments of amplification factors of Scheme 3 for Numerical Experiment 1 with the spatial and temporal step sizes and , respectively.
6. Scheme 1 for Numerical Experiment 2
A classical finite difference scheme given by
was proposed by Zabusky and Kruskal [4] for the solution of the nonlinear equation The scheme will be adapted to solve and will be referred to as Scheme 1. Scheme 1 is given by
where and
6.1. Stability of Scheme 1 for Numerical Experiment 2
The amplification factor of this scheme satisfies the equation
where
Therefore,
If we seek the amplification factor that is not purely imaginary, we require which implies that . This implies that we need k such that
Note that the inequality is dominated by as The maximum of this is at the point The stability region is
If we choose we obtain The range of values of the temporal step size k for which is also shown in the profile of the amplification factors shown in Figure 16 and Figure 17 given that and The profile is shown both for as well as . It can be deduced from the two profiles in Figure 16 and Figure 17 that
Figure 16.
Plot of vs. k vs. of Scheme 1 for Numerical Experiment 2. The spatial step size
Figure 17.
Plot of vs. k vs. of Scheme 1 for Numerical Experiment 2. The spatial step size
6.2. Consistency of Scheme 1 for Numerical Experiment 2
We use Taylor’s series expansion about in order to determine its order of accuracy. We obtain
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 and , respectively. The solution profiles are shown in Figure 18. These are compared with exact solution The profile of absolute errors is also presented at and . Figure 19 displays the absolute error profiles of Scheme 1 for Numerical Experiment 2. We compare and errors in Table 4.
Figure 18.
Plot of exact and numerical profiles (using Scheme 1) vs. x at times and using and (Numerical Experiment 2).
Figure 19.
Plot of the absolute error vs. x using Scheme 1 for Numerical Experiment 2. The spatial and temporal step sizes are and , respectively.
Table 4.
and errors for various k when when Scheme 1 is employed to approximate Numerical Experiment 2 at and .
6.4. Dispersion Analysis
We consider We use same techniques as in Section 3.4 The amplification factor is determined from the relation
The relative phase error (RPE) is defined [27]
We obtain plots of the arguments of vs. in Figure 20. For values of the graphs of the arguments of both and are very close to each other, as illustrated in Figure 20a.
Figure 20.
Plot of the arguments of amplification factors of Scheme 1 for Numerical Experiment 2 with the spatial and temporal step sizes and , respectively.
7. Scheme 2 for Numerical Experiment 2
Wang et al. [14] proposed
For the approximation of the nonlinear KdV equation we adapt the method in Equation (30) to approximate Equation (15). The proposed method is
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
for all and . The amplification factor satisfies
where
and
The roots of this equation are
We fix and obtain plots of and , vs. vs. k in Figure 21 and Figure 22, respectively, and we deduce that the stability region is
Figure 21.
Plot of vs. k vs. of Scheme 2 for Numerical Experiment 2. The spatial step size
Figure 22.
Plot of vs. k vs. of Scheme 2 for Numerical Experiment 2. The spatial step size
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 to get
We note that
and we therefore obtain
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 and , respectively. The solution profiles are shown in Figure 23. These are compared with exact solution The profile of absolute errors are presented at and . Figure 24 displays the absolute error profiles. We display and errors in Table 5.
Figure 23.
Plot of exact and numerical profiles (using Scheme 2) vs. x at times and using and (Numerical Experiment 2).
Figure 24.
Plot of the absolute error vs. x using Scheme 2 for Numerical Experiment 2. The spatial and temporal step sizes are and , respectively.
Table 5.
and errors for various k when when Scheme 2 is employed to approximate Numerical Experiment 2 at and .
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 and the argument of exact amplification factor are quite close to each other for .
Figure 25.
Plot of the arguments of amplification factors of Scheme 2 for Numerical Experiment 2 with the spatial and temporal step sizes and , respectively.
8. Scheme 3 for Numerical Experiment 2
Wang et al. [1] proposed the scheme
for the numerical approximation of the nonlinear equation. We adapt this scheme to solve the linear dispersive equation . The scheme for Equation (15) is
In explicit form, after some index shift, this equation is written as
8.1. Stability of Scheme 3 for Numerical Experiment 2
We substitute by and after simplification we get
This is a quadratic equation in , written as where
and
The amplification factors are, therefore, obtained as and . The stability constraint for the scheme is computed from each of these amplification factors using for The stability region is deduced from Figure 26 and Figure 27 as .
Figure 26.
Plot of vs. k vs. w of Scheme 3 for Numerical Experiment 2. The spatial step size
Figure 27.
Plot of vs. k vs. of Scheme 3 for Numerical Experiment 2. The spatial step size
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 . After simplification, we get
We obtain
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 and , respectively. The solution profiles are shown in Figure 28. These are compared with exact solution The profile of absolute errors is also presented at and . Figure 29 displays the absolute error profiles for the multisymplectic scheme. We display and errors in Table 6.
Figure 28.
Plot of exact and numerical profiles (using Scheme 3) vs. x at times and using and (Numerical experiment 2).
Figure 29.
Plot of the absolute error vs. x using Scheme 3 for Numerical Experiment 2. The spatial and temporal step sizes are and , respectively.
Table 6.
and errors for various k when when Scheme 3 is employed to approximate Numerical Experiment 2 at and .
8.4. Dispersion Analysis
The arguments of the numerical amplification factors 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.
Figure 30.
Plot of the arguments of amplification factors of Scheme 3 for Numerical Experiment 2 with the spatial and temporal step sizes are and , respectively.
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, , is narrower compared to the stability region 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 and 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 and 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:
| KdV | Korteweg–de-Vries |
| PDE | Partial differential equation |
References
- Wang, H.P.; Wang, Y.S.; Hu, Y.Y. An explicit scheme for the KdV equation. Chin. Phys. Lett. 2008, 25, 2335. [Google Scholar]
- 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]
- 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]
- 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]
- Washimi, H.; Taniuti, T. Propagation of ion-acoustic solitary waves of small amplitude. Phys. Rev. Lett. 1966, 17, 996. [Google Scholar] [CrossRef]
- Hasegawa, A.; Matsumoto, M. Optical solitons in fibers. In Optical Solitons in Fibers; Springer: Berlin/Heidelberg, Germany, 2003; pp. 41–59. [Google Scholar]
- Lax, P.D. Development of singularities of solutions of nonlinear hyperbolic partial differential equations. J. Math. Phys. 1964, 5, 611–613. [Google Scholar] [CrossRef]
- 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]
- 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]
- 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]
- 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]
- Sanz-Serna, J.M.; Calvo, M.P. Numerical Hamiltonian Problems; Courier Dover Publications: Mineola, NY, USA, 2018. [Google Scholar]
- 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]
- Wang, Y.S.; Wang, B.; Xin, C. Multisymplectic Euler box scheme for the KdV equation. Chin. Phys. Lett. 2007, 24, 312. [Google Scholar]
- 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]
- Brauer, K. The Korteweg-de Vries Equation: History, Exact Solutions, and Graphical Representation; University of Osnabrück: Osnabrück, Germany, 2000. [Google Scholar]
- 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]
- 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]
- Durran, D.R. Numerical Methods for Wave Equations in Geophysical Fluid Dynamics; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2013; Volume 32. [Google Scholar]
- Morton, K.; Mayers, D. Numerical solution of partial differential equations. J. Fluid Mech. 1998, 363, 349. [Google Scholar]
- 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]
- Niyogi, P. Introduction to Computational Fluid Dynamics; Pearson Education India: Delhi, India, 2006. [Google Scholar]
- 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]
- 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]
- 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]
- 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]
- 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]
- Wazwaz, A.M. An analytic study on the third-order dispersive partial differential equations. Appl. Math. Comput. 2003, 142, 511–520. [Google Scholar] [CrossRef]
- Appadu, A.R.; Kelil, A.S. On Semi-Analytical Solutions for Linearized Dispersive KdV Equations. Mathematics 2020, 8, 1769. [Google Scholar] [CrossRef]
- 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]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).