- Research
- Open Access
- Published:
A reduced Galerkin finite element formulation based on proper orthogonal decomposition for the generalized KDV-RLW-Rosenau equation
Journal of Inequalities and Applications volume 2023, Article number: 104 (2023)
Abstract
This paper investigates reduced-order modeling of the Korteweg de Vries regularized long-wave Rosenau (KdV-RLW-Rosenau) equation using semi- and fully-discrete B-spline Galerkin approximations. The approach involves the application of a proper orthogonal decomposition (POD) method to a Galerkin finite element (GFE) formulation, resulting in a POD GFE formulation with lower dimensions and high accuracy. The error between the reduced POD GFE solution and the traditional GFE solution is analyzed using the Crank-Nicolson method. Numerical examples show that the theoretical conclusions are consistent with the results of the numerical computation, and that the POD method is effective and feasible.
1 Introduction
The study of nonlinear waves is helpful to clarify the law of motion changes of physical systems under nonlinear effects, and to reasonably explain related natural phenomena. Therefore, many models have been proposed to describe their behaviors. In fact, we can find various mathematical descriptions of wave dynamics, such as regular long waves (RLW), Korteweg-de Vries (KdV), and Rosenau equations; see, e.g., [1–3]. Among them Benjamin et al. [1] determined the exact expression of the RLW model under the constraints of initial conditions and boundary conditions and proved the existence and uniqueness of the solution of the RLW model. Bon et al. [4] adopted RLW modeling for small-amplitude long waves on the water surface; As pointed out by Abdulloev et al. [5], an important feature of the RLW problem is that the collision between two solitary waves either produces a sinusoidal solution or secondary solitary waves.
It is worth mentioning that the KdV equation has applications in many fields of physics and is widely used in the description of dynamic effects such as ion acoustics, magnetohydrodynamic waves, and longitudinal astigmatism; see [6–11] for details; moreover, the existence, regularity, and convergence of solutions for KdV-type equations were proved in [12–14]. Recently, Kaya and Aassila in [15] computed explicit solutions to the KdV equation with initial conditions using the Adomian decomposition method. Özer et al. [16] solved the KdV equation by an analytical-numerical method.
Rosenau proposed a new model to solve the KdV equation cannot describe the wave–full-wave and wave–wave interaction, it is called the Rosenau equation, used to describe the dynamic behavior of dense discrete systems; see, e.g., [3, 9]. Later, Zuo [8] solitary waves and periodic solutions of the Rosenau-KdV model were studied. Barreto et al. [17] discussed the existence of solutions of the Rosenau equation and using Galerkin, multipliers, and energy estimation techniques, obtained the Rosenau equation with a plus sign in the advection-like term in the motion domain.
It is known that Rosenau equation adds a dissipative effect term \(u_{xx}\), which is usually called Rosenau-RLW (or Rosenau-Burgers) equation. A study of the Cauchy problem and the stability of traveling or diffusing waves for the Rosenau-RLW equations is given in [18–21]. Particularly, Piao et al. [22] reported the error of quadratic B-spline FEM solution for the Rosenau-RLW equation. Besides, many researchers have solved Rosenau-RLW equation by using different methods, such as B-spline collocation, GFE, finite difference, conservative difference scheme; see, e.g., [24–28].
On the other hand, many scholars have studied the (inviscid) Rosenau-KdV-RLW equation both analytically and numerically. Here are the following examples: Razborova et al. [29] and [30] determined their impulsive and kink (or topological soliton) solutions using sech and tanh ansatzs, and the singular solutions of the same equations using cosech ansatz. In addition to this, Razborova et al. [31] found a third invariant of the (inviscid) Rosenau-KdV-RLW equation under the condition that the mass and energy of the homogeneous boundary conditions are constant Lying symmetry. In addition, Wong saijai et al. used the cubic level method to solve the Rosenau-KdV-RLW equation in [32] and performed an implicit finite difference method for the equation and compared the numerical results obtained with the sine-cosine function approximate. In [33], the inviscid Rosennau-KdV-RLW equations were numerically solved using the pseudo-compact method and the trapezoidal scheme in time. In [34], A. Biswas et al. used the quintic B-spline finite element method, a local-structure preserving technique that includes multi-symplectic and energy- and momentum-preserving procedures [35], a linearly implicit conservative finite difference technique [36], and a local meshless technique and the finite difference method [37].
In this paper, we consider the higher order equation of wave propagation in unidirectional water:
with the initial condition:
and boundary conditions:
where \(f(u)=\alpha u+\frac{\beta}{p+1} u^{p+1}\), \(u(x,t)\), \(t>0\) and \(\Omega \in (0,1)\) denote the (nondimensional) amplitude, time coordinate, and space coordinate of the wave, respectively. δ and ν are positive constants, and α, β, μ, η, θ are arbitrary parameters. \(p\geq 1\) is a positive integer, which makes \(f(u)\) a non-linear term. In equation (1.1a), different types of equations are obtained by assigning appropriate values to the parameters. For example, if \(\mu =\eta =\nu =\theta =0\), \(\alpha =\beta =\delta =1\) and \(p=1\), we can get the RLW equation; if \(\alpha =\mu =\delta =\eta =\nu =0\), \(\beta =\theta =1\) and \(p=1\), we can get the KdV equation; if \(\mu =\delta =\eta =0\), \(\alpha =\beta =\nu =\theta =1\) and \(p=1\), we can get the Rosenau-KdV equation, etc.
Note that solving numerical solutions of nonlinear complex systems requires high storage and CPU costs. Solving complex, turbulent, and chaotic systems remains a daunting task for us, even with optimal mesh generators, discretization schemes, and solution algorithms. Therefore, how to simplify the actual calculation load and save time and resource demand is an important problem. In the simplification process, it is also necessary to ensure that the numerical solution is accurate and efficient enough. In addition, it makes sense to use the reduced-order method if the underlying PDE must be solved multiple times, i.e. under optimal control or in the case of different parameter studies using the same PDE; see, e.g., [38–40].
Actually, among many reduced-order modeling techniques, the most frequently used method is based on a proper orthogonal decomposition (POD) technique. In other words, POD is a technique that provides sufficient approximation to represent fluid flows with fewer degrees of freedom, i.e., low-dimensional models that reduce computing load and save memory requirements(see [41]). Indeed, POD in combination with Galerkin projection has been used for many years to formulate reduced-order modelings for dynamic systems; see, e.g., [23, 42–56].
Compared with the work [57], in which the authors solved solution of the Eq. (1.1a)–(1.1c) with compact method in the domain \((-\infty , +\infty )\), in this article, we will mainly discuss the theoretical analysis and present a quadratic B-spline GFE approximation for Eq. (1.1a)–(1.1c), and further study the reduced-order modeling of Eq. (1.1a)–(1.1c) based on POD GFE approximation.
The remainder of this paper is organized as follows: The existence and uniqueness of weak solutions of Eq. (1.1a)–(1.1c) are proved in Sect. 2. In Sect. 3, the semidiscrete B-spline Galerkin approximation is discussed, and the second-order spatial error estimation in \(L_{\infty}(\Omega )\) norm is derived. In Sect. 4, a fully discrete scheme based on the Crank-Nicolson method is proposed and the second-order accuracy of the scheme in the time direction is proved. In Sect. 5, the method for generating POD basis is introduced and the reduced-order modeling is constructed. The error estimates between the reduced-order modeling solution and the usual GFE solution are deduced below. In Sect. 6, some numerical experiments are given to verify the effectiveness and accuracy of the proposed method. Finally, the conclusion of this paper is given.
2 Existence and uniqueness
For open interval \(\Omega =(0,1)\), \(H^{k}(\Omega )\) be the standard Sobolev space of real-valued functions defined on Ω, so \(H_{0}^{k}= \{v \in H^{k} (\Omega ): \frac{d^{j} v}{d x^{j}}=0 \text{ on } \partial \Omega , j=0,1, \ldots , k-1 \}\), where k is a non-negative integer. Let \(L^{2}(\Omega )\) be the usual Hilbert space on Ω whose scaler product and norm are denoted by \((\cdot ,\cdot )\) and \(\|\cdot \|\), respectively. The inner product of \(L^{2}(\Omega )\) denoted by \((v, w)=\int _{\Omega} v w \,d x\). The norms of \(L^{\infty}(\Omega )\) and \(H^{k}(\Omega )\) are denoted by \(\|\cdot \|_{\infty}\) and \(\|\cdot \|_{k}\).
For simplicity, let \(X=H_{0}^{2}(\Omega )\). At the same time, we assume that u is enough smooth in time. Find \(u(\cdot , t) \in X\) for \(t \in (0, T]\) such that the following weak formulation of equation (1.1a)–(1.1c) is given by:
And let C represent a positive constant independent of step size h and integer k, which may have different values in different cases.
Theorem 1
For \(\forall T>0\), let \(u(x, 0)=u_{0}\in X\), (2.1) exists a unique solution u. Let \(\|u\|_{L^{\infty}(H^{2}(\Omega ))}=\sup_{t \in [0,T]}\|u( \cdot , t)\|_{H^{2}(\Omega )}\), there exists a constant C depending on T so that:
Proof
For the existence of (2.1), let \(\{v_{i}\}_{i=1}^{\infty}\) be a orthogonal basis for X and \(V^{m}=\operatorname{span}\{v_{1}, v_{2}, \ldots , v_{m}\}\). We define \(u^{m}(t)=\sum_{i=1}^{m} g_{i}(t) v_{i}\in V^{m}\). Then for each \(t>0\), it satisfies:
where \(u_{0, m}\) is the orthogonal projection of \(u_{0}\) onto \(V^{m}\) and \(u_{0, m}\) converges to \(u_{0}\) in X. As a result, (2.3) becomes a system of nonlinear ODEs. Thus, using Picard’s existence theorem, there is a positive time \(t_{m} \in (0, T]\) such that the nonlinear system has a unique solution \(u^{m}\) in \((0, t_{m}]\).
The following a priori bounds are needed because we want to prove the global existence using the continuation argument. Setting \(\chi =u^{m}\) in (2.3) and \(u^{m}=0\) on ∂Ω, we have:
From (2.3) and \(\delta , \nu >0\), we get the following result:
Integrating (2.4) from 0 to t gives
Thus, we have:
By using Gronwall’s inequality [16, 17], we get:
For \(t_{m}\in (0,T]\), using Sobolev’s inequality theorem, we get:
Setting \(\chi =u_{t}^{m}\) in (2.3), we get:
Using Young’s inequality \(a b \leq \varepsilon a^{2}+\frac {1}{4 \varepsilon} b^{2}\) with \(a, b \in R\), \(\varepsilon >0\), we have:
where
With (2.5) and (2.8), the inequality (2.7) can be reduced to \(\|u_{t}^{m}\|_{L^{\infty}(H^{2})}\leq C\|u_{0, m}\|_{2}\). Then, let i be fixed and \(m>i\), in \(L^{\infty}(0,T)\) space, there exist the following convergence sequences:
Thus, we have:
The existence of (2.1) follows from the denseness of the basis \(v_{i}\) in X.
For the uniqueness of (2.1), suppose u and v are two solutions of (2.1) and let \(w=u-v\). We get:
As \(\|u\|_{\infty}\) and \(\|v\|_{\infty}\) are bounded, we can get that \(f(u)\) satisfies the Lipschitz condition. Setting \(\chi =w\) in (2.9), we have:
According to Gronwall’s inequality, we have \(\|w(t)\|^{2}+\|w_{x}(t)\|^{2}+\|w_{x x}(t)\|^{2}=0\), that is to say, \(w(t)=0\), i.e., (2.1) has a unique solution. This concludes the proof. □
3 Semi discrete quadratic B-spline Galerkin approximation
The Galerkin finite element method is an effective method for solving differential equations. For fourth-order differential equations, the Galerkin finite element method with B-spline basis functions can achieve desired results. Divide the interval \(\Omega = [0,1]\) uniformly and denote the partition as \(0=x_{0}< x_{1}<\cdots <x_{I}=1\) with \(J_{i}=(x_{i-1}, x_{i})\) and \(h=\max_{1\leq i \leq I}(x_{i}-x_{i-1})\). A subspace with respect to X is defined as follows:
where \(P_{2}(J_{i})\) represents the set of polynomial degree less than or equal to 2 on \(J_{i}\).
For the function \(u_{h}:[0, T] \rightarrow X_{h}\), define the semidiscrete Galerkin approximation of (1.1.b) with initial value \(u_{h}(0) = u_{h 0}\):
where \(u_{h 0}\in X_{h}\) is an appropriate approximation to \(u_{0}\).
Then, the finite element space satisfies the following approximate properties, as shown in [58–60].
Lemma 1
Assume \(v\in H^{4}(\Omega )\cap X\) and \(\chi \in X_{h}\), then there exists a constant C independent of h, such that:
With \(t>0\), we use Picard’s theorem and the continuation argument to prove the existence of a unique solution \(u^{h}\) to (3.1). Let \(\chi =u_{h}\) in (3.1), with the same approach as the proof (2.6), the following priori bounds can be obtained:
To analyze the convergence of the semidiscrete scheme (3.1), we define the bilinear form:
Let Å© be an auxiliary projection of u on subspace \(X_{h}\), as in [15], defined by the following formula:
Now we use the standard error decomposition \(e=u-u_{h}=\xi -\phi \), where \(\xi =u-\tilde{u}\) and \(\phi =u_{h}-\tilde{u}\).
In Lemma 2 below, we obtain error estimates for ξ and \(\xi _{t}\).
Lemma 2
Assume \(u\in H^{4}(\Omega )\cap X\) and \(t\in [0,T]\), then there exists a constant C independent of h, such that
Proof
By (3.4) and lemma 1, we have:
Thus, \(\|u-\tilde{u}\|_{2}\leq C\|u-\chi \|_{2}\leq Ch^{2}\|u\|_{4}\), i.e.,
Let û be the project of \(u_{t}\) on \(X_{h}\) defined as:
Moreover, by (3.2), we know:
From (3.4) and (3.7), it follows
According to (3.8) and (3.9), we get \(\|u_{t}-\tilde{u}_{t}\|_{2}\leq \|u_{t}-\hat{u}\|_{2}+\|\hat{u}- \tilde{u}_{t}\|_{2}\leq Ch^{2}\|u_{t}\|_{4}\). Consequently, it holds
 □
