Abstract
In the paper, a newly developed three-point fourth-order compact operator is utilized to construct an efficient compact finite difference scheme for the Benjamin–Bona–Mahony–Burgers’ (BBMB) equation. The detailed derivation is carried out based on the reduction order method together with a three-level linearized technique. The conservative invariant, boundedness and unique solvability are studied at length. The convergence is proved by the technical energy argument and induction method with the optimal convergence order \(\mathcal {O}(\tau ^2+h^4)\) in the sense of the maximum norm. The stability under mild conditions can be achieved based on the uniform boundedness of the numerical solution. The present scheme is very efficient in practical computation since only a linear system needs to be solved at each time. The extensive numerical examples verify our theoretical results and demonstrate the scheme’s superiority when compared with state-of-the-art those in the references.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
The classical nonlinear Benjamin–Bona–Mahony (BBM) equation can describe the unidirectional propagation of weakly nonlinear long waves in the presence of dispersion as follows
where \(\varepsilon >0\) and \(\mu \) are the parameters with the same order [8]. Compared with the well-known Korteweg-de Vries (KdV) equation
(1.1) is proposed as an analytically advantageous alternative. Both (1.1) and (1.2) are derived from the Green–Naghdi equations and they are asymptotically equivalent in the limit \(\varepsilon =\mu \rightarrow 0\) since \(u_{xxx} = u_{xxt}+\mathcal {O}(\mu )\), but enjoying different properties, see [26] for a detailed explanation. In many applications, when the dissipation effect cannot be ignored, \(-\nu u_{xx}\) have to be added and (1.1) becomes the known BBMB equation as
which describes the propagation of small-amplitude long waves in a nonlinear dispersive media. For the well-posedness, existence, uniqueness, regularity results, long time dynamics and the numerical simulation for (1.3) and its special cases are referred to [22, 28, 31, 32, 38, 41, 46, 47, 52].
In this paper, we are aimed to develop and analyze a high-order conservative difference approximation for the BBMB equation as
with the periodic boundary condition
and the initial-value condition
where \(\mu \) and \(\nu \) are positive constants, \(\gamma \) and \(\kappa \) are parameters and L denotes the spatial period.
In order to explore the solutions and their properties of the BBMB equation, researchers racked their wits to develop various analytical methods for seeking the exact solutions of the BBMB equation. For instance, Yin et al. [50] employed the weighted energy method to investigate the time decay rate of traveling waves of Cauchy problem of the BBMB equation. Estévez et al. [16] studied the travelling wave solutions for the generalized BBMB equation systematically by using the factorization technique. Besse et al. [11] developed the exact artificial boundary conditions for the linearized BBM equation. Al-Khaled et al. [3] considered solitary wave solutions of the BBMB equation by using the decomposition method. Fakhari et al. [17] approximated the nonlinear BBMB equation’s explicit solutions with high-order nonlinear term via the homotopy analysis method. Tari et al. [45] used He’s methods to obtain the explicit solutions of the BBMB equation and compared them with the exact solutions. Ganji et al. [18] solved the special form solutions of the BBMB equation by the Exp-Function method. Based on the well-known tanh-coth method, Cesar et al. [13] obtained new periodic soliton solutions for the generalized BBMB equation. Noor et al. [34] constructed some new solitary solutions of the BBM equation by using the exp-function method. Abbasbandy [1] used the first integral method to find some new exact solutions for the BBMB equation and Bruzón [12] studied some nontrivial conservation laws for the BBMB equation with the help of the multiplier’s method.
On the other hand, many attempts have been carried out to approximate the solutions for the BBMB equation and its simplified version numerically. For example, Guo [20] proposed a Laguerre–Galerkin method to solve the BBM equation on a semi-infinite interval. Omrani [35] considered a fully discrete Galerkin method for the BBM equation. Soon afterward, Omrani et al. [2, 36] used the Crank–Nicolson-type implicit finite difference method to solve the BBMB equation with the second-order accuracy in maximum norm. They [21] further employed the Galerkin finite element method in space combined with the implicit Euler method in time for solving the generalized BBMB equation. Berikelashvili et al. [9] explored a linearized difference scheme for solving the regularized long-wave equation, which can be viewed as a special case of the BBMB equation with \(\nu =0\). They [10] also analyzed the convergence of a type of difference scheme for the generalized BBMB equation. Based on the meshless method of radial basis functions, Dehghan et al. [14] solved a high dimensional generalized BBMB equation. They [15] further considered the interpolating element-free Galerkin technique for the high dimensional BBMB equation. Zarebnia et al. [40, 51] used the collocation method and spectral meshless radial point interpolation, respectively, to solve the BBMB equation. Similar idea applied to BBMB is referred to the work in [4]. Based on the hybridization of Lucas and Fibonacci polynomials, Oruç et al. [37] solved the generalized BBMB equation in one and two dimension, respectively. Kundu et al. [25] proposed a semidiscrete Galerkin method and discussed stabilization results for the semidiscrete scheme with an optimal error estimate. Kundu et al. [24] discussed global stabilization results for the semidiscrete solution based on finite element method. With the help of Legendre wavelets and quasilinearization method, Kumar et al. [23] simulated multidimensional BBMB equation. Zhang et al. [53] established two linearized implicit difference schemes for the BBMB equation, in which the convergence orders both were two.
A review of all the above numerical methods reveals that higher-order algorithms are still scarce, let alone the uniform error estimate of the higher-order algorithms. To the authors’ best knowledge, only Mohebbi and Faraz [33] propose a fourth-order algorithm for solving the BBMB equation with five points in space and obtains the infinite error estimate. However, when deal with the points near the boundary, ghost points or fictitious points are requisite. In addition, the stability in [33] is also missing. In order to avoid the difficulty caused by the discretization near the boundary points, we first developed three-point fourth-order compact technique for the Burgers’ equation in [48] and further extended it to the BBMB equation in current paper. Moreover, we extensively and deeply studied the convergence and stability of the compact difference scheme for the BBMB equation.
The compact difference scheme as one of the most practical numerical techniques has the significant advantages over standard finite difference methods. Specifically: (1) A smaller matrix stencil generates higher order accuracy; (2) A larger stability domain allows larger spatial and temporal step sizes; (3) It owns a better resolution for high frequency waves; (4) It is more suitable for long time integrations; (5) Fewer boundary point makes the discretization of the boundary easier.
The compact difference scheme in the present paper not only possess all of these advantages, but also does not incur an extra computational cost. Furthermore, our scheme is linearly implicit with the exact well-defined conservative invariant. The main difficulties for the high-order approximation of the strong nonlinear term \(uu_x\) involving the optimal convergence and stability are completely overcome based on the newly discovered compact operator, which makes the numerical analysis feasible and toilless.
The main contribution lies in that the maximum error estimate and the optimal convergence order \(O(\tau ^2+h^4)\) are obtained. The proof of the convergence in a pointwise sense is novel and technical. Compared our numerical results with those calculated in [33] is carried out, which demonstrates the effectiveness and advantage of the present algorithm. Moreover, the stability under very mild conditions in the maximum norm is also proved in detail.
The rest of the paper is organized as follows. In Sect. 2, some requisite notations and useful lemmas are presented. A three-level linearized compact difference scheme is derived in Sect. 3 based on the reduction order method. Conservative invariant and boundedness are obtained in Sect. 4. The unique solvability is proved strictly in Sect. 5. The uniform convergence and stability are proved at length in Sect. 6, which are the main part of the paper. Several numerical experiments are presented in Sect. 7 followed by a conclusion in Sect. 8.
2 Notations and Lemmas
We firstly introduce some useful notations. Take two positive integers M, N, let \(h=L/M\), \(\tau =T/N\). Denote \(x_{i}= ih,\; i\in Z\), \(t_{k}=k\tau , \;0\leqslant k \leqslant N\), \(t_{k+\frac{1}{2}}=(t_{k}+t_{k+1})/2\); \(\varOmega _{h}=\{x_{i}\,|\,x_{i}=ih,\; i\in Z\}\), \(\varOmega _{\tau }=\{t_{k}\,|\,t_{k}=k\tau ,\; 0\leqslant k\leqslant N\}\), \(\varOmega _{h\tau }=\varOmega _{h}\times \varOmega _{\tau }\). For any grid function \(u=\{u_{i}^{k}\,|\,i\in Z,\;0\leqslant k\leqslant N\}\) defined on \(\varOmega _{h\tau }\), following the notations in [6, 7, 53], we introduce
Denote
For any grid functions u, \(w\in \mathcal {U}_{h}\), define the discrete inner product \((u,w)=h\sum \limits _{i=1}^{M} u_{i}w_{i}\) and the corresponding norms (seminorm)
Moreover, define the function (see [19])
Lemma 2.1
[44] For any grid functions u, \(w\in \mathcal {U}_{h}\), we have
Lemma 2.2
For any grid functions u, \(w\in \mathcal {U}_{h}\), we have
Proof
The first and second equalities come from [42]. We will prove the third equality briefly below. According to the notations defined previously, we have
From the definition of the discrete inner product and the second equality, we have
This completes the proof. \(\square \)
Lemma 2.3
Let \(f(x)\in \mathrm {C}^{5}[x_{i-1},x_{i+1}]\) and denote \(F_{i}=f(x_{i})\) and \(G_{i}=f''(x_{i})\), then we have
Proof
The first and third equalities come from [48] and [43], respectively. The second equality is immediately obtained by Taylor expansion. We omit it here for sake of brevity. \(\square \)
Lemma 2.4
For any grid functions u, v, \(S\in \mathcal {U}_{h}\), satisfying
we have
Proof
Taking the inner product of (2.1) with u and noticing (2.2)–(2.3), we have
With the help of Lemma 2.1, we have
Combining (2.1) with Lemmas 2.1–2.2, we have
This completes the proof. \(\square \)
Lemma 2.5
For any grid functions u, \(v\in \mathcal {U}_{h}\), we have
Proof
Using the definition of the operator, we directly have
This completes the proof. \(\square \)
3 Derivation of Compact Difference Scheme
Denote
Let \(v=u_{xx}\), then the problem (1.4)–(1.6) is equivalent to
Define the grid functions
With the help of Lemma 2.3, we have
Considering (3.2) at the point \((x_{i},t_{\frac{1}{2}})\), with the help of Taylor expansion and (3.6)–(3.8), we have
where
with \(c_{1}\) being a positive constant. Analogously, considering (3.2) at the point \((x_{i},t_{k})\), we have
where
with \(c_{2}\) being a positive constant.
Again considering (3.3) at the point \((x_{i},t_{k})\), we have
where
with \(c_{3}\) being a positive constant.
Noticing the initial and boundary conditions (3.4)–(3.5), we have
Omitting the small terms \(Q_{i}^{k}\) and \(R_{i}^{k}\), replacing the grid functions \(U_{i}^{k}\), \(V_{i}^{k}\) by \(u_{i}^{k}\), \(v_{i}^{k}\) in (3.9), (3.11), (3.13), respectively, and noticing the initial and boundary conditions (3.15)–(3.16), then we construct a finite difference scheme for (3.2)–(3.5) as follows
4 Conservative Invariant and Boundedness
Theorem 4.1
Suppose \(\{u_{i}^{k},\;v_{i}^{k}\,|\,1\leqslant i\leqslant M,\;0\leqslant k\leqslant N\}\) is the solution of (3.17)–(3.21). Then it holds that
where
Proof
Taking the inner product of (3.17) with \(u^{\frac{1}{2}}\) and applying Lemma 2.2, we have
Averaging (3.19) with superscripts \(k=0\) and \(k=1\), it holds
With the help of (4.4) and summation by parts, we have
Applying (2.4) and (2.6) in Lemma 2.4, we have
Substituting (4.5)–(4.6) into (4.3), we have
Rearranging the above formula, we have
Taking the inner product of (3.18) with \(u^{\bar{k}}\) and applying Lemma 2.2, we have
Averaging (3.19) with superscripts \(k-1\) and \(k+1\), it holds
With the help of (3.19), (4.9), summation by parts and similar to the derivation of (4.5), we have
Applying (2.4) and (2.6) in Lemma 2.4, we have
Substituting (4.10)–(4.11) into (4.8), we have for \(1\leqslant k\leqslant N-1\)
Consequently
By the recursion, we have
\(\square \)
Remark 4.1
(4.1) and (4.2) can be rewritten as
Remark 4.2
Combining (4.7) with (4.12), we have
5 Uniqueness
Theorem 5.1
The finite difference scheme (3.17)–(3.21) is uniquely solvable.
Proof
From (3.19)–(3.21), it is easy to know that \(u^{0}\) and \(v^{0}\) have been determined. From (3.17) and (3.19), a linear system of equations about \(u^1\) and \(v^1\) can be obtained with respect to the first level. Now we consider its homogenous linear system of equations
Taking the inner product of (5.1) with \(u^{1}\), and combining Lemma 2.2 with (5.2), we have
Applying (2.5) in Lemma 2.4, we have
Substituting (5.4)–(5.5) into (5.3) and a calculation shows that
Thus, it holds that
Therefore, (5.1) and (5.2) only allow zero solutions, which implies that (3.17) and (3.19) determine \(u^{1}\), \(v^{1}\) uniquely.
Now we suppose that \(u^{k-1}\), \(u^{k}\), \(v^{k-1}\), \(v^{k}\) have been determined. From (3.18)–(3.19), a linear system of equations with respect to \(u^{k+1}\) and \(v^{k+1}\) is obtained. Now we consider the homogenous system of equations as follows
Taking the inner product of (5.6) with \(u^{k+1}\) and applying Lemma 2.2 and (5.7), we have
Combining (2.5) in Lemma 2.4 and noticing \(S^k=0\), we have
Substituting (5.9)–(5.10) into (5.8), we have
Then it holds that
Therefore, (5.6) and (5.7) only allow zero solutions, which implies that (3.18)–(3.19) determine \(u^{k+1}\) and \(v^{k+1}\) uniquely. By the mathematical induction, this completes the proof. \(\square \)
6 Convergence and Stability
6.1 Convergence
Let \(h_0\) and \(\tau _0\) be two positive constants. Denote
We have the following convergence result.
Theorem 6.1
(Convergence) Suppose \(\{U_{i}^{k}\), \(V_{i}^{k}\,|\, 1\leqslant i\leqslant M,\;0\leqslant k\leqslant N\}\) is the solution of (3.9), (3.11), (3.13), (3.15), (3.16) \(\{u_{i}^{k}\), \(v_{i}^{k}\,|\, 1\leqslant i\leqslant M,\;0\leqslant k\leqslant N\}\) is the solution of (3.17)–(3.21). Denote \(e_{i}^{k}=U_{i}^{k}-u_{i}^{k},\; f_{i}^{k}=V_{i}^{k}-v_{i}^{k},\; 1\leqslant i\leqslant M,\; 0\leqslant k\leqslant N\), when \(h\leqslant h_0\), \(\tau \leqslant \tau _0\) and \(\tau ^{2}+h^{4}\leqslant 1/c_{10}\), we have the error estimate
Proof
Subtracting (3.9), (3.11), (3.13), (3.15), (3.16) from (3.17)–(3.21), the error system is written as
Denote
From (3.1), we have
Taking the inner product of (6.3) with \(f^{k}\), we have
Thus, we have
Then the proof is divided into three main steps.
Step 1: Establish the error estimate in the first level. Taking the inner product of (6.1) with \(\delta _{t}e^{\frac{1}{2}}\), we have
From (6.4), we have
Applying (2.4) in Lemma 2.4, we have
According to the definition of \(\psi (u,v)_{i}\) and applying Lemma 2.2, we have
Moreover, combining (6.7) and Lemma 2.5, we have
Noticing (6.4) and applying Lemma 2.2, we have
Applying (2.4) and (2.6) in Lemma 2.4, we have
and
Substituting (6.11)–(6.18) into (6.10), we have
When \(h\leqslant h_{0}\), \(\tau \leqslant \tau _{0}\), we have
Taking \(k=0\) in (6.9), substituting the result into (6.19) and using (3.10), (3.14), we have
Rearranging the above term, we have
Consequently
From (6.6), (6.9) and (6.20), we have
Step 2: Establish the error estimate for \(2\leqslant k \leqslant N\) by induction method. Taking the inner product of (6.2) with \(\varDelta _{t}e^{k}\), we have
Now we suppose that \(|e^{k}|_{1}\leqslant c_{10}(\tau ^{2}+h^{4})\) holds for \(k=1,2,\cdots ,l\) with \(1\leqslant l\leqslant N-1\). When \((\tau ^{2}+h^{4})\leqslant 1/c_{10}\), using (6.7)–(6.9), we have
Using (6.3) and applying (2.4) in Lemma 2.4, we have (\(1\leqslant k\leqslant l\))
Noticing that
and applying Lemma 2.5, we have
Combining (6.7), (6.25), (6.26) with (6.30), we have
Similarly, it is concluded that
Combining (6.7), (6.27) and (6.28), we have for \(1\leqslant k\leqslant l\)
In addition, applying Cauchy-Schwarz inequality, we have
Moreover, it holds for \(1\leqslant k\leqslant l\)
and
Substituting (6.29), (6.31)–(6.35) into (6.23), we have
Simplifying and rearranging (6.36), then using (3.12) and (3.14), we have
when \(h\leqslant h_{0}\), \(\tau \leqslant \tau _{0}\) for \(1\leqslant k\leqslant l\). Thanks to
we have
Combining (6.37) with (6.38), we have
According to the Gronwall inequality, when \(2c_{8}\tau /\nu \leqslant 1/3\), we have
From (6.22), when \(h\leqslant h_{0}\), we have
A combination of (6.6), (6.38) and (6.39), we have
By the mathematical induction, we have
Step 3: Step 1 adding Step 2 yields the final result. Combining (6.4), (6.21) and (6.40), we have
This completes the proof. \(\square \)
Remark 6.1
6.2 Stability
In the below, we will discuss the stability of the difference scheme (3.17)–(3.21). Here we only consider the stability with respect to the initial value. Suppose \(\{\hat{u}_i^k, \ \hat{v}_i^k\,|\, 1 \leqslant i \leqslant M,\; 0 \leqslant k \leqslant N\}\) is the solution of
Denote
Subtracting (3.17)–(3.21) from (6.41)–(6.45), we have
Similar to the proof of Theorem 6.1, we can obtain the stability with respect to the initial value.
Theorem 6.2
(Stability) Suppose \(\{\eta _i^k, \ \xi _i^k\,|\, 1 \leqslant i \leqslant M,\; 0 \leqslant k \leqslant N\}\) is the solution of (6.46)–(6.50), then there are positive constants \(h_{0}\) and \(\tau _{0}\), such that when \(h\leqslant h_{0}\), \(\tau \leqslant \tau _{0}\), we have
where \(c_{11}\) only depends on the coefficients of (1.4)–(1.6), the final time T and the spatial period L, however independent of the temporal step size h and spatial step size \(\tau \).
7 Numerical Experiments
In the section, we will implement several numerical examples to verify the effectiveness of our scheme and the correctness of theoretical results.
When the exact solution is known, we define the discrete error in the \(L^{\infty }\)-norm as follows
where \(U_{i}^{k}\) and \(u_{i}^{k}\) represent the exact solution and the numerical solution, respectively. Furthermore, denote the spatial and temporal convergence orders, respectively, as
When the exact solution is unknown, we use the posterior error estimation to testify the convergence orders in temporal direction and spatial direction, respectively. For sufficient small h, we denote
and for sufficient small \(\tau \), we denote
Example 1
We first consider the following BBMB equation (see [37])
where
The initial condition is determined by the exact solution \(u(x,t)=e^{t}\sin \pi x\) with the period \(L=2\).
The numerical results are reported in Tables 1–2 and Figs. 1–2.
In Table 1, we fix the temporal step-size \(\tau =1/5000\), meanwhile, reduce the spatial step-size h half by half \((h=1/4\), 1/8, 1/16, 1/32, 1/64). As we can see, the spatial convergence order approaches to four order approximately, which is consistent with our convergence results.
In Table 2, we fix the spatial step-size \(h=1/50\), meanwhile, reduce the temporal step-size \(\tau \) half by half \((\tau =1/20\), 1/40, 1/80, 1/160, 1/320). We observe that the temporal convergence order approaches to two order in maximum norm.
Compared our numerical results with those in [33] from Tables 1 and 2, we find our scheme is more efficient and accurate.
Moreover, in order to verify the stability of the difference scheme (3.17)–(3.21), we have drawn the stable error curves in Fig. 1. For each curve, we fixed different temporal step-size \((\tau =1/8\), 1/16, 1/32, 1/64, 1/128) by reducing the spatial step-size h half by half \((h=1/2\), 1/4, 1/8, 1/16, 1/32, 1/64). We observe that the spatial error in maximum norm approaches to a fixed value since the numerical errors mainly come from the discretization in time, which verifies the difference scheme (3.17)–(3.21) is almost unconditional stable. In Fig. 2, the numerical panorama for u(x, t) and numerical profiles are displayed, which further demonstrate the high accuracy of our scheme in practical simulation.
Example 2
Then, we consider the following BBMB equation
with the initial condition
where the exact solution is unknown and the period \(L=50\).
The numerical results are showed in Tables 3, 4, 5 and 6 and Fig. 3 with \(\mu =1\) and \(\nu =1\).
Firstly, we fix the temporal step-size \(\tau =1/2000\), in the meantime, decrease the spatial step-size h half by half (\(M=20,40,80,160,320,640\)). As we can see from Table 3, the spatial convergence orders approach to fourth order for both schemes. However, our scheme is more accurate than that in the reference [33].
Next, we fix the spatial step-size \(h=1/2\), and then reduce the temporal step-size \(\tau \) half by half. The maximum norm error and the temporal convergence orders are listed in Table 4. The temporal convergence order approaches to \(\mathcal {O}(\tau ^{2})\) approximately. However, the difference scheme in [33] is less than two and the accuracy is far from enough. We further refine the spatial grid (fixed step size \(h=1/100\)) and decrease the temporal step-size \(\tau \) half by half again in Table 5, though both schemes can achieve orders two, our scheme (3.17)–(3.21) is still better than that in [33] with respect to the accuracy. Combining Tables 4 and 5, we conclude that our scheme is more robust and stable that the scheme in [33], which illustrates the superiority of our scheme.
To further verify the performance of the numerical scheme (3.17)–(3.21) more rigorously, we test the energy conservation invariants (4.12) with different \(\mu \) and \(\nu \). The conservation invariants of \(E^n\) at different time are demonstrated in Table 6. It is easy to see from Table 6 that the three-point four-order compact difference scheme can keep the conservative invariant even for the very small parameters, which demonstrate that our numerical scheme is stable and robust. The result is also consistent with Theorem 4.1.
Example 3
Finally, we consider a nonlinear BBMB equation
where \(F(u) = 1/4\cdot (1-u^2)^2\), \(x_l = -50\), \(x_r=50\), \(\mu =\gamma =\kappa = \nu =1\). The initial condition is \(\phi (x)=\frac{\sqrt{6}}{3}\mathrm{sech}^2\left( \frac{x}{3}\right) \).
Since the above problem is nonlinear, we use Newton linearized technique (see [53]) for practical implementation. In order to demonstrate the superiority of the present scheme, we compare it with the numerical result in [53] with the period boundary condition. The corresponding convergence orders in spatial direction and temporal direction are reported in Tables 7 and 8, respectively. We see from Table 7 that the numerical errors are better than those in [53] along with the spatial direction. According to the results in Tables 7 and 8, we know that the convergence orders are two in time and four in space for difference scheme (3.17)–(3.21), which are consistent with our theoretical results.
The numerical surfaces and the numerical curves are simulated by difference scheme (3.17)–(3.21) in Figs. 4, 5. Our scheme is much more accurate than that in [53] and clearly depicts the evolutionary process of the solution.
8 Conclusions
In the work, incorporating the reduction order method, a three-point four-order compact difference scheme and a three-level linearized technique, we propose and analyze a linearized implicit, fourth-order compact scheme for the BBMB equation. We have obtained the unique solvability, conservative invariant, and boundedness. Moreover, we have rigorously proved the maximum error estimation and stability. Compared presented scheme with those in the references, the novel fourth-order compact scheme reliably improve the computational accuracy. Moreover, presented scheme can be extended to the BBMB equation with homogeneous boundary conditions without any difficulty. In the future, extended our technique and idea to other nonlocal or nonlinear evolution equations [5, 6, 27, 29, 30, 39, 49] will be our on-going project.
Data Availability Statement
All data or codes generated or used during the study are available from the corresponding author by request.
References
Abbasbandy, S., Shirzadi, A.: The first integral method for modified Benjamin–Bona–Mahony equation. Commun. Nonlinear SCI 15, 1759–1764 (2010)
Achouri, T., Khiari, N., Omrani, K.: On the convergence of difference schemes for the Benjamin–Bona–Mahony (BBM) equation. Appl. Math. Comput. 182, 999–1005 (2006)
Al-Khaled, K., Momani, S., Alawneh, A.: Approximate wave solutions for generalized Benjamin–Bona–Mahony–Burgers equations. Appl. Math. Comput. 171, 281–292 (2005)
Arora, S., Jain, R., Kukreja, V.K.: Solution of Benjamin–Bona–Mahony–Burgers equation using collocation method with quintic Hermite splines. Appl. Numer. Math. 154, 1–16 (2020)
Baffet, D., Hesthaven, J.S.: High-order accurate local schemes for fractional differential equations. J. Sci. Comput. 70, 355–385 (2017)
Bao, W., Cai, Y.: Uniform error estimates of finite difference methods for the nonlinear Schrödinger equation with wave operator. SIAM J. Numer. Anal. 50(2), 492–521 (2012)
Bao, W., Carles, R., Su, C., Tang, Q.: Regularized numerical methods for the logarithmic Schrödinger equation. Numer. Math. 143, 461–487 (2019)
Benjamin, T.B., Bona, J.L., Mahony, J.J.: Model equations for long waves in nonlinear dispersive systems. Philos. Trans. R. Soc. Lond. Ser. A 272, 47–78 (1972)
Berikelashvili, G., Mirianashvili, M.: A one-parameter family of difference schemes for the regularized long-wave equation. Georgian Math. J. 18, 639–667 (2011)
Berikelashvili, G., Mirianashvili, M.: On the convergence of difference schemes for generalized Benjamin–Bona–Mahony equation. Numer. Methods Part. Differ. Equ. 30(1), 301–320 (2014)
Besse, C., Mésognon-Gireau, B., Noble, P.: Artficial boundary conditions for the linearized Benjamin–Bona–Mahony equation. Numer. Math. 139, 281–314 (2018)
Bruzón, M.S., Garrido, T.M., de la Rosa, R.: Conservation laws and exact solutions of a generalized Benjamin–Bona–Mahony–Burgers equation. Chaos Solut. Fract. 89, 578–583 (2016)
Cesar, A., Gómez, S., Alvaro, H.S., Bernardo, A.F.: New periodic and soliton solutions for the generalized BBM and Burgers-BBM equations. Appl. Math. Comput. 217, 1430–1434 (2010)
Dehghan, M., Abbaszadeh, M., Mohebbi, A.: The numerical solution of nonlinear high dimensional generalized Benjamin–Bona–Mahony–Burgers equation via the meshless method of radial basis functions. Comput. Math. Appl. 68, 212–237 (2014)
Dehghan, M., Abbaszadeh, M., Mohebbi, A.: The use of interpolating element-free Galerkin technique for solving 2D generalized Benjamin–Bona–Mahony–Burgers and regularized long-wave equations on non-rectangular domains with error estimate. J. Comput. Appl. Math. 286, 211–231 (2015)
Estévez, P.G., Kuru, S., Negro, J., Nieto, L.M.: Travelling wave solutions of the generalized Benjamin–Bona–Mahony equation. Chaos Solut. Fract. 40, 2031–2040 (2009)
Fakhari, A., Domairry, G., Ebrahimpour, A.: Approximate explicit solutions of nonlinear BBMB equations by homotopy analysis method and comparison with the exact solution. Phys. Lett. A 368, 64–68 (2007)
Ganji, Z.Z., Ganji, D.D., Bararnia, H.: Approximate general and explicit solutions of nonlinear BBMB equations by Exp-Function method. Appl. Math. Model. 33, 1836–1841 (2009)
Guo, B.Y.: Difference Methods for Partial Differential Equations. Science Press, Beijing (1988)
Guo, B.Y., Shen, J.: Laguerre–Galerkin method for nonlinear partial differential equations on a semi-infinite interval. Numer. Math. 86, 635–654 (2000)
Kadri, T., Khiari, N., Abidi, F., Omrani, K.: Methods for the numerical solution of the Benjamin–Bona–Mahony–Burgers equation. Numer. Methods Part. Differ. Equ. 24(6), 1501–1516 (2008)
Kinami, S., Mei, M., Omata, S.: Convergence to diffusion waves of the solutions for Benjamin–Bona–Mahony–Burgers equations. Appl. Anal. 75(3–4), 317–340 (2000)
Kumar, K.H., Jiwari, R.: Legendre wavelets based numerical algorithm for simulation of multidimensional Benjamin–Bona–Mahony–Burgers and Sobolev equations. Comput. Math. Appl. 80, 417–433 (2020)
Kundu, S., Pani, A.K.: Global stabilization of BBM-Burgers’ type equations by nonlinear boundary feedback control laws: theory and finite element error analysis. J. Sci. Comput. 81, 845–880 (2019)
Kundu, S., Pani, A.K., Khebchareon, M.: Asymptotic analysis and optimal error estimates for Benjamin–Bona–Mahony–Burgers’ type equations. Numer. Methods Part. Differ. Equ. 34(3), 1053–1092 (2018)
Lannes, D.: The water waves problem: mathematical analysis and asymptotics. In: Mathematical Surveys and Monographs, Vol. 188. AMS (2013)
Li, C.: Linearized difference schemes for a BBM equation with a fractional nonlocal viscous term. Appl. Math. Comput. 311, 240–250 (2017)
Li, X., Xing, Y., Chou, C.: Optimal energy conserving and energy dissipative local discontinuous Galerkin methods for the Benjamin–Bona–Mahony equation. J. Sci. Comput. 83, (2020). https://doi.org/10.1007/s10915-020-01172-6
Lyu, P., Vong, S.: A high-order method with a temporal nonuniform mesh for a time-fractional Benjamin–Bona–Mahony equation. J. Sci. Comput. 80, 1607–1628 (2019)
Lyu, P., Vong, S.: A nonuniform L2 formula of Caputo derivative and its application to a fractional Benjamin–Bona–Mahony-type equation with nonsmooth solutions. Numer. Methods Part. Differ. Equ. 36(3), 579–600 (2020)
Mei, M.: Large-time behavior of solution for generalized Benjamin–Bona–Mahony–Burgers equations. Nonlinear Anal. 33, 699–714 (1998)
Mei, M.: \(L_q\)-Decay rates of solutions for Benjamin–Bona–Mahony–Burgers equations. J. Differ. Equ. 158, 314–340 (1999)
Mohebbi, A., Faraz, Z.: Solitary wave solution of nonlinear Benjamin–Bona–Mahony–Burgers equation using a high-order difference scheme. Comput. Appl. Math. 36, 915–927 (2017)
Noor, M.A., Noor, K.I., Al-Said, A.E.A.: Some new solitonary solutions of the modified Benjamin–Bona–Mahony equation. Comput. Math. Appl. 62, 2126–2131 (2011)
Omrani, K.: The convergence of fully discrete Galerkin approximations for the Benjamin–Bona–Mahony (BBM) equation. Appl. Math. Comput. 180, 614–621 (2006)
Omrani, K., Ayadi, M.: Finite difference discretization of the Benjamin–Bona–Mahony–Burgers equation. Numer. Methods Part. Differ. Equ. 24(1), 239–248 (2008)
Oruç, Ö.: A new algorithm based on Lucas polynomials for approximate solution of 1D and 2D nonlinear generalized Benjamin–Bona–Mahony–Burgers equation. Comput. Math. Appl. 74, 3042–3057 (2017)
Prado, R., Zuazua, E.: Asymptotic expansion for the generalized Benjamin–Bona–Mahony–Burger equation. Differ. Integr. Equ. 15(12), 1409–1434 (2002)
Shen, X., Zhu, A.: A Crank–Nicolson linear difference scheme for a BBM equation with a time fractional nonlocal viscous term. Adv. Differ. Equ. 355, (2018). https://doi.org/10.1186/s13662-018-1815-4
Shivanian, E., Jafarabadi, A.: More accurate results for nonlinear generalized Benjamin–Bona–Mahony–Burgers (GBBMB) problem through spectral meshless radial point interpolation (SMRPI). Eng. Anal. Bound. Elem. 72, 42–54 (2016)
Stanislavova, M.: On the global attractor for the damped Benjamin–Bona–Mahony equation. Discrete Contin. Dyn. S-A 35, 824–832 (2005)
Sun, H., Sun, Z.-Z.: On two linearized difference schemes for Burgers’ equation. Int. J. Comput. Math. 92(6), 1160–1179 (2015)
Sun, Z.-Z.: Compact difference schemes for heat equation with Neumann boundary conditions. Numer. Methods Part. Differ. Equ. 25(6), 1320–1341 (2009)
Sun, Z.-Z.: Numerical Methods of Partial Differential Equations, 2nd edn. Science Press, Beijing (2012)
Tari, H., Ganji, D.D.: Approximate explicit solutions of nonlinear BBMB equations by He’s methods and comparison with the exact solution. Phys. Lett. A 367, 95–101 (2007)
Wang, M.: Long time dynamics for a damped Benjamin–Bona–Mahony equation in low regularity spaces. Nonlinear Anal. 105, 134–144 (2014)
Wang, M.: Sharp global well-posedness of the BBM equation in \(L^p\) type Sobolev spaces. Discrete Contin. Dyn. S-A 36, 5763–5788 (2016)
Wang, X.P., Zhang, Q., Sun, Z.-Z.: The pointwise error estimates of two energy-preserving fourth-order compact schemes for viscous Burgers’ equation. Adv. Comput. Math. 47, 23 (2021). https://doi.org/10.1007/s10444-021-09848-9
Wang, Y.M.: A high-order linearized and compact difference method for the time-fractional Benjamin–Bona–Mahony equation. Appl. Math. Lett. 105, 106339 (2020). https://doi.org/10.1016/j.aml.2020.106339
Yin, H., Chen, S., Jin, J.: Convergence rate to traveling waves for generalized Benjamin–Bona–Mahony–Burgers equations. Z. Angew. Math. Phys. 59, 969–1001 (2008)
Zarebnia, M., Parvaz, R.: On the numerical treatment and analysis of Benjamin–Bona–Mahony–Burgers equation. Appl. Math. Comput. 284, 79–88 (2016)
Zhang, L.: Decay of solutions of generalized Benjamin–Bona–Mahony–Burger equations in \(n\)-space dimensions. Nonlinear Anal. Theory Methods Appl. 25, 1343–1396 (1995)
Zhang, Q., Liu, L., Zhang, J.: The numerical analysis of two linearized difference schemes for the Benjamin–Bona–Mahony–Burgers equation. Numer. Methods Part. Differ. Equ. 36, 1790–1810 (2020)
Acknowledgements
The first author thanks Professor Zhi-zhong Sun for his helpful discussion. The authors are very grateful to the anonymous referees for their constructive comments and valuable suggestions, which greatly improved the original manuscript of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Qifeng Zhang was supported in part by Natural Science Foundation of China (No. 11501514), in part by the Natural Sciences Foundation of Zhejiang Province under Grant LY19A010026, in part by project funded by China Postdoctoral Science Foundation under Grant 2018M642131 when he studied in Southeast University.
Rights and permissions
About this article
Cite this article
Zhang, Q., Liu, L. Convergence and Stability in Maximum Norms of Linearized Fourth-Order Conservative Compact Scheme for Benjamin–Bona–Mahony–Burgers’ Equation. J Sci Comput 87, 59 (2021). https://doi.org/10.1007/s10915-021-01474-3
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10915-021-01474-3