- Research
- Open access
- Published:
A second-order Fourier pseudospectral method for the generalized regularized long wave equation
Advances in Difference Equations volume 2015, Article number: 339 (2015)
Abstract
We present a second-order in time linearized semi-implicit Fourier pseudospectral scheme for the generalized regularized long wave equation. Based on the consistency analysis, the nonlinear stability and the convergence of the scheme are discussed, along with the a priori assumption and an aliasing error control estimate. The numerical examples demonstrate the features of the proposed scheme, including the convergence order, conservative properties, and the evolution of the unstable wave.
1 Introduction
In this paper, we consider the following initial-boundary value problem for the Generalized Regularized Long Wave (GRLW) equation:
where \(u_{0}(x)\) is the given known function, \(p\ge2 \) is an integer and α, β are constants. The RLW equation (\(p=2\)) is originally introduced to describe the behavior of the undular bore by Peregrine [1] and plays a major role in the study of nonlinear dispersive waves, such as shallow water waves and ion acoustic plasma waves. Mathematical theory for this equation was presented in [2, 3] and the references therein. Due to nonlinearity of the GRLW equation, only a few exact solutions exist [4]. Therefore, the higher accurate numerical methods are essential for capturing physical phenomena accurately. Many efforts have been made to develop numerical method for solving this equation, such as the variational iteration method [5], the finite difference method [6–10], the Fourier pseudospectral method [11, 12], the Galerkin element method [13, 14], the Adomian decomposition method [15, 16], the collocation method [17, 18], and others.
In addition to the nonlinearity, another interesting feature of the GRLW equation is that it has both stable and unstable solitary-wave solutions when \(p\ge5\) [19]. Bona et al. [20] proposed a high-order accurate pseudospectral scheme to approximate the solutions of the GRLW equation and to examine the dynamics of the suitably perturbed solitary waves. In their experiments, they found that unstable solitary waves may evolve into several, stable solitary waves, and the positive initial data does not need the feature of the solitary waves for the long-time asymptotic behavior. Also, similar discussions for the generalized Benjamin-Bona-Mahony equation can be found in [21].
On the other hand, spectral and pseudospectral methods have been developed rapidly in the past two decades. They have been applied to numerical simulations in many fields because of its high accuracy. For instance, the stability analysis for linear time-dependent problems can be found in [22, 23]. Some pioneering works for nonlinear equations were initiated by Maday and Quarteroni [24] for steady-state spectral solutions. Also note the analysis of one-dimensional conservation laws by Tadmor [25, 26], semi-discrete viscous Burgers’ equation and Navier-Stokes equations by Weinan [27], Fourier spectral projection method for Navier-Stokes equations by Guo and Zou [28], fully discrete (discrete both in space and time) pseudospectral method applied to viscous Burgers’ equation and Boussinesq equation in [29, 30] by Gottlieb and Wang, and Fourier spectral approximation to the flow of liquid crystals [31] by Du et al., and so forth.
In this paper, we present a fully discrete semi-implicit Fourier pseudospectral method for the GRLW equation, with periodic boundary condition on \([x_{L}, x_{R}]\). This periodicity assumption is reasonable if the solution decays exponentially outside \([x_{L},x_{R}]\) for large enough \(x_{L}\) and \(x_{R}\). For the theoretical analysis, the convergence analysis follows the combination of consistency analysis for the proposed scheme and the stability analysis for the numerical error function. The consistency analysis shows that such an approximate solution satisfies the numerical scheme with an \(O(\Delta t^{2})\) accuracy in time and a spectral accuracy in space. Based on the a priori estimate, a detailed error estimate is performed by an aliasing error control estimate for the nonlinear terms, and the a priori assumption can be recovered. Additionally, various numerical experiments are given to verify the theoretical analysis, wave interaction and evolution of the unstable solitary wave, respectively.
The remainder of the paper is organized as follows. In Section 2, we review the Fourier pseudospectral method and present a second-order in time linearized semi-implicit Fourier pseudospectral scheme for the GRLW equation. In Section 3, the consistency analysis is discussed in detail, and the stability and convergence analysis are reported in Section 4. Finally, we present we present many numerical simulations related to different types of the GRLW equations in Section 5.
2 Numerical scheme
2.1 Reviews of pseudospectral approximation
For \(f(x) \in L^{2} (\Omega)\), \(\Omega= (0,L)\), with Fourier series
its truncated series is defined as the projection onto the space \(\mathcal{B}^{N}\) of trigonometric polynomials in x of degree up to N, given by
To obtain a pseudospectral approximation at a given set of points, an interpolation operator \(\mathcal{I}_{N}\) is introduced. Given a uniform numerical grid with \((2N+1)\) points and a discrete vector function f where \({\mathbf{f}}_{i} = f(x_{i}) \), for each spatial point \(x_{i}\). The Fourier interpolation of the function is defined by
where the \((2N+1)\) pseudospectral coefficients \((\hat{f}_{c}^{N})_{l}\) are computed based on the interpolation condition \(f(x_{i}) = ( \mathcal{I}_{N} f )(x_{i})\) on the \(2N+1\) equidistant points. These collocation coefficients can be efficiently computed using the fast Fourier transform (FFT). Note that the pseudospectral coefficients are not equal to the actual Fourier coefficients; the difference between them is known as the aliasing error. In general, \(\mathcal{P}_{N} f(x) \ne\mathcal{I}_{N} f(x) \), and even \(\mathcal{P}_{N} f(x_{i}) \ne\mathcal{I}_{N} f(x_{i}) \), except of course in the case that \(f \in\mathcal{B}^{N}\).
The Fourier series and the formulas for its projection and interpolation allow one to easily take derivative by simply multiplying the appropriate Fourier coefficients \((\hat {f}_{c}^{N})_{l} \) by \(2 l \pi\mathrm{i}/L\). Furthermore, we can take subsequent derivatives in the same way, so that differentiation in physical space is accomplished via multiplication in Fourier space. As long as f and all is derivatives (up to mth order) are continuous and periodic on Ω, the convergence of the derivatives of the projection and interpolation is given by
where d denotes the space dimension, \(\| f \|_{L^{2}}=(\int_{\Omega} f^{2}(x)\,dx)^{1/2}\), and
For more details, see the discussion of approximation theory by Canuto and Quarteroni [32].
For any collocation approximation to the function \(f(x)\) at the points \(x_{i}\)
one can define discrete differentiation operator \(\mathcal{D}_{N}\) operating on the vector of grid values \({\mathbf{f}} = f(x_{i}) \). In practice, one may compute the collocation coefficients \((\hat{f_{c}^{N})}_{l}\) via FFT, and then multiply them by the correct values (given by \(2 l \pi\mathrm{i}/L\)) and perform the inverse FFT. Alternatively, we can view the differentiation operator \(\mathcal{D}_{N}\) as a matrix, and the above process can be seen as a matrix-vector multiplication. The same process is performed for the second \(\partial_{x}^{2}\), where the collocation coefficients are multiplied by \(( - 4 \pi^{2} l^{2}/L^{2} )\). In turn, the differentiation matrix can be applied for multiple times, i.e., the vector f is multiplied by \(\mathcal{D}^{2}_{N} \).
Since the pseudospectral differentiation is taken at a point-wise level, a discrete \(L^{2}\) norm and inner product need to be introduced to facilitate the analysis. Given any periodic grid functions f and g (over the numerical grid), we note that these are simply vectors and define the discrete \(L^{2}\) inner product and norm
The following summation by parts (see [29]) will be of use:
2.2 Numerical scheme
Since the standard second-order Adams-Bashforth extrapolation formula involves the numerical solutions at time node points \(t^{n}\), \(t^{n-1}\), with the well-known coefficients \(3/2\) and \(-1/2\), respectively, we propose a linearized semi-implicit Fourier pseudospectral scheme with second-order accuracy in time as follows:
Remark 2.1
Sloan [11] investigated the RLW equation (\(p=2\)) by a three-level explicit Fourier pseudospectral scheme. But numerical tests indicated that the high accuracy in space can only be matched in time with the second-order leap-frog discretization under a strict stability condition. Furthermore, the formal stability and the convergence analysis were not pursued in his work.
Remark 2.2
Although another implicit Fourier pseudospectral scheme discussed by Djidjeli et al. [12] for the GRLW equation can ensure the unconditionally stability, a set of nonlinear algebraic equations has to be solved by a linearizing pseudospectral scheme by the Taylor expansion. Similar to the previous statement, a detailed theoretical analysis also was not given.
3 Consistency analysis
Without loss of generality, C denotes a general positive constant, which may have different values in different occurrences. Meanwhile, some function spaces and norms are defined as follows:
and corresponding semi-discrete versions are given by
Similarly, other norms used in the next text can be defined and we omit the details.
3.1 Truncation error analysis for \(U_{N}\)
Denote by \(u_{e}\) the exact solution and
From (2.2), the following approximation estimates are clear:
and
which comes from the fact that \(\partial_{t}^{k} U_{N}\) is the truncation of \(\partial_{t}^{k} u_{e}\) for any \(k \ge0\), since projection and differentiation can commute,
Consequently, the following linear estimates are straightforward:
Again, a discrete \(\|\cdot\|_{2}\) estimate should be given in the local truncation derivation. Note that
where the fact \(\mathcal{I}_{N} \partial_{t} U_{N}=\partial_{t} U_{N}\) is applied, since \(\partial_{t} U_{N} \in\mathcal{B}^{N}\). The first term on the right-hand side of (3.8) has an estimate obtained from (3.5), and it follows from (2.2) that the second term also is bounded by
Therefore, from (3.5), (3.8), and (3.9), we have
Similarly, we have
For the nonlinear term, from the expansion \(\partial_{x} u^{p}_{e} = p u_{e}^{p-1}(u_{e})_{x}\) and
we get
in which the 1D Sobolev embedding is used.
Furthermore, from (2.2), the following interpolation error also can be derived in a similar analysis:
Then the combination of (3.12), (3.13), and (3.14) yields
Thus, the bounds on the projection error and its derivatives indicate that
with \(\|\tau_{1} \|_{2}\le Ch^{m}\), since \(u_{e}\) is the exact solution.
3.2 Truncation error analysis in time
For simplicity of presentation, we assume \(T = K \Delta t\) with an integer K. Our approach is based upon the following simple, but fundamental estimates [33].
Lemma 3.1
[33]
For \(f \in H^{3} (0,T)\), we have
with \(\tau^{t} f ^{n} = \frac{f^{n+1} - f^{n}}{\Delta t} - f' (t^{n+1/2})\), for \(0 \le m \le2\), where C only depends on T, \(\|{ \cdot }\|_{l^{2} (0,T)}\) is a discrete \(L^{2}\) norm (in time) given by \(\|{g}\|_{l^{2} (0,T)} = \sqrt{\Delta t \sum_{n=0}^{K-1} (g^{n})^{2}}\).
Lemma 3.2
[33]
For \(f \in H^{2} (0,T)\), we have
where C only depends on T.
For the approximate solution \(U_{N}\), define its vector grid function \(U^{n}=\mathcal{I}U_{N}\) as its interpolation: \(U^{n}_{i}=U^{n}_{N}(x_{i},t^{n})\).
Theorem 3.1
For any fixed time T, assume that the problem (1.1)-(1.3) possesses a unique solution \(u_{e}\) such that \(u_{e} \in L^{\infty}(0,T;H^{m+1})\cap H^{3}(0,T;H^{2})\). Let \(U_{N}\) be the approximation solution and U be its discrete interpolation. Then we have
where \(\tau^{k}\) satisfies
in which C only depends on the regularity of the exact solution \(u_{e}\).
Proof
According to Lemma 3.1, letting \(m=2\), we have
with \(\|\tau_{2}\|_{l^{2}(0,T)}\le C \Delta t^{2} \|U_{N}(\cdot)\| _{H^{3}(0,T)}\le C\Delta t^{2} \|u_{e}\|_{H^{3}(0,T)}\). In turn, an application of a discrete summation in Ω yields
Using a similar argument, we also can arrive at
which leads to
Since \((\frac{3}{2}U_{N}^{n}-\frac{1}{2}U_{N}^{n-1}) \in\mathcal{B}^{N}\), the following result is valid:
where \(\mathcal{I}\) is the discrete operator of the continuous function at fixed points. Also, one can observe that
and denote
An application of Lemma 3.2 also yields
As a result, the combination of (3.26)-(3.29) implies that
For the nonlinear term, let
First, we have the following estimate:
Similar to (3.27), one can get
which leads to
where the estimate (2.2) is applied in the last step. Meanwhile, using the Hölder inequality, the Sobolev imbedding, and the first- and the second-order time derivative of \(U^{p}_{N}\), we can get
With the same analysis above of the term \(\|\tau_{4}\|_{2}\), the direct estimate of \(\|\tau_{5}\|_{2}\) is given as follows:
Therefore, the second order in time consistency of the approximation solution U is obtained. With the truncation error analysis of \(U_{N}\), we can get the result (3.21), in which \(\tau=\mathcal{I}_{N} (\tau_{1}+\tau_{2}+\beta\tau_{3}+\tau_{4}+\alpha\tau_{5})\). This completes the detailed consistency analysis. □
4 Stability and convergence
Let \(e^{n}_{i}=U^{n}_{i}-u^{n}_{i}\), and denote by \(u^{n}_{N}\in B^{N}\), \(e^{n}_{N}\in B^{N}\) the continuous versions of the numerical solution \(u^{n}\) and \(e^{n}\), with the interpolation formula given by (2.1), respectively.
The following lemma is critical to our analysis and enables us to obtain an \(H^{m}\) bound of the interpolation of the nonlinear term (for detailed proof, see [29]).
Lemma 4.1
[29]
For any \(f \in\mathcal{B}^{pN}\) (with p an integer) in dimension d, we have
Moreover, the following preliminary estimate also will be used in the later analysis.
Lemma 4.2
At any time step \(t^{k}\), \(k\ge0\), we have
Proof
From the Poincaré inequality, we have
Since \(U^{k}_{N}, u^{k}_{N} \in\mathcal{B}^{N}\), \(e^{k}_{N}=U^{k}_{N}- u^{k}_{N} \in\mathcal {B}^{N}\) holds, which also shows that
On the other hand, we recall that the solution of the GRLW equation (1.1) is mass conservative:
for \(\forall t > 0\). Considering \(U_{N}\) is the projection of \(u_{e}\) into \(\mathcal{B}^{N}\), we have
for \(\forall t > 0\). Conversely, the numerical scheme (2.6) is mass conservative: \(\overline{u^{k}}:=h\sum_{i=0}^{N-1}u_{i}^{k}=\overline {u^{0}}\). For \(U^{k}_{N}\in\mathcal{B}^{N}\), one can get
Owing to the spectral accuracy in space for the numerical error function at each time step, we obtain
which is equivalent to
Hence, substituting (4.4) and (4.5) into (4.3) yields the inequality (4.2). □
Suppose the constructed approximation solution has a \(W^{1,\infty}\) bound,
i.e.,
for any \(n\ge0\), which comes from the regularity of the constructed solution.
Now, we present the main result of this paper.
Theorem 4.1
For any fixed time T, assume that the exact solution \(u_{e}\) for the GRLW equations (1.1)-(1.3) satisfies \(u_{e} \in L^{\infty}(0,T;H^{m+1})\cap H^{3}(0,T;H^{2})\). Denote by \(u_{\Delta t,h}\) the continuous extension of the fully discrete numerical solution computed by the proposed scheme (2.6). Then, as \(\Delta t,h\rightarrow0\), we have the following convergence result:
provided that the time step Δt and the space grid size h are bounded by given constants. Note that the convergence constant C̃ also depends on the exact solution and the fixed time T.
Proof
We have an a priori \(H^{1}\) assumption up to time step \(t^{n}\).
Assume that the numerical error function has an \(H^{1}\) bound at time steps \(t^{n}\), \(t^{n-1}\),
which yields directly the following results:
where a 1-D Sobolev embedding was used in the last step.
Subtracting (2.6) from (3.20), we have
For convenience, denote
Taking a discrete \(L^{2}\) inner product of (4.10) with \(2e^{n+1}\), we get
The first term on the left side of (4.13) and the truncation error term can be handled in a straightforward way as follows:
in which a discrete Cauchy inequality is used in the last inequality. Similarly, for the first term on the right side of (4.13), one can get
Next, we discuss nonlinear terms on the right-hand side of (4.13) in turn.
For the nonlinear term \(\mathcal{NLT}_{1}\), noting that
we have
Since \(e^{n}_{N} (U^{n}_{N})^{k} (u^{n}_{N})^{p-1-k} \in\mathcal{B}^{pN}\), an application of Lemma 4.1 yields
Moreover, a detailed expansion for \(\partial_{x} e^{n}_{N} (U^{n}_{N})^{k} (u^{n}_{N})^{p-1-k}\) indicates that
which can be obtained by repeated application of the Sobolev embedding, the Hölder inequality, and the Young inequality. Substituting the bound (4.6) for the constructed solution \(U_{N}\) and the a priori assumption (4.9) into (4.21), respectively, we get
Consequently, it follows from (4.19), (4.20), and (4.22) that
for any \(0\le k \le p-1\), that is,
with \(C_{6}=C_{5}(C_{2}^{p-1}+C_{3}^{p-1}+1)\sqrt{p}\).
Obviously, a similar analysis can be applied to \(\mathcal{NLT}_{2}\) and we have
From (4.24) and (4.25), one can get
From the result above, the nonlinear inner product can be analyzed as
in which \(C_{7}=\alpha C_{6} C_{1}^{2} \) and Lemma 4.2 are applied.
Substituting (4.14), (4.15), (4.16), (4.17), (4.27) into (4.13) indicates that
Summing in time gives
Here \(C_{8}=(3+2C_{7})\), and the choice of \(C_{7}\) satisfies with \((2+2C_{7})/(3+2C_{7})\le\beta\). Note that we use the fact \(\|e^{0}\| _{H^{1}_{h}}\le h^{m}\), due to the collocation spectral approximation of the initial data. As a result, an application of discrete Gronwall inequality leads to the following convergence result:
where \(\tilde{C}=Ce^{\frac{1}{2}C_{8} T}\).
Recovery of the \(H^{1}\) a priori bound:
With the help of \(l^{\infty}(0,T;H^{1})\) error estimate (4.30), we can see the a priori estimate (4.8) is also valid for the numerical error function \(e_{N}\) at time step \(t^{n+1}\), provided that
Finally, a combination of (4.31) and the classical projection (3.2) yields (4.8). The proof of Theorem 4.1 is completed. □
Remark 4.1
One well-known challenge in the nonlinear analysis of pseudospectral scheme comes from the aliasing error. This work avoids an application of the inverse inequality but adopts an novel aliasing error control estimate given by Lemma 4.1. So we could obtain the estimate for its discrete \(H^{1}\) norm.
5 Numerical experiments
The single solitary-wave solution of (1.1) is
where
and c, \(x_{0}\) are arbitrary constants and \(p \ge2\) is an integer. The corresponding initial function can be rewritten
5.1 Propagation of single solitary wave
Here we take \(x_{0} = 0\), \(\alpha=\frac{1}{2}\), \(\beta=1\), \(x_{L}=-30\), \(x_{R}=30\), and \(c =1.5\) in (5.1) and (5.2). Choose \(N=128\) and \(\Delta t=0.01\) to investigate the dynamics of a single solitary wave. The profile of a single solitary waves for the GRLW equation with \(p=2\) and \(p=8\) from time \(t =0\) to 6 are depicted in Figure 1. It can be seen that the solitary wave moves to the right unchanged in which the solitary wave propagates in a stable fashion. Moreover, while p increases, the speed velocity of the wave decreases and the amplitude increases, as time increases.
5.2 Accuracy tests
5.2.1 Spectral accuracy in space
To investigate the accuracy in space, we take \(\Delta t=10^{-3}\) so that the temporal numerical error is negligible. \(x_{L}\), \(x_{R}\), α, β, and c are defined as in Section 5.1. With grid sizes from \(N=16\) to 64 in increment of 4, we solve (2.6) up to time \(T=5\) for \(p=2,3,4\), respectively. The discrete norm \(\|\cdot\|_{2}\) of numerical errors at \(T=5\) is given in Figure 2, which shows apparently the spatial spectral accuracy is verified.
5.2.2 Second-order accuracy in time
For exploring the temporal accuracy, we fix spatial resolution as \(N=1{,}024\) so that the numerical error is dominated mainly by the temporal ones. With a sequence of time step sizes \(\Delta t=0.1, 0.05, 0.025, 0.0125, 0.00625\), we also compute the numerical errors at \(T=5\) for \(p=2,4,6\), respectively, and the results are presented in Table 1 in which a second-order in time accuracy is shown clearly.
5.2.3 Conservation properties
As stated in [34, 35], the GRLW equation has three conservative laws related to mass, momentum and energy, respectively. In particular, for \(p =2\), it reduces to the regularized long wave (RLW) equation. The invariants are given by
and the corresponding discrete quantities are computed for the numerical scheme as follows:
Take \(\Delta t=0.05\) and \(\Delta t=0.025\) with \(N=128\) and \(c=\frac {4}{3}\). \(x_{L}\), \(x_{R}\), α, β are also defined as in Section 5.1. The invariants \(\mathcal{I}_{1}\), \(\mathcal{I}_{2}\), and \(\mathcal{I}_{3}\) up to time \(T =16\) are given in Table 2.
Another special case of the GRLW equation is the modified regularized long wave (MRLW) equation with \(p =3\). Similar to the quantities for the RLW equation, the MRLW equation also has the following conservative laws:
and
In Table 3, we presented that the discrete mass, momentum and energy of the numerical solutions for the MRLW equation. From both tables, it is obvious that the proposed scheme is satisfactorily conservative.
5.3 Interaction of two GRLW solitary waves
Next, we study the interaction of two well-separated solitary waves having different amplitudes and traveling in the same direction. The initial condition is given by
For \(p=2\), we choose \(c_{1}=1.3\), \(c_{2}=1.8\), \(x_{1}=15\), \(x_{2}=35\), \(\Delta t=0.1\), \(N=128\), and α, β are defined as in Section 5.1. Figure 3 and Figure 4 show the interaction of two solitary solutions of the GRLW equation. Meanwhile, we briefly plot two figures to show the simulation for \(p=6\) at \(t=0.1\) and \(t=12\) in Figure 5.
From these figures, it can be seen that an oscillation of small amplitude, trailing behind the solitary waves, was observed. This is in accordance with the observations of Soliman [5]. Moreover, the solitary-wave interaction in Figure 5 for \(p=6\) shows clearly some evidence of an additional disturbance, which may be due to the fact that the GRLW equation are not completely integrable.
5.4 Unstable solitary-wave solution
Souganidis and Strauss [19] derived the following result for the GRLW equation:
(a) if \(p<5\), then \(u(x,t)\) is \(H^{1}\)-stable;
(b) if \(p > 5\), then \(u(x,t)\) is \(H^{1}\)-stable for \(c > c_{p}\), and \(H^{1}\)-unstable for \(1 \le c \le c_{p}\), where
and \(\sigma=\frac{2}{p-1}\). Note that \(c_{p} = 1\) when \(p =5 \) and \(c_{p} > 1\) for \(p \ge5\). Certainly, for \(p=8\), the critical speed is \(c_{p} =1.300914\).
Similar to the experiments in [20], the high accuracy scheme we proposed also can simulate this phenomenon, that is, the evolution of solutions emanating from initial data which are perturbations of exact analytical solutions of (1.1) with \(p > 5\) and \(1 \le c \le c_{p}\) are featured, where the initial data is a perturbed solitary wave,
and γ is called the perturbation parameter; it is used to effect an amplitude perturbation. According to [19], when \(\gamma\ge1\), the solution emanating from the initial data will resolve itself into one or more solitary waves, sometimes accompanied by additional structure. Therefore, mainly attention will be given to evolutions starting with ũ for \(\gamma> 1\).
Since unstable solutions have a speed c in the range \(1 \le c \le c_{p} \) and \(c_{p}\) is near 1, we simulate only one of long-time outcomes for perturbed unstable solitary-wave solutions, with \(\alpha=\beta=1\), \(p=8\), \(c=1.01\). To achieve such an outcome, the initial unstable solitary data had to be given enough energy to produce two stable solitary waves. Hence, we choose \(\gamma=1.5\). As seen in Figure 6 and Figure 7, the outcomes illustrate how such a process occurred in the experiment.
5.5 Maxwellian initial condition
A more interesting test case for the GRLW equation is to investigate the long-time asymptotic properties by initiating the wave motion with a Gaussian pulse, namely, the so-called Maxwellian initial condition [34]. We take \(\alpha=\frac{1}{2}\), \(\beta=1\) for RLW equation (\(p=2\)) and \(\alpha=\frac{1}{3}\), \(\beta=1\) for MRLW equation (\(p=3\)), respectively, with initial data
In a numerical test, let \(N=256\), \(\Delta t=0.01\), \(x_{L}=-40\), and \(x_{R}=200\). The numerical solution at different times for both cases are drawn in Figure 8 and Figure 9 for the RLW equation, and Figure 10 and Figure 11 for the MRLW equation, respectively. Furthermore, the quantities for three conservative laws are presented in Table 4. As seen from these results, an initial date with Maxwellian disturbance will resolve into a sequence of solitary waves in the stable range ordered by amplitude with the larger waves in the front, followed by a dispersive tail. Clearly, the presented results are consistent with earlier work on this topic in [34, 35].
6 Conclusion
In this paper, we propose a fully discrete Fourier pseudospectral scheme for the GRLW equation with the second-order in time accuracy. The theoretical analysis, such as consistence analysis, stability and convergence analysis are presented in detail. Due to the linearized semi-implicit property, the algorithm can be implemented more effectively. Numerical experiments also verifies the second-order accuracy in time and the spectral accuracy in space. Furthermore, thanks to the high accuracy scheme, the evolution of the unstable solitary wave of the GRLW equation with \(p \ge5\) also be simulated, as established in [19].
References
Peregrine, DH: Long waves on beach. J. Fluid Mech. 27(4), 815-827 (1967)
Benjamin, TB, Bona, JL, Mahony, JJ: Model equations for long waves in nonlinear dispersive systems. Philos. Trans. R. Soc. Lond. A 272(1220), 47-78 (1972)
Miller, JR, Weinstein, MI: Asymptotic stability of solitary waves for the regularized long-wave equation. Commun. Pure Appl. Math. 49(4), 399-441 (1996)
Wazwaz, AM: Analytic study on nonlinear variants of the RLW and the PHI-four equations. Commun. Nonlinear Sci. Numer. Simul. 12(3), 314-327 (2007)
Soliman, AA: Numerical simulation of the generalized regularized long wave equation by He’s variational iteration method. Math. Comput. Simul. 70(2), 119-124 (2005)
Zhang, L: A finite difference scheme for generalized regularized long-wave equation. Appl. Math. Comput. 168(2), 962-972 (2005)
Chang, Q, Wang, G, Guo, B: Conservative scheme for a model of nonlinear dispersive waves and its solitary waves induced by boundary motion. J. Comput. Phys. 93(2), 360-375 (1991)
Zheng, K, Hu, J: High-order conservative Crank-Nicolson scheme for regularized long wave equation. Adv. Differ. Equ. 2013, Article ID 287 (2013)
Hu, J, Zheng, K, Zheng, M: Numerical simulation and convergence analysis of a high-order conservative difference scheme for SRLW equation. Appl. Math. Model. 38(23), 5573-5581 (2014)
Akbari, R, Mokhtari, R: A new compact finite difference method for solving the generalized long wave equation. Numer. Funct. Anal. Optim. 35(2), 133-152 (2014)
Sloan, DM: Fourier pseudospectral solution of the regularized long wave equation. J. Comput. Appl. Math. 36(2), 159-179 (1991)
Djidjeli, K, Price, WG, Twizell, EH, Cao, Q: A linearized implicit pseudo-spectral method for some model equations: the regularized long wave equations. Commun. Numer. Methods Eng. 19(11), 847-863 (2003)
Roshan, T: A Petrov-Galerkin method for solving the generalized regularized long wave (GRLW) equation. Comput. Math. Appl. 63(5), 943-956 (2012)
Achouri, T, Ayadi, M, Omrani, K: A fully Galerkin method for the damped generalized regularized long-wave (DGRLW) equation. Numer. Methods Partial Differ. Equ. 25(3), 668-684 (2009)
Achouri, T, Omrani, K: Numerical solutions for the damped generalized regularized long-wave equation with a variable coefficient by Adomian decomposition method. Commun. Nonlinear Sci. Numer. Simul. 14(5), 2025-2033 (2009)
Kaya, D: A numerical simulation of solitary-wave solutions of the generalized regularized long-wave equation. Appl. Math. Comput. 149(3), 833-841 (2004)
Mokhtari, R, Mohammadi, M: Numerical solution of GRLW equation using Sinc-collocation method. Comput. Phys. Commun. 181(7), 1266-1274 (2010)
Mohammadi, M, Mokhtari, R: Solving the generalized regularized long wave equation on the basis of a reproducing kernel space. J. Comput. Appl. Math. 235(14), 4003-4014 (2011)
Souganidis, PE, Strauss, WA: Instability of a class of dispersive solitary waves. Proc. R. Soc. Edinb. A 114, 195-212 (1990)
Bona, JL, McKinney, WR, Restrepo, JM: Stable and unstable solitary-wave solutions of the generalized regularized long-wave equation. J. Nonlinear Sci. 10(6), 603-638 (2000)
Durán, A, López-Marcos, MA: Numerical behaviour of stable and unstable solitary waves. Appl. Numer. Math. 42(1), 95-116 (2002)
Boyd, J: Chebyshev and Fourier Spectral Methods, 2nd edn. Dover, New York (2001)
Hesthaven, J, Gottlieb, S, Gottlieb, D: Spectral Methods for Time-Dependent Problems. Cambridge University Press, Cambridge (2007)
Maday, Y, Quarteroni, A: Spectral and pseudospectral approximation to Navier-Stokes equations. SIAM J. Numer. Anal. 19(4), 761-780 (1982)
Tadmor, E: Convergence of spectral methods to nonlinear conservation laws. SIAM J. Numer. Anal. 26(1), 30-44 (1989)
Tadmor, E: The exponential accuracy of Fourier and Chebyshev differencing methods. SIAM J. Numer. Anal. 23(1), 1-10 (1986)
Weinan, E: Convergence of Fourier methods for Navier-Stokes equations. SIAM J. Numer. Anal. 30(3), 650-674 (1993)
Guo, BY, Zou, J: Fourier spectral projection method and nonlinear convergence analysis for Navier-Stokes equations. J. Math. Anal. Appl. 282(2), 766-791 (2003)
Gottlieb, S, Wang, C: Stability and convergence analysis of fully discrete Fourier collocation spectral method for 3-D viscous Burgers’ Equation. J. Sci. Comput. 53(1), 102-128 (2012)
Cheng, K, Feng, W, Gottlieb, S, Wang, C: A Fourier pseudospectral method for the ‘good’ Boussinesq equation with second-order temporal accuracy. Numer. Methods Partial Differ. Equ. 31(1), 202-224 (2015)
Du, Q, Guo, B, Shen, J: Fourier spectral approximation to a dissipative system modeling the flow of liquid crystals. SIAM J. Numer. Anal. 39(3), 735-762 (2001)
Canuto, C, Quarteroni, A: Approximation results for orthogonal polynomials in Sobolev spaces. Math. Comput. 38(157), 67-86 (1982)
Baskara, A, Lowengrub, JS, Wang, C, Wise, SM: Convergence analysis of a second order convex splitting scheme for the modified phase field crystal equation. SIAM J. Numer. Anal. 51(5), 2851-2873 (2013)
Mokhtari, R, Ziaratgahi, ST: Numerical solution of RLW equation using integrated radial basis functions. Appl. Comput. Math. 10(3), 428-448 (2011)
Chegini, NG, Salaripanah, A, Mokhtari, R, Isvand, D: Numerical solution of the regularized long wave equation using nonpolynomial splines. Nonlinear Dyn. 69(1-2), 459-471 (2012)
Acknowledgements
The authors are very grateful to both reviewers for carefully reading this paper and their comments, and thank Dr. Cheng Wang (University of Massachusetts, Dartmouth) for his valuable discussion. This work is supported by the Applied Basic Research Project of Sichuan Province (No. 2013JY0096) and the National Natural Science Foundation of China (No. 11202175).
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors conceived of the study, participated in its design and coordination, drafted the manuscript, participated in the sequence alignment, and read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Kang, X., Cheng, K. & Guo, C. A second-order Fourier pseudospectral method for the generalized regularized long wave equation. Adv Differ Equ 2015, 339 (2015). https://doi.org/10.1186/s13662-015-0676-3
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13662-015-0676-3