Theorem 2
For \(t\in [0,T]\), assume that \(u_{h 0}\) is the X projection of \(u_{0}\) onto \(X_{h}\), there exists a positive constant C independent of h such that:
Proof
By subtracting (3.1) from (2.1), we can get:
Then, setting \(\chi =\phi \) in (3.10), we obtain:
With the help of the Cauchy-Schwarz inequality and the Lipschitz continuity of f, we get:
By using Lemma 2 and \(u_{h 0}=\tilde{u}_{0}\), it further yields:
Moreover, from the Gronwall’s inequality, it holds
From Sobolev inequality theorem, we can get:
By using Lemma 2 and the triangle inequality, the proof is completed. □
4 Crank-Nicolson scheme
For a smooth function ζ on \([0,T]\), the time step is expressed as k such that \(k=T/N\) with \(t^{n}=nk\), (\(n=0,1,\ldots ,N\)). We denote \(\zeta ^{n}=\zeta (t^{n})\), \(\partial _{t}\zeta ^{n}=\frac{\zeta ^{n}-\zeta ^{n-1}}{k}\), \(\zeta ^{n-\frac{1}{2}}=\frac{\zeta ^{n}+\zeta ^{n-1}}{2}\). The discrete-time finite element Galerkin approximation \(u_{h}^{n}\) of \(u(t^{n})\) is defined as a solution of
where \(u_{h 0}\in X_{h}\) is an appropriate approximation to \(u_{0}\).
The following a priori bound is useful to prove error estimates of the fully-discrete Galerkin-Crank-Nicolson method.
Theorem 3
Let \(u_{h}^{n}\) be a solution of (4.1), for \(n\geq 1\), then there exists a positive constant C, such that:
Proof
Let \(\chi =u_{h}^{n-\frac{1}{2}}\) in (4.1), it holds that:
In fact, \((f(u_{h}^{n-\frac{1}{2}}),u_{hx}^{n-\frac{1}{2}})=0 \), thus:
Then:
By using the Sobolev imbedding theorem, we have completed the proof of (4.2). □
4.1 Existence and uniqueness
To prove the existence of the solution \(u_{h}^{n}\) of (4.1), we use the following variant of the Brouwer fixed point theorem.
Lemma 3
Let H be a finite-dimensional Hilbert space with inner product \((\cdot ,\cdot )_{H}\) and norm \(\|\cdot \|_{H}\). Moreover, let \(\mathcal{F}\) be a continuous mapping of H into itself, such that \((\mathcal{F}(W),W)_{H}>0\), for all \(W\in H\) with \(\|W\|_{H}=\sigma >0\). Then, there exists \(W^{*}\in H\) with \(\|W^{*}\|_{H}\leq \sigma \), satisfying that \(\mathcal{F}(W^{*})=0\).
Theorem 4
Suppose that \(u_{h}^{0},u_{h}^{1},\ldots ,u_{h}^{n-1}\) are given, and then there exists a unique solution \(u_{h}^{n}\), \(n>1\), satisfying (4.1).
Proof
Let continuous mapping \(\mathcal{F}:X_{h}\rightarrow X_{h}\), for \(W,\chi \in X_{h}\), we denote:
Let \(\chi =W\), using Schwarz’s inequality and for appropriate k, it is easy to get that:
For \(\|W\|_{2}=C\|u_{h}^{n-1}\|_{2}+1\), we have \((\mathcal{F}(W),W)>0\). From Lemma 3, it can be seen that there exists \(W^{*}\) such that \(\mathcal{F}(W^{*})=0\). Hence, \(u_{h}^{n}=2W^{*}-u_{h}^{n-1}\) satisfies (4.1). This completes the proof of existence.
Below we prove the uniqueness by induction. Suppose \(u_{h}^{n}\) and \(v_{h}^{n}\) are two solutions of (4.1). Let \(W^{n}=u_{h}^{n}-v_{h}^{n}\), we get:
Let \(W^{n-1}=0\) and choose \(\chi =W^{n-\frac{1}{2}}\), it yields that:
As \(\|u_{h}^{n}\|_{\infty}\) and \(\|v_{h}^{n}\|_{\infty}\) are bounded. we can get:
By (4.3) and (4.4), it can be inferred that:
Using discrete Gronwall’s inequality, for sufficiently small k, we have \(\|W^{n}\|_{2}^{2}=0\). That is to say, \(W^{n}=0\), i.e., \(u_{h}^{n}=v_{h}^{n}\). The proof is completed. □
4.2 Error estimates
Letting \(u^{n}=u(t^{n})\) and using the elliptic projection \(\tilde{u}^{n}\), we denote the error \(e^{n}:=u^{n}-u_{h}^{n}=\xi ^{n}-\phi ^{n}\), where \(\xi ^{n}=u^{n}-\tilde{u}^{n}\), \(\phi ^{n}=u_{h}^{n}-\tilde{u}^{n}\).
Theorem 5
Take \(u_{h 0}=\tilde{u}(0)\), then there exists a positive constant C, for sufficiently small h and k, we have:
Proof
If we subtract the equation (4.1) from (2.1), let \(\rho ^{n}=u_{t}^{n-\frac{1}{2}}-\partial _{t}u^{n}\), and use the auxiliary projection, we have:
Using \(\chi =\phi ^{n-\frac{1}{2}}\) in (4.5), we get that:
Using the Lipschitz condition of f and the boundedness of \(\|u_{h}^{n}\|_{\infty}\) and \(\|u^{n}\|_{\infty}\) yields that:
Then, from (4.6) and (4.7) it follows:
Using discrete Gronwall’s inequality, we have:
From Taylor’s formula, we can get:
Combining (4.8) with (4.9), we obtain:
Consequently, using Lemma 2, the triangle inequality with the Sobolev inequality theorem, we complete the rest of the proof. □
Given the parameters α, β, μ, δ, η, ν, θ, the spatial step h, the time step increment k, and finite element space \(X_{h}\), by solving Eq. (4.1), we can obtain a group of solution ensembles \(\{u_{h}^{n} \}_{n=1}^{N}\) for Eq. (4.1). Thus we choose ℓ (in general, \(\ell \ll N\), for example, \(\ell =32\), \(N=200\)) instantaneous solutions \(u_{h}^{n_{i}}(x)\) (\(1\leq n_{1}< n_{2}<\cdots <n_{\ell}\leq N\)) (they are usually evenly selected) from N solutions instantaneous \(\{u_{h}^{n}(x)\}\) for Eq. (4.1), which are referred to as snapshots.
5 Error estimates for reduced order pod models of generalized KdV-RLW-Rosenau equation
5.1 Generation of POD basis and reduced GFE formulation
Define \(\mathcal{V}\) as the space generated by the snapshots \(\{U_{i} \}_{i=1}^{\ell}\), at least one of which is assumed to be nonzero. For \(u_{h}^{n_{i}}(x)\) (\(1\leq n_{1}< n_{2}<\cdots <n_{\ell}\leq N\)) in Sect. 4, let \(U_{i}(x)=u_{h}^{n_{i}}(x)\) (\(1\leq i\leq \ell \)), such that \(\mathcal{V}=\operatorname{span} (U_{1},U_{2},\ldots ,U_{\ell})\). Let \(\{\psi _{j} \}_{j=1}^{l}\) denote an orthogonal basis of \(\mathcal{V}\) with \(l=\dim \mathcal{V}\), for \((U_{i},\psi _{j})_{X}=( u_{hxx}^{n_{i}},\psi _{jxx})\), each member of the ensemble can be expressed as:
Definition 1
The POD method lies in finding the orthogonal basis \(\psi _{j}\), (\(j=1,2,\ldots ,\ell \)) such that for every d \((1\leq d \leq l)\), the mean square error between the elements \(U_{i}\) (\(1\leq i \leq \ell \)) and corresponding d-th partial sum of (5.1) is minimized on average:
such that:
where \(\|U_{i}\|_{X}^{2}=\|u_{hxx}^{n_{i}}\|_{0}^{2}\). A set of solutions \(\{\psi _{j} \}_{j=1}^{d}\) of (5.2) and (5.3) is called the POD basis of rank d.
The procedure to handle (5.2) and (5.3) can be found in [39, 42, 43, 45, 49]. Then we introduce the positive semi-definite matrix \(G=(G_{i j})_{\ell \times \ell} \in R^{\ell \times \ell}\) with rank l corresponding to the snapshots \(\{U_{i} \}_{i=1}^{\ell}\) by
Proposition 1
Take \(v_{1},v_{2},\ldots ,v_{l}\) the associated orthogonal eigenvectors and let \(\lambda _{1} \geq \lambda _{2}\geq \cdots \ge \lambda _{l}>0\) denote the positive eigenvalues of G. Let \((v_{i})_{j}\) denote the jth component of the eigenvector \(v_{i}\), thus, the POD basis of rank \(d\leq l\) is given by:
Moreover, the following error formula holds:
Let \(X^{d}=\operatorname{span} \{\psi _{1}, \psi _{2}, \ldots , \psi _{d} \}\). Define the Ritz-projection \(P^{h}: X \rightarrow X_{h}\), \(P^{h}| _{X_{h}}=P^{d}: X_{h} \rightarrow X^{d}\) and \(P^{h}: X \backslash X_{h} \rightarrow X_{h}\backslash X^{d}\), for \(U\in X\), we have:
Because of (5.7), the linear operators \(P^{h}\) is well-defined and bounded
Lemma 4
For every d (\(d=1,2, \ldots , l\)) and \(u_{h}^{n_{i}} \in \mathcal{V}\) is the solution of Eq. (4.1), the projection operators \(P^{d}\) satisfies:
Proof
By (5.7), for every \(U \in X\), it follows that:
That is to say:
In fact, if \(U=u_{h}^{n_{i}}\), we have \(P^{h}u_{h}^{n_{i}}=P^{d} u_{h}^{n_{i}} \in X^{d}\), from (5.6) and let \(v_{h}=\sum_{j=1}^{d}(u_{h}^{n_{i}}, \psi _{j})_{X} \psi _{j} \in X^{d} \subset X_{h}\) in (5.13), then (5.9) can be proved.
To prove (5.11), for \(\forall v \in X\), the following variational problem is considered:
hence \(U-P^{h}U\in X\), for \(w\in X\cap H^{4}(\Omega )\), (5.14) has a unique solution, such that
Letting \(v=U-P^{h}U\) in (5.14) and using (5.13) yields that:
Using interpolation theory, taking \(w_{h}=\pi _{h}w\) as interpolation function of w in \(X_{h}\), we have:
that is to say:
If \(U=u_{h}^{n_{i}}\), we have \(P^{h}u_{h}^{n_{i}}=P^{d} u_{h}^{n_{i}} \in X^{d}\), (5.11) can be derived by using (5.17) and (5.9). Then we have to prove (5.10):
As we know, if \(U=u_{h}^{n_{i}}\), \(P^{h}u_{h}^{n_{i}}=P^{d} u_{h}^{n_{i}} \in X^{d}\), it follows that:
(5.10) can be derived by using (5.9), (5.11) and two fundamental inequality \(\sum a_{i}b_{i}\leq \sum a_{i}\sum b_{i}\), \(\sum a_{i}\leq C (\sum a_{i}^{2} )^{\frac{1}{2}}\). The proof is completed. □
Hence, the reduced-order modeling of Eq. (4.1) with initial value \(u_{d}^{0}=u_{d 0}\) is denoted by:
5.2 Error estimates
By using the same procedure as proofs in Sect. 4, we can easily prove that reduced formulation (5.20) has a unique group of solutions \(u_{d}^{n}\in X^{d}\), such that stability holds. Below, we recur to usual finite element method to derive the error estimates for Eq. (5.20).
Theorem 6
Let \(u_{h}^{n}\in X_{h}\) be the solution of Eq. (4.1) and the \(u_{d}^{n}\in X^{d}\) be the solution of Eq. (5.20), when \(k=O(h^{2/3})\), \(\ell =O(N^{2/3})\) and snapshots are uniformly selected, we have:
Proof
Subtracting Eq. (5.20) from Eq. (4.1), letting \(\chi =v_{d}\in X^{d}\subset X_{h}\) can get:
The error decomposition is given as follows:
with \(\xi ^{n}=u_{h}^{n}-P^{d}u_{h}^{n}\), \(\phi ^{n}=u_{d}^{n}-P^{d}u_{h}^{n}\). Letting \(v_{d}=\phi ^{n}+\phi ^{n-1}\) and substituting \(\xi ^{n}\) and \(\phi ^{n}\) into (5.22) gives
By the Lipschitz condition of f, the boundedness of \(\|u_{h}^{n}\|_{\infty}\) and \(\|u_{d}^{n}\|_{\infty}\), and Young’s inequality, we can get:
Combining (5.7), (5.24), and Young’s inequality, (5.23) can be rewritten as:
Choosing the sufficiently small k yields that:
Summing the above inequality (5.25) from 1 to n gives
With the discrete Growall’s inequality, (5.17) and (5.18), we have:
Without loss of generality, let \(n_{i-1}\leq n\leq n_{i}\leq N\) (\(i=1,2,\ldots,\ell \)) (\(n=1,2,\ldots ,N\)) and \(n_{0}=0\). Expanding \(u_{h}^{n}\) into Tayor series with respect to \(t_{n_{i}}\) yields that \(u_{h}^{n}=u_{h}^{n_{i}}\pm \epsilon _{i}ku_{th}(\xi _{i})\), \(t_{n_{i-1}} \leq \xi _{i}\leq t_{n_{i}}\), \(i=1,2,\ldots,\ell \), where \(\epsilon _{i}\) is the step number from \(t_{n}\) to \(t_{n_{i}}\) or to \(t_{n_{i-1}}\) (\(i=1,2,\ldots, \ell \)). If the snapshot interval is the same, then \(\epsilon _{i}\leq N/{\ell}\). By (5.26), we obtain that:
Hence, if \(\ell =O(N^{2/3})\) and \(k=O(h^{2/3})\), by using Lemma 4, we can get:
With Lemma 4, (5.17) and the triangle inequality, the proof is completed. □
Using Theorems 5, 6. and Sobolev inequality yields the following result.
Theorem 7
With the hypotheses of Theorem 6, the following error estimates between the solutions of Eq. (2.1) and Eq. (5.20) hold:
6 Numerical experiments
We divide the interval \([0,1]\) into m equidistant subintervals such that \(0=x_{0}< x_{1}< \cdots < x_{m}=1\), and denote the subinterval length as \(h=x_{i+1} - x_{i}\). Let the spline set \({B_{-1},B_{0},\ldots ,B_{m}}\) constitute the basis function on the interval \([0,1]\). Referring to [61, 62], a quadratic B-spline \(B_{i}(x)\) with the desired properties is defined as:
The values of the B-spline functions and their first derivatives at the knots are given by:
Therefore, the approximate solution can be written in terms of the quadratic spline functions as:
where \(a_{i}(t)\) are yet undetermined coefficients.
Since each spline covers three intervals, three splines \(B_{i-1}(x)\), \(B_{i}(x)\), \(B_{i+1}(x)\) cover each finite element \([x_{i},x_{i+1}]\). From formula (6.2) and spline function properties (6.1), we can get the nodal value of function \(u^{h}(x,t)\) and its derivative at node \(x_{i}\) and fixed time \((\tilde{t})\), which can be expressed by coefficient \(a_{i}(\tilde{t})\) as follows:
Combining (6.3) and homogeneous boundary conditions (1.1c), we get \(a_{-1}(\tilde{t})=a_{0}(\tilde{t})=0\), \(a_{m-1}(\tilde{t})=a_{m}( \tilde{t})=0\). And then (6.2) is modified as:
That is, we must determine the \(m-2\) unknowns \(a_{i}(t)\) (\(i=1,2,\ldots ,m-2\)) at each moment of t.
6.1 The test problem
In this part, we consider the numerical solutions of the generalized KdV-RLW-Rosenau equation for the following test problems.
Example
Consider the following KdV-RLW-Rosenau equation:
where
The exact solution is:
Table 1 gives the error and second-order convergence of the scheme (4.1) in the time and space directions, which proves the theoretical results in Theorem 5.
Assuming the space step is \(h=0.01\) and the time step is \(k=0.05\), we have \(k=O(h^{2/3})\). When \(t=200k\), we first find the usual GFE solution \(u_{h}^{n}\) of Eq. (6.4) by scheme (4.1), which is depicted graphically on the left-hand side in Fig. 1. We output one group of 200 values at time \(t=1k,2k,\dots ,200k\), and choose 32 values from 200 so that every 6 values consist of one group of snapshots. Finally, using Matlab software, we find one group of 32 eigenvalues, which are arranged in a non-decreasing order. We construct one group of POD bases by using (5.5), take the first 8 POD bases from a set of 32 POD bases to expand into subspace \(X^{d}\) and find a set of numerical solutions at \(t=200k\) with Eq. (6.4) by scheme (5.20), which are depicted graphically on the right-hand side in Fig. 1.
Evolutions of the usual GFE solution (on left-hand side) and POD (with 8 bases) GFE solution (on right-hand side) of the KdV-RLW-Rosenau equation (6.4) with \(h=0.01\), \(k=0.05\)
In Table 2, d, \(\lambda _{j}\), and ratio are number of POD basis, eigenvector, and \(\|u^{n}-u_{d}^{n}\|_{\infty}/(h^{2}+k^{2}+k(\sum_{j=d+1}^{l} \lambda _{j})^{1/2})\), respectively. Figure 2 shows the errors between reduced order solutions \(u_{d}^{n}\) with different number of POD bases and exact solution \(u^{n}\) (blue piecewise line), and errors between usual GFE solutions \(u_{h}^{n}\) and exact solution (red line), respectively. Table 2 and Fig. 2 demonstrate that the result for numerical example is consistent with those obtained for the theoretical case. Obviously, it takes much less time to compute the POD GFE solution compared to the usual GFE solution, for details see [45].
7 Conclusions
We summarize the reduced-order modeling of the KdV-RLW-Rosenau equation discussed in the paper from two aspects. First, we analyze the semidiscrete Galerkin method and obtain \(L_{\infty}\)-error estimates using the Galerkin-Crank-Nicolson finite element method. Numerical examples confirm the theoretical results and demonstrate the efficiency of the fully discrete method. Second, we introduce a proper orthogonal decomposition (POD) method to derive a reduced POD GFE formulation of the equation. We analyze the error between the traditional GFE solution and the reduced GFE solution using POD and investigate the relation between the number of snapshots and the number of solutions in all time instances. Our approach can also be used for more general cases.
Availability of data and materials
Not applicable.
References
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)
Korteweg, D.J., de Vries, G.: On the change of form of long waves advancing in a rectangular canal and on a new type of long stationary waves. Philos. Mag. Ser. 5 39, 422–443 (1895)
Rosenau, P.: Dynamics of dense discrete systems. Prog. Theor. Phys. 79, 1028–1042 (1988)
Bon, J., Bryant, P.J.: A mathematical model for long waves generated by wavemakers in non-linear dispersive systems. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 73, pp. 391–405. Cambridge University Press, Cambridge (1973)
Abdulloev, K.O., Bogolubsky, I., Makhankov, V.G.: One more example of inelastic soliton interaction. Phys. Lett. A 56, 427–428 (1976)
Ramos, J.I.: Explicit finite difference methods for the EW and RLW equations. Appl. Math. Comput. 179, 622–638 (2006)
Zhang, L.: A finite difference scheme for generalized regularized long-wave equation. Appl. Math. Comput. 168, 962–972 (2005)
Zuo, J.M.: Solitons and periodic solutions for the Rosenau-KdV and Rosenau-Kawahara equations. Appl. Math. Comput. 215, 835–840 (2009)
Rosenau, P.: A quasi-continuous description of a nonlinear transmission line. Phys. Scr. 34, 827 (1986)
Cui, Y., Mao, D.K.: Numerical method satisfying the first two conservation laws for the Korteweg-de Vries equation. J. Comput. Phys. 227, 376–399 (2007)
Razborova, P., Moraru, L., Biswas, A.: Perturbation of dispersive shallow water waves with Rosenau-KdV-RLW equation and power law nonlinearity. Rom. J. Phys. 59, 658–676 (2014)
Coclite, G.M., Di Ruvo, L.: A singular limit problem for conservation laws related to the Rosenau-Korteweg-de Vries equation. J. Math. Pures Appl. 107, 315–335 (2017)
Mendez, A.J.: On the propagation of regularity for solutions of the fractional Korteweg-de Vries equation. J. Differ. Equ. 269, 9051–9089 (2020)
Benia, Y., Scapellato, A.: Existence of solution to Korteweg-de Vries equation in a non-parabolic domain. Nonlinear Anal. 195, 111758 (2020)
Kaya, D., Aassila, M.: An application for a generalized KdV equation by the decomposition method. Phys. Lett. A 299, 201–206 (2002)
Özer, S., Kutluay, S.: An analytical-numerical method for solving the Korteweg-de Vries equation. Appl. Math. Comput. 164, 789–797 (2005)
Barreto, R.K., De Caldas, C.S., Gamboa, P., Limaco, J.: Existence of solutions to the Rosenau and Benjamin-Bona-Mahony equation in domains with moving boundary. J. Differ. Equ. 35, 281–286 (2004)
Liu, L., Mei, M.: A better asymptotic profile of Rosenau-Burgers equation. Appl. Math. Comput. 131, 147–170 (2002)
Liu, L., Mei, M., Wong, Y.S.: Asymptotic behavior of solutions to the Rosenau-Burgers equation with a periodic initial boundary. Nonlinear Anal. 67, 2527–2539 (2007)
Mei, M.: Long-time behavior of solution for Rosenau-Burgers equation (I). Appl. Anal. 63, 315–330 (1996)
Mei, M.: Long-time behavior of solution for Rosenau-Burgers equation (II). Appl. Anal. 68, 333–356 (1998)
Piao, G.R., Lee, J.Y., Cai, G.X.: Analysis and computational method based on quadratic B-spline FEM for the Rosenau-Burgers equation. Numer. Methods Partial Differ. Equ. 32, 877–895 (2016)
Piao, G.R., Yao, F.X., Zhao, W.J.: Reduced basis finite element methods for the Korteweg–deVries–Burgers equation. Int. J. Numer. Anal. Model. 19, 369–385 (2022)
Mittal, R.C., Jain, R.K.: Numerical solution of general Rosenau-RLW equation using quintic b-splines collocation method. Commun. Nonlinear Anal. 2012, 1–19 (2012)
Atouani, N., Omrani, K.: Galerkin finite elemnt method for the Rosenau-RLW equation. Comput. Math. Appl. 66, 289–303 (2013)
Pan, X., Zheng, K., Zhang, L.: Finite difference discretization of the Rosenau-RLW equation. Appl. Anal. 92, 2578–2589 (2013)
Zuo, J.M., Zhang, Y.M., Zhang, T.D., Cheng, F.: A new conservative difference scheme for the general Rosenau-RLW equation. Bound. Value Probl. 2010, 516260 (2010)
Hu, J., Wang, Y.: A high-accuracy linear conservative difference scheme for Rosenau-RLW equation. Math. Probl. Eng. 2013, 1–8 (2013)
Razborova, P., Moraru, L., Biswas, A.R.: Perturbation of dispersive shallow water waves with Rosenau-kdv-RLW equation and power law nonlinearity. Rom. J. Phys. 59, 658–676 (2014)
Razborova, P., Ahmed, B., Biswas, A.R.: Solitons, shock waves and conservation laws of roseanu-kdv-RLW equation with power law nonlinearity. Appl. Math. Inf. Sci. 8, 485–491 (2014)
Razborova, P., Kara, A.H., Biswas, A.R.: Additional conservation laws for roseanu-kdv-RLW equation with power law nonlinearity. Nonlinear Dyn. 79, 743–758 (2015)
Wongsaijai, B., Poochinapan, K.: A three-level average finite difference scheme to solve equation obtained by coupling the Rosenau-kdv and the Rosenau-RLW equation. Appl. Math. Comput. 245, 289–304 (2014)
Pan, X., Wang, Y., Zhang, L.: Numerical analysis of a pseudo-compact c-n conservative scheme for the Rosenau-kdv equation coupling with the Rosenau-RLW equation. Bound. Value Probl. 2015, 65 (2015)
Turgut, A., Karakoc, S.B.G., Biswas, A.: Numerical scheme to dispersive shallow water waves. J. Comput. Theor. Nanosci. 13, 7084–7092 (2016)
Cai, J.X., Hong, Q., Yang, B.: Local structure-preserving methods for the generalized Rosenau-RLW-kdv equation with power law nonlinearity. Chin. Phys. B 26, 100202 (2017)
He, D., Pan, K.: A linearly implicit conservative finite difference scheme for the generalized Rosenau-Kawahara-RLW equation. Appl. Math. Comput. 271, 323–336 (2015)
Avazzadeh, Z., Nikan, O., Machado, J.A.T.: Solitary wave solutions of the generalized Rosenau-KdV-RLW equation. Mathematics 8, 1601 (2020)
Joslin, R.D., Gunzburger, M.D., Nicolaides, R.A., Erlebacher, G., Hussaini, M.Y.: Self-contained automated methodology for optimal flow control. AIAA J. 35, 816–824 (1997)
Kunisch, K., Volkwein, S.: Control of Burgers’ equation by a reduced order approach using proper orthogonal decomposition. J. Optim. Theory Appl. 102, 345–371 (1999)
Ly, H.V., Tran, H.T.: Proper orthogonal decomposition for flow calculations and optimal control in a horizontal CVD reactor. Q. Appl. Math. 60, 631–656 (2002)
Holmes, P., Lumley, J.L., Berkooz, G.: Turbulence, Coheren Structures, Dynamical Systems and Symmetry. Cambridge University Press, Cambridge (1996)
Kunisch, K., Volkwein, S.: Galerkin proper orthogonal decomposition methods for parabolic problems. Numer. Math. 90, 117–148 (2001)
Burkardt, J., Gunzburger, M., Lee, H.-C.: Centroidal Voronoi tessellation-based reduced-order modeling of complex systems. SIAM J. Sci. Comput. 28, 459–484 (2006)
Burkardt, J., Gunzburger, M., Lee, H.-C.: POD and CVT-based reduced-order modeling of Navier-Stokes flows. Comput. Methods Appl. Mech. Eng. 196, 337–355 (2006)
Luo, Z.D., Zhou, Y.J., Yang, X.Z.: A reduced finite element formulation based on proper orthogonal decomposition for Burgers equation. Appl. Numer. Math. 59, 1933–1946 (2009)
Burman, E., Stamm, B.: Low order discontinuous Galerkin methods for second order elliptic problems. SIAM J. Numer. Anal. 47, 508–533 (2008)
Ganesh, M., Hesthaven, J.S., Stamm, B.: A reduced basis method for electromagnetic scattering by multiple particles in three dimensions. J. Comput. Phys. 231, 7756–7779 (2012)
Herbst, M.F., Stamm, B., Wessel, S., Rizzi, M.: Surrogate models for quantum spin systems based on reduced-order modeling. Phys. Rev. E 105, 045303 (2022)
Benner, P., Gugercin, S., Willcox, K.: A survey of projection-based model reduction methods for parametric dynamical systems. SIAM Rev. 57, 483–531 (2015)
Chen, Y.L., Ji, L.J., Wang, Z.: A hyper-reduced MAC scheme for the parametric Stokes and Navier-Stokes equations. J. Comput. Phys. 466, 111412 (2022)
Hou, S.J., Chen, Y.L., Xia, Y.H.: Fast L2 optimal mass transport via reduced basis methods for the Monge-Ampère equation. SIAM J. Sci. Comput. 44, A3536–A3559 (2022)
Yu, J., Hesthaven, J.S.: Model order reduction for compressible flows solved using the discontinuous Galerkin methods. J. Comput. Phys. 468, 111452 (2022)
Yu, J., Ray, D., Hesthaven, J.S.: Fourier collocation and reduced basis methods for fast modeling of compressible flows. Commun. Comput. Phys. 32, 595–637 (2022)
Majda, A.J., Qi, D.: Strategies for reduced-order models for predicting the statistical responses and uncertainty quantification in complex turbulent dynamical systems. SIAM Rev. 60, 491–549 (2018)
Chen, D., Li, Q., Song, H.: Error analysis of a stable reduced order model based on the proper orthogonal decomposition method for the Allen–Cahn–Navier–Stokes system. Comput. Methods Appl. Mech. Eng. 401, 115661 (2022)
Li, K., Huang, T.-Z., Li, L., Lanteri, S.: Simulation of the interaction of light with 3-D metallic nanostructures using a proper orthogonal decomposition-Galerkin reduced-order discontinuous Galerkin time-domain method. Numer. Methods Partial Differ. Equ. 39, 932–954 (2023)
Apolinar-Fernandez, A., Ramos, J.I.: Numerical solution of the generalized, dissipative KdV-RLW-Rosenau equation with a compact method. Commun. Nonlinear Sci. Numer. Simul. 60, 165–183 (2018)
Brenner, S.C., Scott, L.R.: The Mathematical Theory of Finite Element Methods 2nd edn. pp. 97–111. Springer, New York (2002)
Ciarlet, P.G.: The Finite Element Mehtod for Elliptic Problems. North-Holland, Amsterdam (1978)
Stoer, J., Bulirsch, R.: Introduction to Numerical Analysis 3rd edn. pp. 97–111. Springer, New York (2002)
Prenter, P.M.: Splines and Variational Methods. Wiley, New York (1975)
Aksan, E.N.: Quadratic B-spline finite element method for numerical solution of the Burgers equation. Appl. Math. Comput. 174, 884–896 (2006)
Acknowledgements
The authors thank the editor and the referees for their valuable comments and suggestions, which greatly improved the quality of this paper.
Funding
This work was supported by the National Natural Science Foundation of China (11961073, 12001325) and Natural Science Foundation of Jilin Province (20180101215JC) and the State Key Program of National Natural Science Foundation of China (No. 12131014).
Author information
Authors and Affiliations
Contributions
Second author wrote the main manuscript text and first author reviewed the manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Zhao, W., Piao, GR. A reduced Galerkin finite element formulation based on proper orthogonal decomposition for the generalized KDV-RLW-Rosenau equation. J Inequal Appl 2023, 104 (2023). https://doi.org/10.1186/s13660-023-03012-1
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13660-023-03012-1
Keywords
- Generalized KdV-RLW-Rosenau equation
- Proper orthogonal decomposition
- Quadratic B-spline Galerkin finite element method
- Crank-Nicolson method
- Error estimates