Loading [MathJax]/jax/element/mml/optable/SuppMathOperators.js
Research article Special Issues

A novel algorithm for sarcasm detection using supervised machine learning approach

  • Academic editor: Andrea Sanna
  • Sarcasm means the opposite of what you desire to express, particularly to insult a person. Sarcasm detection in social networks SNs such as Twitter is a significant task as it has assisted in studying tweets using NLP. Many existing study-related methods have always focused only on the content-based on features in sarcastic words, leaving out the lexical-based features and context-based features knowledge in isolation. This shows a loss of the semantics of terms in a sarcastic expression. This study proposes an improved model to detect sarcasm from SNs. We used three feature set engineering: context-based on features set, Sarcastic based on features, and lexical based on features. Two Novel Algorithms for an effective model to detect sarcasm are divided into two stages. The first used two algorithms one with preprocessing, and the second algorithm with feature sets. To deal with data from SNs. We applied various supervised machine learning (ML) such as k-nearest neighbor classifier (KNN), na?ve Bayes (NB), support vector machine (SVM), and Random Forest (RF) classifiers with TF-IDF feature extraction representation data. To model evaluation metrics, evaluate sarcasm detection model performance in precision, accuracy, recall, and F1 score by 100%. We achieved higher results in Lexical features with KNN 89.19 % accuracy campers to other classifiers. Combining two feature sets (Sarcastic and Lexical) has shown slight improvement with the same classifier KNN; we achieved 90.00% accuracy. When combining three feature sets (Sarcastic, Lexical, and context), the accuracy is shown slight improvement. Also, the same classifier we achieved is a 90.51% KNN classifier. We perform the model differently to see the effect of three feature sets through the experiment individual, combining two feature sets and gradually combining three feature sets. When combining all features set together, achieve the best accuracy with the KNN classifier.

    Citation: Abdullah Yahya Abdullah Amer, Tamanna Siddiqu. A novel algorithm for sarcasm detection using supervised machine learning approach[J]. AIMS Electronics and Electrical Engineering, 2022, 6(4): 345-369. doi: 10.3934/electreng.2022021

    Related Papers:

    [1] Bijoy Kumar Shaw, Isha Sangal, Biswajit Sarkar . Reduction of greenhouse gas emissions in an imperfect production process under breakdown consideration. AIMS Environmental Science, 2022, 9(5): 658-691. doi: 10.3934/environsci.2022038
    [2] Ashish Kumar Mondal, Sarla Pareek, Biswajit Sarkar . The impact of shared-production and remanufacturing within a multi-product-based flexible production system. AIMS Environmental Science, 2023, 10(2): 267-286. doi: 10.3934/environsci.2023016
    [3] Ian C. Mell . Establishing the rationale for green infrastructure investment in Indian cities: is the mainstreaming of urban greening an expanding or diminishing reality?. AIMS Environmental Science, 2015, 2(2): 134-153. doi: 10.3934/environsci.2015.2.134
    [4] Richi Singh, Dharmendra Yadav, S.R. Singh, Ashok Kumar, Biswajit Sarkar . Reduction of carbon emissions under sustainable supply chain management with uncertain human learning. AIMS Environmental Science, 2023, 10(4): 559-592. doi: 10.3934/environsci.2023032
    [5] Soumya Kanti Hota, Santanu Kumar Ghosh, Biswajit Sarkar . A solution to the transportation hazard problem in a supply chain with an unreliable manufacturer. AIMS Environmental Science, 2022, 9(3): 354-380. doi: 10.3934/environsci.2022023
    [6] Dominic Bowd, Campbell McKay, Wendy S. Shaw . Urban greening: environmentalism or marketable aesthetics. AIMS Environmental Science, 2015, 2(4): 935-949. doi: 10.3934/environsci.2015.4.935
    [7] Subhash Kumar, Ashok Kumar, Rekha Guchhait, Biswajit Sarkar . An environmental decision support system for manufacturer-retailer within a closed-loop supply chain management using remanufacturing. AIMS Environmental Science, 2023, 10(5): 644-676. doi: 10.3934/environsci.2023036
    [8] Piyush S. Desai, Falguni P. Desai . An overview of sustainable green inhibitors for aluminum in acid media. AIMS Environmental Science, 2023, 10(1): 33-62. doi: 10.3934/environsci.2023003
    [9] Vanessa Duarte Pinto, Catarina Martins, José Rodrigues, Manuela Pires Rosa . Improving access to greenspaces in the Mediterranean city of Faro. AIMS Environmental Science, 2020, 7(3): 226-246. doi: 10.3934/environsci.2020014
    [10] Wen-Hung Lin, Kuo-Hua Lee, Liang-Tu Chen . The effects of Ganoderma lucidum compound on goat weight and anti-inflammatory: a case study of circular agriculture. AIMS Environmental Science, 2021, 8(6): 553-566. doi: 10.3934/environsci.2021035
  • Sarcasm means the opposite of what you desire to express, particularly to insult a person. Sarcasm detection in social networks SNs such as Twitter is a significant task as it has assisted in studying tweets using NLP. Many existing study-related methods have always focused only on the content-based on features in sarcastic words, leaving out the lexical-based features and context-based features knowledge in isolation. This shows a loss of the semantics of terms in a sarcastic expression. This study proposes an improved model to detect sarcasm from SNs. We used three feature set engineering: context-based on features set, Sarcastic based on features, and lexical based on features. Two Novel Algorithms for an effective model to detect sarcasm are divided into two stages. The first used two algorithms one with preprocessing, and the second algorithm with feature sets. To deal with data from SNs. We applied various supervised machine learning (ML) such as k-nearest neighbor classifier (KNN), na?ve Bayes (NB), support vector machine (SVM), and Random Forest (RF) classifiers with TF-IDF feature extraction representation data. To model evaluation metrics, evaluate sarcasm detection model performance in precision, accuracy, recall, and F1 score by 100%. We achieved higher results in Lexical features with KNN 89.19 % accuracy campers to other classifiers. Combining two feature sets (Sarcastic and Lexical) has shown slight improvement with the same classifier KNN; we achieved 90.00% accuracy. When combining three feature sets (Sarcastic, Lexical, and context), the accuracy is shown slight improvement. Also, the same classifier we achieved is a 90.51% KNN classifier. We perform the model differently to see the effect of three feature sets through the experiment individual, combining two feature sets and gradually combining three feature sets. When combining all features set together, achieve the best accuracy with the KNN classifier.



    Solving nonlinear partial differential equations (NLPDEs) has become a useful tool for delineating numerous physical problems that arise in many fields of mathematics and science, which includes describing various types of wave behavior observed in the natural world, with applications such as fluid mechanics to solid-state physics, plasma physics, nonlinear optics, etc. This made the nonlinear wave phenomena a major focus of scientific research in recent decades. Many researchers have diligently developed a wide range of powerful techniques to uncover solutions for NLPDEs both analytically and numerically. For instance, the Korteweg-de Vries (KdV) equation is frequently employed to model small-amplitude, and long waves on various surfaces, including shallow water, ion sound, and longitudinal astigmatic waves. The regularized long-wave (RLW) equation stands as a versatile model encompassing a wide range of physical phenomena. It not only characterizes shallow water waves, but also captures the intricate dynamics of nonlinear dispersive waves, ion-acoustic plasma waves, and magnetohydrodynamic plasma waves. To date, numerous numerical methods have been utilized to simulate solitary waves in the context of the Rosenau-Korteweg-de Vries (R-KdV) and Rosenau-KdV-RLW equations. However, there exists a limited number of numerical schemes specifically designed for the accurate simulation of shock waves in these equations. In this article, we aim to comprehensively address this research gap. To begin, the KdV equation stands as the quintessential model for investigating weakly nonlinear long waves that emerge in physical systems. For instance, it serves as a valuable descriptor for phenomena like shallow water surface waves with long wavelengths and small amplitudes, as well as internal waves within shallow density-stratified fluids. Beyond these examples, the KdV equation finds utility in a multitude of other applications, encompassing plasma waves, Rossby waves, and magma flow [1]. Korteweg and de Vries suggested the KdV equation as [2,3] :

    ut+auux+buxxx=0. (1.1)

    Within this equation, a real-valued function is denoted as u, alongside two real constants, a and b. This equation forms the fundamental basis for exploring and understanding waves of this particular nature[1,4]. To depict the behavior of dense discrete systems, Philip Rosenau introduced what we now refer to as the Rosenau equation in 1988, which takes the following form [5,6]:

    ut+ux+cuxxxxt+d(u2)x=0. (1.2)

    In a deeper exploration of nonlinear waves, Zuo [7] modified the Rosenau equation (1.2) by adding the viscous term uxxx, leading to the what is now known as the R-KdV equation:

    ut+aux+buxxx+cuxxxxt+d(u2)x=0. (1.3)

    The authors effectively obtained solitons and periodic wave solutions for the model by merging the KdV equation and the Rosenau equation, which was achieved by using both the sine-cosine and tanh methods in [4,7]. In [8], the conservative linear difference scheme was created for the R-KdV equation. The authors introduced the modified variational iteration algorithm-Ⅱ (MVIA-Ⅱ) to obtain numerical solutions of different types of fifth-order KdV equations [9]. In [10], the authors focus on deriving solitary wave solutions for the generalized Rosenau-KdV equation using the sech-ansatz method. Through the examination of various test problems, these methods showcase both efficiency and reliability in their application. The inclusion of the term uxxt in Eq (1.3), when b=0, describes an additional characteristic of nonlinear waves, leading to what is commonly referred to as the Rosenau–RLW equation:

    ut+aux+cuxxxxt+d(u2)xeuxxt=0. (1.4)

    This equation represents a significant model in nonlinear wave studies. Furthermore, its extended form is known as the generalized Rosenau–RLW equation:

    ut+aux+cuxxxxt+d(up)xeuxxt=0. (1.5)

    The generalized Rosenau–RLW equation presents an expanded framework for understanding complex nonlinear wave behaviors, incorporating the effect of U over time within the wave equation's dynamics. This equation holds significance in the realm of nonlinear wave theory, providing a foundation for studying the behaviors and characteristics of waves within different physical systems. In this article, the generalized Rosenau–KDV–RLW (GR–KDV–RLW) equation will be considered, which combines terms from the generalized Rosenau KDV and generalized Rosenau–RLW equations. The provided equation can be represented as follows:

    ut+aux+bKdVuxxx+cuxxxxt+d(up)xeRLWuxxt=0. (1.6)

    It's important to note that in this context, p2,d>0,a,bKdV,c, and eRLW are real constants [11,12]. We impose specific physical boundary conditions, requiring that u0 as x±. The variables x and t indicate differentiation with respect to space and time, respectively. To apply our numerical method effectively, we confine our solution to the interval defined by axb. The shallow water wave equation can be represented numerically using the dependent variable \(u(x, t)\), denoting the wave profile concerning spatial position (\(x\)) and time (\(t\)). The equation includes coefficients such as \(a\) for drift effect, \(b\) for third-order dispersion, \(c\) for higher-order dispersion, and \(d\) for nonlinear effects. \(e\) represents the coefficient associated with the term \(u_{xtt}\), contributing to the evolution of shallow water waves. Boundary conditions will be selected from a set of homogeneous conditions for further analysis.

    u(a,t)=0,u(b,t)=0,ux(a,t)=0,ux(b,t)=0,t>0. (1.7)

    Furthermore, the initial condition is defined as :

    u(x,0)=f(x),axb. (1.8)

    Given the known value of f(x), Eq (1.6) combines the general Rosenau-KdV and general Rosenau-RLW equation. By setting bKdV to zero in Eq (1.6), the resulting equation represents the general Rosenau-RLW as follows:

    ut+aux+cuxxxxt+d(up)xeRLWuxxt=0,p2. (1.9)

    In the Eq (1.9), for p=2, it represents the usual Rosenau-RLW equation, and for p=3, it denotes the modified Rosenau-RLW equation. Moreover, in Eq (1.6) for p4, it signifies the general Rosenau-RLW equation. The Rosenau–KDV–RLW equation has prompted the development of various numerical schemes. However, the generalized form of the Rosenau–KDV–RLW equation has received comparatively less focus owing to its height nonlinearity. Numerous numerical techniques have been put forth to address the Rosenau-KdV equation, including methods where [13] introduced an innovative approach merging the Haar wavelet collocation method, a nonstandard finite difference scheme, and quasilinearization to calculate numerical solutions for the given equation effectively. [14] proposes semi-discrete and fully-discrete B-spline Galerkin approximations. The approach involves applying a proper orthogonal decomposition (POD) method to a Galerkin finite element (GFE) formulation. [15] presents a third-order weighted essentially non-oscillatory (WENO) method combined with a four stage third-order L-stable SSP implicit-explicit Runge-Kutta method (Third-order SSP EXRK method and third-order DIRK method) for spatial and temporal discretization. [16] introduces two highly effective numerical schemes that rely on a combination of the B-spline finite element method and time-splitting techniques. [17] proposes a meshless algorithm using radial basis function and finite-difference methods to approximate the solution of the equation. In [18], a collocation technique based on quintic B-spline basis functions is proposed and they apply the Runge–Kutta method of four stages and third-order (SSP-RK43) to solve the resulting system of equations. [19] presents a collocation finite element method based on septic B-splines, which provides better numerical solutions compared to previous methods. [20] proposes a two-level implicit fully discrete scheme with third-order accuracy in space and second-order accuracy in time. In both [21,22], numerical methods are introduced with a common foundation in B-spline collocation finite element techniques, applied to solve specific equations. [23] proposes a three-level linear implicit conservative scheme that is second-order convergent and unconditionally stable. The spectral collocation method has been applied in previous literature as a computational technique, such as shown through [24,25,26,27,28,29,30,31,32,33]. In this article, the GR–KDV–RLW equation will numerically analyze by employing the fast Fourier transform (FFT) technique combined with the central difference method. The GR–KDV–RLW equation will be addressed and solved across eight different cases, which encompasses the behavior of single solitary waves, interactions among two and three solitary waves, and the evolution of solitons with Gaussian and undular bore initial conditions.

    In [23], the authors present the following results to ensure the Eqs (1.6)–(1.8) when c=1 are well-posed and satisfy conservation laws, the solution, and its derivatives. When considering the L2 norm, the solution and its derivatives are bounded up to the second order. Also, when considering the L norm, both the solution and its first-order derivative remain confined [13]. Equivalent results can be easily obtained for other values of c.

    Definition 2.1. Let Ω=[a,b] and u(q) represent the q-th order derivative. The Sobolev spaces H2(Ω) and H20(Ω) are defined as follows:

    H2(Ω)={u:Ω(u(q))2dx<,q=0,1,2}, (2.1)
    H20(Ω)={u:uH2(Ω),iuxi=0 on Ωi=0,1,2}. (2.2)

    Lemma 2.1. Suppose u0H20[a,b], then the solution of Eqs (1.6)–(1.8) satisfies

    IM(t)=bau(x,t)dx=bau(x,0)dx=bau0dx=IM(0).

    Theorem 2.1. Suppose u0H20[a,b], then the solution of Eqs (1.6)–(1.8) satisfies

    IE(t)=ba[u2(x,t)+eu2x(x,t)+cu2xx(x,t)]dx=u2L2+eux2L2+cuxx2L2=IE(0),e0.

    Theorem 2.2. Suppose u0H20[a,b], then the solution of Eqs (1.6)–(1.8), satisfies uL2C,uxL2C,uxxL2C, and, hence uLC and uxLC.

    Theorem 2.3. Suppose u0H20[a,b], then the problem defined by Eqs (1.6)–(1.8) is well-posed.

    In the realm of numerical methods, a sophisticated method is developed specifically for tackling the periodic initial value problem that's encountered. This problem is presented with a scenario wherein a function denoted as u is predefined as a prescribed function of x at the initial time point t=0, and, subsequently, the solution exhibits periodic behavior concerning the variable x while being constrained within a fundamental interval defined by a. The Eq (1.6) can be written as:

    \begin{equation} w_{t} = -a u_{x}-b u_{x x x}-d(u^{p})_{x}. \end{equation} (2.3)

    Simplification of Eq (2.3) yields:

    \begin{equation} w_{t} = -a u_{x}-b u_{x x x}-(p)d u^{p-1} (u)_{x}, \end{equation} (2.4)

    where

    \begin{equation} w = u+c u_{x x x x } - e u_{x x }. \end{equation} (2.5)

    For a clearer presentation, the spatial period [a, b] will be normalized to [0, 2\pi] via the transformation x \rightarrow \frac{2\pi(x-a)}{L} , where L = b-a . The normalization process extends to the Fourier space in relation to x and its derivatives or other operators related to x . The FFT efficiently performs this process, then, by employing the inverse Fourier transform, expressed as \frac{\partial^n u}{\partial x^n} = F^{-1}(i k)^n F(u) for n = 1, 2, \ldots , we proceed to discretize the resulting equations. For any positive integer N , we consider grid points x_j = j\Delta x = \frac{2\pi j}{N} , where j = 0, 1, \ldots, N-1 . The solution u(x, t) is subsequently transformed into discrete Fourier space as follows:

    \begin{equation} \hat{u}(k, t) = F(u) = \frac{1}{N} \sum\limits_{j = 0}^{N-1} u\left(x_{j}, t\right) e^{-i k x_{j}}, \quad-\frac{N}{2} \leqslant k \leqslant \frac{N}{2}-1. \end{equation} (2.6)

    The inverse formula is

    \begin{equation} u\left(x_{j}, t\right) = F^{-1}(\hat{u}) = \sum\limits_{k = -N / 2}^{N / 2-1} \hat{u}(k, t) e^{i k x_{j}}, \quad 0 \leqslant j \leqslant N-1. \end{equation} (2.7)

    To simplify, we use the Fourier transform on both sides of Eqs (2.4) and (2.5) to represent them in Fourier space:

    \begin{equation} \hat{w}(k, t) = -aik\hat{u}(k, t) - b(ik)^3\hat{u}(k, t) - pd(ik)\hat{u}^{p-1} (\hat u)_{x}(k, t), \end{equation} (2.8)
    \begin{equation} \hat{w}(k, t) = \hat{u}(k, t) + c (ik)^4 \hat{u}(k, t) - e (ik)^2 \hat{u}(k, t). \end{equation} (2.9)

    Now, all the mathematical operations mentioned earlier will be applied to Eqs (2.4) and (2.5), ultimately reducing them to the following equation:

    \begin{equation} w(x_{j}, t) = u(x_{j}, t) + c (2 \pi / L)^{4} F^{-1}\{ k^{4} F(u) \} - e (2 \pi / L)^{2} F^{-1}\{ -k^{2} F(u) \} , \end{equation} (2.10)
    \begin{equation} \frac{\partial w(x_{j}, t)}{\partial t} = - a(2 \pi / L) F^{-1} \{i k F(u)\} - b (2 \pi / L)^{3} F^{-1} \{-ik^{3} F(u)\} - d(2 \pi / L)^{p} u^{p}(x_{j}, t) F^{-1} \{i k F(u)\}. \end{equation} (2.11)

    Let \boldsymbol{u} = \left[u\left(x_{0}, t\right), u\left(x_{1}, t\right), \ldots, u\left(x_{N-1}, t\right)\right]^{T} .

    The ordinary differential equation (2.11) can be expressed in vector form as:

    \begin{equation} \boldsymbol{w}_{\boldsymbol{t}} = g(\boldsymbol{u}). \end{equation} (2.12)

    The function g(\boldsymbol{u}) is defined as the righthand side of the equation, which can be solved using various methods from first-order differential equations. Specifically, in this article, the central finite differences method will be employed. Regarding its convergence and stability, its efficacy is discussed in [34,35,36]. By utilizing the inverse Fourier transform as defined in Eq (2.7), the next step is to simplify Eq (2.8), resulting in the reduction of the derived equation. Introduce the central difference method as follows:

    \begin{equation} w_{t} = \frac{w(x, t+\Delta t)-w(x, t-\Delta t)}{2 \Delta t} = \frac{w^{n+1}-w^{n-1}}{2 \Delta t}. \end{equation} (2.13)

    By applying the scheme to handle the resulting ordinary differential equation in the time domain and, by employing it to advance in time, we achieve the following result:

    \begin{equation} w(x, t+\Delta t) = w(x, t-\Delta t)+2 \Delta t g (u(x, t)). \end{equation} (2.14)

    Finally, in our pursuit of a solution, we employ the inverse Fourier transform to approximate our result. The central difference method necessitates the provision of two distinct initial values, which is fundamental to its operation. To start this process, we define the first of these two levels and start with u(x, 0) to reach w(x, 0) , then

    \begin{equation} w(x, n \Delta t) = F^{-1}(1+ c k^{4}(2 \pi / L)^{4} - e k^{2}(2 \pi / L)^{2}) F(u(x, n \Delta t)), \end{equation} (2.15)
    \begin{equation} w(x, 0) = F^{-1}(1+ c k^{4}(2 \pi / L)^{4} - e k^{2}(2 \pi / L)^{2}) F(u(x, 0)). \end{equation} (2.16)

    To compute the second level of the initial solution denoted as w(x, \Delta t) , we utilize a higher-order one-step method, specifically, the fourth-order Runge-Kutta method (RK4).

    \begin{equation} \begin{aligned} & K_1 = F(u(x, 0), 0), \\ & K_2 = F(u(x, 0)+\frac{1}{2} \Delta t K_1, \frac{1}{2} \Delta t), \\ & K_3 = F(u(x, 0)+\frac{1}{2} \Delta t K_2, \frac{1}{2} \Delta t), \\ & K_4 = F(u(x, 0)+\Delta t K_3, \Delta t), \\ & w(x, \Delta t) = w(x, 0)+\frac{\Delta t}{6}[K_1+2 K_2+2 K_3+K_4] . \end{aligned} \end{equation} (2.17)

    Following this evaluation, substitute the determined value of w(x, \Delta t) into Eq (2.15) as a pivotal step in our methodology.

    \begin{equation} u(x, n \Delta t) = F^{-1}(F(w(x, \Delta t) /(1+ c k^{4}(2 \pi / L)^{4} - ek^{2}(2 \pi / L)^{2}). \end{equation} (2.18)

    To derive the solution u(x, t) , Eq (2.12) transforms as follows:

    \begin{equation} w(x, t+\Delta t) = w(x, t-\Delta t) -2 \Delta t( a + b (2 \pi / L)^{2} F^{-1} \{-ik^{3} F(u)\} + p d(2 \pi / L)^{p-1} u^{p-1}(x_{j}, t) F^{-1} \{i k F(u)\}. \end{equation} (2.19)

    In conclusion, we derive the approximate solution by employing the FFT in MATLAB until evaluating u(x, t) at time t = n \Delta t , as outlined precisely in Eq (2.7). It's essential to highlight that the central difference method requires us to provide two sets of initial values.

    In this section, we outline the algorithm for the proposed methodology related to the GR-KdV-RLW equation (1.6). The steps below encompass the fundamental components of this approach:

    Step 1: Discretize the spatial domain x into spaced grid points.

    Step 2: Apply the Fourier derivative theorem to calculate spatial derivatives in Fourier space, then the inverse to get the initial condition.

    Step 3: Use the RK4 method to calculate the other initial condition for the central difference method.

    Step 4: Thus, we get the solution of (1.6) for various values of N and t .

    To assess the effectiveness and precision of the numerical approach, we conducted eight numerical experiments. These experiments included the study of a single solitary wave motion, the interactions of two and interactions of three solitary waves, and the observation of soliton evolution under Gaussian and undular bore initial conditions. This helped us gauge the method's performance and accuracy. To assess solution accuracy, the error norm L_{2} is employed, which is defined as [10]:

    \begin{equation} L_{2} = \left\|u^{\text {exact }}-u_{N}\right\|_{2} \simeq \sqrt{h \sum\limits_{j = 1}^{N}\left|u_{j}^{\text {exact }}-\left(u_{N}\right)_{j}\right|^{2}}. \end{equation} (3.1)

    Also, utilize the error norm L_\infty for assessing solution accuracy.

    \begin{equation} L_{\infty} = \left\|u^{\text {exact }}-u_{N}\right\|_{\infty} \simeq \max _{j}|u_{j}^{\text {exact }}-(u_{N})_{j}|, \quad j = 1, 2, \ldots, N-1. \end{equation} (3.2)

    To calculate the difference between analytical and numerical solutions at some specified times, the two conserved quantities are given as:

    Mass conservation (Lemma 2.1)

    \begin{equation} I_{M} = \int_{a}^{b} u \mathrm{\; d} x \simeq h \sum\limits_{j = 1}^{N} u_{j}^{n}. \end{equation} (3.3)

    Energy conservation (Theorem 2.1)

    \begin{equation} I_E(t) = \int_a^b[u^2+e u_x^2+c u_{x x}^2] dx \simeq h \sum\limits_{j = 1}^{N}[(u_{j}^n)^2+e (u_x)^n_{j}+c (u_{x x})^n_{j}]. \end{equation} (3.4)

    The quantities I_{M} and I_{E} represent the momentum and energy of the shallow water waves, respectively. Throughout the simulation of solitary wave motion, we observe and track these invariants to evaluate the precision and correctness of the numerical algorithm.

    Given the parameters a = 1, b = 1, c = 1, d = 0.5, e = 0, and p = 2 in Eq (1.6), representing the Rosenau-KdV equation considered with the boundary conditions where U \rightarrow 0 as x \rightarrow \pm \infty to derive the single solitary wave solution:

    \begin{equation} u(x, t) = A \operatorname{sech}^{4}[B(x-v t)], \end{equation} (3.5)

    such that

    \begin{equation} A = \frac{210 b B^{2}}{13 d}, \quad B = \frac{1}{3}\left[\frac{-13 a c+\sqrt{169 a^{2} c^{2}+144 b^{2} c}}{32 b c}\right]^{\frac{1}{2}}, \quad v = \frac{b}{52 c B^{2}} . \end{equation} (3.6)

    The initial condition is as follows:

    \begin{equation} u(x, 0) = A \operatorname{sech}^{4}(B x) . \end{equation} (3.7)

    The numerical solutions for a single solitary wave were obtained through the presented method, where v = 1.18 considers the variable x within the range [-70,100] . The method exhibits an amplitude of 0.5263 and conducts extensive experimentation when utilizing spatial and temporal step sizes of \Delta x = 0.1 and \Delta t = 0.01 at time T = 40 . Figure 1 (a) illustrates a close correspondence between the solitary wave curve and the exact solution. Figure 1 (b), represents the error between the exact and numerical results for solitary waves at time t = 40 . Figure 2 presents a plan view and a 3D illustration of the motion of a single solitary wave. The method demonstrates the preservation of conserved quantities \(I_M\) and \(I_E\), affirming its capability to accurately uphold the soliton's momentum and energy throughout the simulation while maintaining the amplitude remarkably close to its initial value. Furthermore, Table 1 assesses the performance of the scheme as comparing the error norms \(L_\infty\) and \(L_2\) against results obtained from other numerical approaches. As Table 2 shows, the error norms exhibit a significant reduction (halving) as the parameter N increases (doubles). In addition, the numerical invariants closely approach their corresponding analytical values with increasing N , maintaining near-constant values compared to the analytical invariants. The results highlight the superior computational accuracy of the present scheme, as it consistently exhibits the smallest error among the mentioned methods when N increases and \Delta x , \Delta t are decreased. These consistently low error values exhibit a high degree of accuracy when compared to alternative methods.

    Figure 1.  (a): Motion of a single solitary wave. (b): Error in Example 1 at time t = 40 with parameters N = 32768 , \Delta x = 0.1 , \Delta t = 0.01 , a = 1 , b = 1 , c = 1 , d = 0.5 , e = 0 , and x \in [-70,100] .
    Figure 2.  (a): Plan view of the motion of a single solitary wave. (b): 3D illustration of the motion of a single solitary wave of Example 1 at time t = 40 with parameters N = 32768 , \Delta x = 0.1 , \Delta t = 0.01 , a = 1 , b = 1 , c = 1 , d = 0.5 , e = 0 , and x \in [-70,100] .
    Table 1.  The invariants and error norms for the single soliton in Example 1 with specific values, N = 32768 , \Delta x = 0.1, and \Delta t = 0.01.
    t I_M I_E L_\infty \times10^3 L_2\times10^3 Amplitude CPU time (s)
    0 5.498005889871813 1.989722881215791 0 0 0.53410 0
    10 5.498005889871814 1.989722802347945 0.9323889010 2.9049224720 0.526282 279.2063
    20 5.498005889871810 1.989722809878721 0.0505519840 0.1534085381 0.526291 551.0067
    30 5.498005889871815 1.989722806497761 0.0763507209 0.2320850336 0.526297 826.4037
    40 5.498005889871814 1.989722808570217 0.1022150001 0.3115256472 0.526301 1089.1868
    50 5.498005889871809 1.989722808746637 1.0357704951 3.2205212200 0.526314 1357.2288
    60 5.498005889871809 1.989722808788525 1.0617460974 3.3008684478 0.526316 1637.9250

     | Show Table
    DownLoad: CSV
    Table 2.  The invariants and error norms for the single soliton in Example 1 at various N values, assessed at t = 40 , compared across different methods.
    N \Delta x \Delta t I_M I_E L_\infty \times10^3 L_2\times10^3
    1024 1 0.01 5.492804370581490 1.987861022398681 3.1083809729 9.4207987042
    2048 0.1 0.01 5.495489025699077 1.988821936970796 1.5623344409 4.7191964671
    4096 0.1 0.01 5.496831353257869 1.989302400117236 0.7835599487 2.3683235481
    8192 0.1 0.01 5.497502517037270 1.989542633153467 0.3941988072 1.1928983561
    16384 0.1 0.01 5.497838098926962 1.989662750037072 0.1995257407 0.6052412061
    32768 0.1 0.01 5.498005889871814 1.989722808570217 0.1022150001 0.3115256472
    65536 0.1 0.01 5.498089785344237 1.989752837859619 0.0536065938 0.1648741401
    131072 0.1 0.01 5.498131733080447 1.989767852510028 0.0297447895 0.0918889465
    131072 0.1 0.1 5.498131733080452 1.989761443558063 0.8287708219 2.2920187254
    Comparison of methods
    Sextic B-spline [4] 0.1 0.1 5.4981749335 1.9897841614 0.411492 1.162489
    CLDS [8] 0.1 0.1 5.4977342352 1.9847015013 1.878952 5.297873
    CFEM [37] 0.1 0.1 5.4981750621 1.9897841635 0.422656 1.187411

     | Show Table
    DownLoad: CSV

    Given the parameters a = 1, b = 1, c = 1, d = 1, e = 0, and p = 5 in Eq (1.6), representing the Rosenau-KdV equation, we have

    \begin{equation} u_t+u_x+(u^5)_x+u_{x x x}+u_{x x x x t} = 0. \end{equation} (3.8)

    The initial condition was specified as:

    \begin{equation} u_(x, 0) = k_{1} \operatorname{sech}(k_{2} x). \end{equation} (3.9)

    This choice yields the exact solitary wave solution:

    \begin{equation} u(x, t) = k_{1} \operatorname{sech}[k_{2}(x-k_{3} t)], \end{equation} (3.10)

    where

    \begin{equation} k_{1} = \sqrt[4]{\frac{4}{15}(-5+\sqrt{34})}, \quad k_{2} = \frac{1}{3} \sqrt{-5+\sqrt{34}}, \quad k_{3} = \frac{1}{10}(5+\sqrt{34}) . \end{equation} (3.11)

    We conducted numerical simulations with specific parameters, considering x within the interval [-60, 90] and T = 20 . The comparison of the wave graph from the numerical solution is presented in Figure 3. The figure illustrates that the wave amplitude remains nearly identical at different times, suggesting energy conservation. Figure 4 presents a plan view and a 3D illustration of the motion of a single solitary wave. Additionally, a comparison of errors using the L_\infty norm and L_2 norm at T = 20 is tabulated in Table 3. Table 4 shows that the error norms exhibit a significant reduction (halving) as the parameter N increases (doubles). Also, it's obvious that the computational efficiency of the new scheme highly surpasses that of the methods presented in the comparison methods when N increases and \Delta x , \Delta t are decreased. These results provide strong evidence for the energy conservation property of the new scheme.

    Figure 3.  (a): Motion of single solitary wave. (b): Error of Example 2 at time t = 20 with parameters N = 16384 , \Delta x = 0.1 , \Delta t = 0.01 , a = 1 , b = 1 , c = 0 , d = 1 , e = 0 , and x \in [-60, 90] .
    Figure 4.  (a): Plan view of the motion of a single solitary wave. (b): 3D illustration of motion of a single solitary wave of Example 2 at time t = 20 with parameters N = 16384 , \Delta x = 0.1 , \Delta t = 0.01 , a = 1 , b = 1 , c = 0 , d = 1 , e = 0 , and x \in [-60, 90] .
    Table 3.  Invariants and error norms for the single soliton of Example 2 with N = 16384 , \Delta x = 0.1, and \Delta t = 0.01.
    t I_M I_E L_\infty \times10^3 L_2\times10^3 Amplitude
    0 7.093210231136498 3.110525454098892 0 0 0.686019
    5 7.093210231136510 3.110524968545394 1.1534542328 3.4174191315 0.686072
    10 7.093210231136506 3.110525066437504 1.1788351937 3.4911615557 0.686083
    15 7.093210231136507 3.110525140466537 1.2038017457 3.5642353055 0.686080
    20 7.093210231136505 3.110525118247572 0.1028749227 0.3034375019 0.686074

     | Show Table
    DownLoad: CSV
    Table 4.  Invariants and error norms for the single soliton of Example 2 at different values of N at t = 20 comparison with different methods.
    N \Delta x \Delta t I_M I_E L_\infty \times10^3 L_2\times10^3
    2048 0.1 0.01 7.090179499791676 3.109217155558196 0.7916318898 2.3427479567
    4096 0.1 0.01 7.091911346274546 3.109964559498229 0.3980440479 1.1772860789
    8192 0.1 0.01 7.092777269515867 3.110338264779623 0.2012445858 0.5946188025
    16384 0.1 0.01 7.093210231136505 3.110525118247572 0.1028749227 0.3034375019
    32768 0.1 0.01 7.093426711946839 3.110618545188292 0.0537538262 0.1581376255
    32768 0.1 0.1 7.093426711946828 3.110586752471893 0.8200819099 2.0771466022
    Comparison of methods
    [23] 0.1 0.1 - - 0.18771 0.113342

     | Show Table
    DownLoad: CSV

    Consider the parameters a = 1, b = 1, c = 1, d = 1, e = 0 , and p = 3 in Eq (1.6), representing the Rosenau-KdV equation so that, the equation takes the following form:

    \begin{equation} u_t+u_x+(u^p)_x+u_{x x x}+u_{x x x x t} = 0, \end{equation} (3.12)

    which is known as the generalized Rosenau KDV equation and its soliton solution is given in [10]. For p = 3 , the exact solution is given by:

    \begin{equation} u(x, t) = k_1 \operatorname{sech}^2[k_2(x-k_3 t)], \end{equation} (3.13)

    where

    \begin{equation} k_1 = \frac{1}{4} \sqrt{-15+3 \sqrt{41}}, \quad k_2 = \frac{1}{4} \sqrt{\frac{-5+\sqrt{41}}{2}}, \quad k_3 = \frac{1}{10}(5+\sqrt{41}). \end{equation} (3.14)

    The initial condition is

    \begin{equation} u(x, 0) = k_1 \operatorname{sech}^2[k_2 x]. \end{equation} (3.15)

    Figure 5 displays the comparison of wave amplitude obtained from the numerical solution. The figure reveals that the wave amplitude remains remarkably consistent at different times, implying energy conservation. Furthermore, Figure 6 provides both a plan view and a 3D illustration of the motion of a single solitary wave. Tables 5 provides a comparison of errors using the L_\infty norm and L_2 norm at T = 40 for x within the interval [-60, 90] . Table 6 shows that the error norms exhibit a significant reduction (halving) as the parameter N increases (doubles). As observed in Tables 5 and 6, the error norms obtained by the method are consistently smaller than those of the other comparison methods when N increases and \Delta x , \Delta t are decreased.

    Figure 5.  (a): Motion of single solitary wave. (b): Error of Example 3 at time t = 40 with parameters N = 16384 , \Delta x = 0.1 , \Delta t = 0.01 , a = 1 , b = 1 , c = 5 , d = 1 , e = 0 , and x \in [-60, 90] .
    Figure 6.  (a): Plan view of the motion of a single solitary wave.(b): 3D illustration of motion of a single solitary wave of Example 3 at time t = 40 with parameters N = 16384 , \Delta x = 0.1 , \Delta t = 0.01 , a = 1 , b = 1 , c = 5 , d = 1 , e = 0 , and x \in [-60, 90] .
    Table 5.  Invariants and error norms for the single soliton of Example 3 with N = 16384 , \Delta x = 0.1, and \Delta t = 0.01.
    t I_M I_E L_\infty \times10^3 L_2\times10^3 Amplitude
    0 4.898680475587986 1.682446890633076 0 0 0.512863
    5 4.898680475587988 1.682446669588021 0.9646994328 2.8273426044 0.512883
    10 4.898680475587989 1.682446713738066 0.9882448813 2.8930757806 0.512882
    15 4.898680475587990 1.682446742297635 1.0120789316 2.9603063735 0.512882
    20 4.898680475587982 1.682446732512619 0.0947644616 0.2696706231 0.512862
    25 4.898680475587991 1.682446729585691 0.1186665053 0.3380125486 0.512864
    30 4.898680475587991 1.682446735013325 0.1425655809 0.4066130028 0.512866
    35 4.898680475587989 1.682446742446395 0.1664769241 0.4754175706 0.512867
    40 4.898680475587992 1.682446747588404 0.1903588152 0.5443703676 0.512869

     | Show Table
    DownLoad: CSV
    Table 6.  Invariants and error norms for the single soliton of Example 3 at different values of N at t = 40 comparison with different methods.
    N \Delta x \Delta t I_M I_E L_\infty \times10^3 L_2\times10^3
    2048 0.1 0.01 4.896587405739421 1.681740472990474 1.4742529842 4.2031274345
    4096 0.1 0.01 4.897783445652888 1.682144056497737 0.7406123146 2.1124065578
    8192 0.1 0.01 4.898381465609623 1.682345850228840 0.3737781703 1.0670058118
    16384 0.1 0.01 4.898680475587992 1.682446747588404 0.1903588152 0.5443703676
    32768 0.1 0.01 4.898829980577171 1.682497196391648 0.0986916137 0.2832076016
    32768 0.1 0.5 4.898829980576815 1.682790870144930 26.0471738546 69.8929283038
    32768 0.1 0.25 4.898829980577174 1.682445210448126 6.3340343984 17.0588205575
    32768 0.1 0.0625 4.898829980577184 1.682491883652615 0.4652663223 1.2625554515
    Comparison of methods
    [13] 2M = 128 - 0.5 - - 4.85593 1.18987
    [13] 2M = 128 - 0.25 - - 0.62532 0.1592
    [38] N = 200 - 0.25 - - 9.9701002 26.393848
    [38] N = 600 - 0.0625 - - 0.61045529 1.6159943

     | Show Table
    DownLoad: CSV

    In this example, considering the parameters a = 1, b = 1, c = 1, d = 0.5 , e = 1 , and p = 2 , Eq (1.6) becomes

    \begin{equation} u_t+u_x+0.5(u^2)_x-u_{x x t}+u_{x x x}+u_{x x x x t} = 0. \end{equation} (3.16)

    The exact solution of the equation is

    \begin{equation} u(x, t) = k_1 \operatorname{sech}^4[k_2(x-k_3 t)], \end{equation} (3.17)

    where

    \begin{equation} k_1 = \frac{-5(25-13 \sqrt{457})}{456}, \quad k_2 = \frac{\sqrt{-13+\sqrt{457}}}{\sqrt{288}}, \quad k_3 = \frac{241+13 \sqrt{457}}{266}. \end{equation} (3.18)

    The initial condition is defined as:

    \begin{equation} u(x, 0) = k_1 \operatorname{sech}^4[(k_2 x)]. \end{equation} (3.19)

    In Figure 7, the numerical solutions closely match the exact solutions. These figures demonstrate that the wave amplitude at various time instances remains nearly constant. Figure 8 provides both a plan view and a 3D illustration of the motion of a single solitary wave. Furthermore, the error norms L_\infty and L_2 at time T = 30 for x within the interval [-40,100] are summarized in Table 7. It is observed from Table 8 that the errors are significantly reduced (halved) as the parameter N increases (doubles), and the resulting error norms are notably good, being smaller than those of the compared methods when N increases and \Delta x , \Delta t are decreased.

    Figure 7.  (a): Motion of single solitary wave. (b): Error of Example 4 at time t = 30 with parameters N = 16384 , \Delta x = 0.1 , \Delta t = 0.01 , a = 1 , b = 1 , c = 1 , d = 0.5 , e = 1 , and x \in [-40,100] .
    Figure 8.  (a): Plan view of the motion of a single solitary wave. (b): 3D illustration of motion of a single solitary wave of Example 4 at time t = 30 with parameters N = 16384 , \Delta x = 0.1 , \Delta t = 0.01 , a = 1 , b = 1 , c = 1 , d = 0.5 , e = 1 , and x \in [-40,100] .
    Table 7.  Invariants and error norms for the single soliton of Example 4 with N = 16384 , \Delta x = 0.1, and \Delta t = 0.01.
    t I_M I_E L_\infty \times10^3 L_2\times10^3 Amplitude
    0 21.677935246115432 43.714878717385488 0 0 2.772714
    10 21.677935246115425 43.714739731779780 11.0692526920 29.7777663315 2.772978
    20 21.677935246115439 43.714742070342737 1.0407675579 2.7303206997 2.772863
    30 21.677935246115450 43.714742083338137 1.5730326889 4.1630128166 2.772940
    40 21.677935246115425 43.714742085532912 2.1054700713 5.5983379261 2.772997
    50 21.677935246115435 43.714742085120818 13.1996093543 35.5139206988 2.773050
    60 21.677935246115425 43.714742085181292 13.7318973109 36.9511529697 2.773022

     | Show Table
    DownLoad: CSV
    Table 8.  Invariants and error norms for the single soliton of Example 4 at different values of N at t = 30 comparison with different methods.
    N \Delta x \Delta t I_M I_E L_\infty \times10^3 L_2\times10^3
    2048 0.1 0.01 21.668672867630249 43.698502820622423 11.5622347894 30.1801854595
    4096 0.1 0.01 21.673965655336072 43.707782207037859 5.8537655004 15.3122195433
    8192 0.1 0.01 21.676612049188961 43.712422092540535 2.9998722998 7.8784632887
    16384 0.1 0.01 21.677935246115450 43.714742083338137 1.5730326889 4.1630128166
    32768 0.1 0.01 21.678596844578685 43.715902090745146 0.8598416802 2.3078805322
    32768 0.125 0.125 21.678596844578667 43.695652293217044 31.3914760561 77.6256082731
    Comparison of methods
    Lie–Trotter [21] 0.125 0.125 - - 8.72888 28.9336
    Strang [21] 0.125 0.125 - - 9.33938 24.1393
    [39] 0.125 0.125 - - 214.488 805.629
    [23] 0.125 0.125 - - 197.127 518.662

     | Show Table
    DownLoad: CSV

    To simulate the interaction between two solitary waves, consider the Eq (1.6) with the following parameters a = 1 , b = 1 , c = 1 , d = 0.5 , e = 0 , h = 0.1 , \Delta t = 0.01 , v_1 = 0.3 , v_2 = 0.5 , x_1 = -70 , and x_2 = -35 across the spatial domain x \in [-100,400] , which represents the Rosenau-KdV equation. The initial condition, defined as the linear sum of two well-separated solitary waves with different amplitudes, is expressed as:

    \begin{equation} u(x, 0) = \sum\limits_{i = 1}^{2} A_{i}\operatorname{sech}^{4}[B_{i}(x-x_{i})], \\ \end{equation} (3.20)

    such that

    \begin{equation} A_{i} = \frac{210 b B_{i}^{2}}{13 d} ; \quad B_{i} = \Bigg |\sqrt{\frac{b}{52 c V_{i}}}\Bigg | ;\quad i = 1, 2, \end{equation} (3.21)

    where v_{i} and x_{i} are constants. The experiment was conducted up to t = 250 for parameters N = 8192 , illustrating the interaction of two solitary waves at different times, as depicted in Figure 9. The waves originate from positions x = -70 and x = -35 from left to right, respectively. The taller wave, characterized by a larger amplitude, travels faster than the one with a smaller amplitude. At t = 80 , the taller wave catches up to the smaller one and merges with it. Two waves interact until around t = 130 , and this interaction extends until t = 150 . By t = 250 , the interaction concludes, and the larger soliton has fully separated. Following this interaction, the waves retain their original shapes and amplitudes. Figure 10 presents a plan view and a 3D illustration of the interaction of two solitary waves. The values of the conserved quantities are denoted as I_M and I_E and have been determined and listed in Table 9. The simulation showed that the invariants remained nearly constant over time.

    Figure 9.  Interaction between two solitary waves in Example 5 with a = 1, b = 1, c = 1, d = 0.5, e = 0, v1 = 0.3, v2 = 0.5, x1 = -70, x2 = -35, N = 8192 , \Delta x = 0.1, and \Delta t = 0.01.
    Figure 10.  (a): Plan view of the interaction between two solitary waves. (b): 3D illustration between the interaction of two solitary waves of Example 5 with a = 1, b = 1, c = 1, d = 0.5, e = 0, v1 = 0.3, v2 = 0.5, x1 = -70, x2 = -35, N = 8192 , \Delta x = 0.1, and \Delta t = 0.01.
    Table 9.  The conserved quantities during the interaction of two solitary waves in Example 5 with a = 1 , b = 1 , c = 1 , d = 0.5 , e = 0 , h = 0.1 , \Delta t = 0.01 , v_1 = 0.3 , v_2 = 0.5 , x_1 = -70 , and x_2 = -35 , over the domain -100 \leq x \leq 400 .
    t I_M I_E
    0 19.352141010394462 23.452728190236975
    50 19.352141010394472 23.452601901412166
    100 19.352141010394458 23.452555193310442
    150 19.352141010394476 23.452595067709840
    200 19.352141010394465 23.452597162759467
    250 19.352141010394451 23.452597166369134

     | Show Table
    DownLoad: CSV

    To simulate the interaction of three solitary waves with different amplitudes, consider the Eq (1.6) with the following parameters a = 1 , b = 1 , c = 1 , d = 0.5 , e = 0 , h = 0.1 , \Delta t = 0.1 , v_1 = 0.3 , v_2 = 0.5 , v_3 = 0.8 , x_1 = -70 , x_2 = -40 , and x_3 = -15 over the spatial domain x \in [-100,400] , which represents the Rosenau-KdV equation, and set an initial condition as follows:

    \begin{equation} u(x, 0) = \sum\limits_{i = 1}^{3} A_{i}\operatorname{sech}^{4}[B_{i}(x-x_{i})]. \\ \end{equation} (3.22)

    The parameters \(A_i\), \(B_i\), and \(i\) are defined as follows:

    \begin{equation} A_{i} = \frac{210 b B_{i}^{2}}{13 d} ; \quad B_{i} = \Bigg |\sqrt{\frac{b}{52 c v_{i}}}\Bigg |; \quad i = 1, 2, 3, \end{equation} (3.23)

    such that v_{i} and x_{i} are constants. The simulation is conducted up to time t = 250 , and our proposed algorithm is executed with N = 8192 . In Figure 11, the results are illustrated at various time intervals. These waves travel from left to right, and each has a distinct velocity. The figure shows that the tallest wave, characterized by a larger amplitude, moves faster than the smaller waves. The interaction starts at t = 50 and persists until around t = 170 . Throughout this period, the taller wave engages with the two shorter waves reciprocally, and the shorter waves also interact with each other before eventually separating. After this interaction, the waves progress while preserving their original shapes and amplitudes, even after the simulation time of t = 250 . Figure 12 presents a plan view and a 3D illustration of the interaction of three solitary waves. Table 10 presents the values of conserved quantities throughout the simulation. It is obvious from Table 10 that the calculated invariants maintain remarkable stability during the entire computational process.

    Figure 11.  Thes interaction of the three solitary waves in Example 6 with a = 1 , b = 1 , c = 1 , d = 0.5 , e = 0 , h = 0.1 , \Delta t = 0.01 , v_1 = 0.3 , v_2 = 0.5 , v_3 = 0.8 , x_1 = -70 , x_2 = -40 , x_3 = -15 , and x \in [-100,400] at selected times.
    Figure 12.  (a): Plan view of the interaction of three solitary waves. (b): 3D illustration of the interaction among three solitary waves of Example 6 with a = 1 , b = 1 , c = 1 , d = 0.5 , e = 0 , h = 0.1 , \Delta t = 0.01 , v_1 = 0.3 , v_2 = 0.5 , v_3 = 0.8 , x_1 = -70 , x_2 = -40 , x_3 = -15 , and x \in [-100,400] .
    Table 10.  The conserved quantities during the interaction of the three solitary waves in Example 6 with a = 1 , b = 1 , c = 1 , d = 0.5 , e = 0 , h = 0.1 , \Delta t = 0.01 , v_1 = 0.3 , v_2 = 0.5 , v_3 = 0.8 , x_1 = -70 , x_2 = -40 , x_3 = -15 , and -100 \leq x \leq 400 .
    t I_M I_E
    0 26.030119128954244 27.030613490768943
    50 26.030119128954254 27.030484481965665
    100 26.030119128954261 27.030335144434130
    150 26.030119128954251 27.030471130701706
    200 26.030119128954233 27.030480691407945
    250 26.030119128954254 27.030481153013991

     | Show Table
    DownLoad: CSV

    The evolution of a train of solitons is governed by Eq (1.6) with the following parameters a = 1, b = 1, d = 0.5, and e = 0 , which represents the Rosenau-KdV equation. The development of a train of solitons determined by the Rosenau-KdV equation will be evaluated using a Gaussian initial condition:

    \begin{equation} u(x, 0) = \exp[-(x-40)^{2}] . \end{equation} (3.24)

    Consider the boundary condition as:

    \begin{equation} u(-50, t) = u(250, t) , \quad t > 0 . \end{equation} (3.25)

    To explore the behavior of the solution for different values of c , consider the impact of these particular c values on its dependence, c = 0.5, 0.1, 0.05 , and 0.01 , h = 0.1 , \Delta t = 0.01 , within the time interval 0 \leq t \leq 14 , and over the spatial domain x \in [-50,250] . The numerical computations are performed up to t = 14 . Figure 13 displays the evolution of the Gaussian initial condition into solitons at t = 10 . The values of the two invariants of motion are presented in Table 11 for different c values, illustrating the constancy of these invariants as time advances. This demonstrates the presence of oscillating solitons, and the number of oscillating solitons depends on the value of c . A decrease in the value of c leads to an increase in the number of oscillating solitons.

    Figure 13.  Waves resulting from the Gaussian initial condition described in Example 7 with a = 1 , b = 1 , d = 0.5 , e = 0 , v = 1.18 , h = 0.1 , \Delta t = 0.01 , x \in [-50,250] , and different values of c at t = 10 .
    Table 11.  Invariants associated with the Gaussian initial condition, as in Example 7, across various values of c at 0 \leq t \leq 14 , with a = 1 , b = 1 , d = 0.5 , e = 0 , v = 1.18 , h = 0.1 , \Delta t = 0.01 , -50 \leq x \leq 250 .
    c=0.5 c=0.1
    t I_M I_E I_M I_E
    0 1.772237486910044 3.133820984974885 1.772237486910044 1.629293112888655
    2 1.772237486910047 3.133237313798476 1.772237486910045 1.628721098523413
    4 1.772237486910043 3.133573315250525 1.772237486910043 1.628819101869206
    6 1.772237486910044 3.133132582210868 1.772237486910043 1.628989812794706
    8 1.772237486910046 3.133625933359089 1.772237486910046 1.628971191156475
    10 1.772237486910045 3.133332831613470 1.772237486910045 1.628947943212157
    12 1.772237486910043 3.133416253582500 1.772237486910044 1.628938811401362
    14 1.772237486910046 3.133438843929645 1.772237486910043 1.628938774175789
    c=0.05 c=0.01
    I_M I_E I_M I_E
    0 1.772237486910044 1.441227128877877 1.772237486910044 1.290774341669254
    2 1.772237486910043 1.440883444814180 1.772237486910045 1.290621937574925
    4 1.772237486910043 1.441009452846298 1.772237486910045 1.290609096773492
    6 1.772237486910046 1.441013586107876 1.772237486910043 1.290625441218467
    8 1.772237486910045 1.440970135019521 1.772237486910046 1.290632027428226
    10 1.772237486910045 1.440932082819944 1.772237486910043 1.290623276335061
    12 1.772237486910044 1.440929794432098 1.772237486910046 1.290621153719395
    14 1.772237486910043 1.440921837459404 1.772237486910046 1.290627760084339

     | Show Table
    DownLoad: CSV

    For the evolution of a train of solitons, consider the Eq (1.6) with the following parameters a = 1 , b = 1 , c = 1 , d = 0.5 , e = 0 , v = 1.18 , h = 0.1 , \Delta t = 0.01 , u_0 = 1 , x_0 = 25 , and d = 5 , which represents the Rosenau-KdV equation. The equation is examined utilizing the undular bore initial condition expressed as:

    \begin{equation} u(x, 0) = \frac{1}{2} u_{0}[1- \tanh (\frac{|x|-x_{0}}{d})]. \end{equation} (3.26)

    The provided boundary condition is expressed as:

    \begin{equation} u(-50, t) = u(350, t) , \quad t > 0 . \end{equation} (3.27)

    To investigate the generation of a train of solitons within the Rosenau-KdV, we examine the impact of parameter c . These solitons represent an undular bore, which reflects the water's surface above the equilibrium level at t = 0 . The computational simulation runs until time t = 150 . Figure 14 displays that simulation reveals the transformation of the initial perturbation into a train of solitons at specific time intervals. Over time, the evolution becomes evident as six solitons propagate to the right. The numerical results, which include two conserved quantities, are presented in Table 12, showing that these quantities are preserved.

    Figure 14.  Developed train solitons for undular bore initial condition of Example 8 at selected times with v = 1.18, h = 0.1, \Delta t = 0.01, a = 1, b = 1, c = 1, d = 0.5, e = 0, and x \in [-50,350] .
    Table 12.  Invariants associated with the undular bore initial condition as in Example 8 with v = 1.18 , h = 0.1 , \Delta t = 0.01 , a = 1 , b = 1 , c = 1 , d = 0.5 , e = 0 , and x \in [-50,350] at t \in [0,150] .
    t I_M I_E
    0 49.994123436028708 44.999228972625303
    25 49.994123436028701 44.999321125767089
    50 49.994123436028737 44.999466996781024
    75 49.994123436028701 44.999526896758091
    100 49.994123436028701 44.999544395471474
    125 49.994123436028723 44.999553042657546
    150 49.994123436028715 44.999552868273128

     | Show Table
    DownLoad: CSV

    This article presents a combination of the Fourier spectral method and the central difference method. The accuracy and efficiency of the combined scheme were assessed by computing error norms and conservation properties related to the GR-KDV-RLW equation. The numerical results obtained are satisfactory and comparable to other solutions in the literature. The approach exhibits better accuracy compared to the previously presented results when N increases and \Delta x , \Delta t are decreased. Furthermore, our method can be applied to similar types of PDEs that model real-life problems, which makes it useful for further research in various scientific fields, such as materials science and engineering.

    The authors declare that they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors declare that they have no conflicts of interest.



    [1] Pawar N, Bhingarkar S (2020) Machine Learning based Sarcasm Detection on Twitter Data. 2020 5th International Conference on Communication and Electronics Systems (ICCES), 957‒961. https://doi.org/10.1109/ICCES48766.2020.9137924 doi: 10.1109/ICCES48766.2020.9137924
    [2] Suhaimin MSM, Hijazi MHA, Alfred R, et al. (2017) Natural language processing based features for sarcasm detection: An investigation using bilingual social media texts. 2017 8th International Conference on Information Technology (ICIT), 703‒709. https://doi.org/10.1109/ICITECH.2017.8079931 doi: 10.1109/ICITECH.2017.8079931
    [3] Bharti SK, Babu KS, and Raman R (2017) Context-based Sarcasm Detection in Hindi Tweets. 2017 9th Int. Conf. Adv. Pattern Recognition, ICAPR, 1–6. https://doi.org/10.1109/ICAPR.2017.8593198 doi: 10.1109/ICAPR.2017.8593198
    [4] Zhang M, Zhang Y, Fu G (2016) Tweet sarcasm detection using deep neural network. COLING 2016 - 26th Int. Conf. Comput. Linguist. Tech. Pap., 2449–2460.
    [5] Athira MR, Chithra C, Anil G, et al. (2020) Sentiment Analysis - Sarcasm Detection in Twitter. Journal of Computer Engineering (IOSR-JCE) 22: 42–46. https://doi.org/10.9790/0661-2204024246 doi: 10.9790/0661-2204024246
    [6] Prasad AG, Sanjana S, Bhat SM, and B. S. Harish (2017) Sentiment analysis for sarcasm detection on streaming short text data. 2017 2nd International Conference on Knowledge Engineering and Applications (ICKEA), 1‒5. https://doi.org/10.1109/ICKEA.2017.8169892 doi: 10.1109/ICKEA.2017.8169892
    [7] Bindra KK, Prof A, Gupta A (2016) Tweet Sarcasm : Mechanism of Sarcasm Detection in Twitter. International Journal of Computer Science and Information Technologies 7: 215–217.
    [8] Bharti SK, Vachha B, Pradhan RK, et al. (2016) Sarcastic sentiment detection in tweets streamed in real-time: a big data approach. Digit Commun Netw 2: 108–121. https://doi.org/10.1016/j.dcan.2016.06.002 doi: 10.1016/j.dcan.2016.06.002
    [9] Sarsam SM, Al-Samarraie H, Alzahrani AI, et al. (2020) Sarcasm detection using machine learning algorithms in Twitter: A systematic review. Int J Market Res 62: 578–598. https://doi.org/10.1177/1470785320921779 doi: 10.1177/1470785320921779
    [10] Bouazizi M, Ohtsuki T (2015) Sarcasm Detection in Twitter: "All Your Products Are Incredibly Amazing!!!" - Are They Really? 2015 IEEE Global Communications Conference (GLOBECOM), 1‒6. https://doi.org/10.1109/GLOCOM.2015.7417640 doi: 10.1109/GLOCOM.2015.7417640
    [11] Eke CI, Norman AA, Shuib L, et al. (2020) Sarcasm identification in textual data: systematic review, research challenges, and open directions. Artif Intell Rev 53: 4215–4258. https://doi.org/10.1007/s10462-019-09791-8 doi: 10.1007/s10462-019-09791-8
    [12] Saha S, Yadav J, Ranjan P (2017) Proposed Approach for Sarcasm Detection in Twitter. Indian J Sci Technol 10: 1–8. https://doi.org/10.17485/ijst/2017/v10i25/114443 doi: 10.17485/ijst/2017/v10i25/114443
    [13] Sharma S, Chakraverty S (2018) SARCASM DETECTION IN ONLINE REVIEW TEXT. 1674–1679.
    [14] Wen Z, Gui L, Wang Q, et al. (2022) Sememe knowledge and auxiliary information enhanced approach for sarcasm detection. Inf Process Manag 59: 102883. https://doi.org/10.1016/j.ipm.2022.102883 doi: 10.1016/j.ipm.2022.102883
    [15] Pawar N, Bhingarkar S (2020) Machine learning-based sarcasm detection on Twitter data. Proc 5th Int Conf Commun Electron Syst ICCES 2020, 957–961. https://doi.org/10.1109/ICCES48766.2020.9137924 doi: 10.1109/ICCES48766.2020.9137924
    [16] Halim Z, Waqar M, Tahir M (2020) A machine learning-based investigation utilizing the in-text features for the identification of dominant emotion in an email. Knowledge-Based Syst 208: 106443. https://doi.org/10.1016/j.knosys.2020.106443 doi: 10.1016/j.knosys.2020.106443
    [17] Jain T, Agrawal N, Goyal G, et al. (2017) Sarcasm detection of tweets: A comparative study. 2017 Tenth International Conference on Contemporary Computing (IC3), 1‒6, https://doi.org/10.1109/IC3.2017.8284317 doi: 10.1109/IC3.2017.8284317
    [18] Biere S, Bhulai S, Analytics MB (2018) Hate Speech Detection Using Natural Language Processing Techniques. Vrije Univ. Amsterdam.
    [19] Konduri V, Padathula S, Pamu A, et al. (2020) Hate Speech Classification of social media posts using Text Analysis and Machine Learning. Oklahoma State University.
    [20] Panda S, Kusum (2020) Detecting Twitter's Impact on COVID-19 Pandemic in India. Int J Innov Technol Explor Eng 9: 815–819. https://doi.org/10.35940/ijitee.H6718.069820 doi: 10.35940/ijitee.H6718.069820
    [21] Amer AYA, Siddiqui T (2020) Detection of Covid-19 Fake News text data using Random Forest and Decision tree Classifiers. International Journal of Computer Science and Information Security IJCSIS 18: 88–100. https://doi.org/10.5281/zenodo.4427204 doi: 10.5281/zenodo.4427204
    [22] Shaalan K, Hassanien AE, Tolba F (2018) Intelligent Natural Language Processing: Trends and Applications. vol. 740, Springer. https://doi.org/10.1007/978-3-319-67056-0
    [23] Salloum SA, Al-Emran M, Monem AA, et al. (2018) Using text mining techniques for extracting information from research articles. Studies in Computational Intelligence 740: 373–397. https://doi.org/10.1007/978-3-319-67056-0_18 doi: 10.1007/978-3-319-67056-0_18
    [24] Kowsari K, Meimandi KJ, Heidarysafa M, et al. (2019) Text classification algorithms: A survey. Information 10: 150. https://doi.org/10.3390/info10040150 doi: 10.3390/info10040150
    [25] Nhlabano VV, Lutu PEN (2018) Impact of Text Preprocessing on the Performance of Sentiment Analysis Models for Social Media Data. 2018 Int Conf Adv Big Data, Comput Data Commun Syst icABCD, 1–6. https://doi.org/10.1109/ICABCD.2018.8465135 doi: 10.1109/ICABCD.2018.8465135
    [26] Dawei W, Alfred R, Obit JH, et al. (2021) A Literature Review on Text Classification and Sentiment Analysis Approaches. Lect Notes Electr Eng 724: 305–323. https://doi.org/10.1007/978-981-33-4069-5_26 doi: 10.1007/978-981-33-4069-5_26
    [27] Zhou Z, Guan H, Bhat MM, et al. (2019) Fake news detection via NLP is vulnerable to adversarial attacks. ICAART 2019 - Proc 11th Int Conf Agents Artif Intell 2: 794–800. https://doi.org/10.5220/0007566307940800 doi: 10.5220/0007566307940800
    [28] Mansour S (2018) Social media analysis of user's responses to terrorism using sentiment analysis and text mining. Procedia Comput Sci 140: 95–103. https://doi.org/10.1016/j.procs.2018.10.297 doi: 10.1016/j.procs.2018.10.297
    [29] Ahmad I, Yousaf M, Yousaf S, et al. (2020) Fake News Detection Using Machine Learning Ensemble Methods. Complexity 2020: 680–685. https://doi.org/10.1155/2020/8885861 doi: 10.1155/2020/8885861
    [30] Sharmin S, Zaman Z (2018) Spam detection in social media employing machine learning tool for text mining. Proc - 13th Int Conf Signal-Image Technol Internet-Based Syst SITIS 2017, 137–142. https://doi.org/10.1109/SITIS.2017.32 doi: 10.1109/SITIS.2017.32
    [31] Neeraja M, Prakash J (2016) Detecting Malicious Posts in Social Networks Using Text Analysis. International Journal of Science and Research (IJSR) 5: 345–347. https://doi.org/10.21275/v5i6.NOV164091 doi: 10.21275/v5i6.NOV164091
    [32] Hussain MG, Hasan MR, Rahman M, et al. (2020) Detection of Bangla Fake News using MNB and SVM Classifier. 2020 International Conference on Computing, Electronics & Communications Engineering (iCCECE). https://doi.org/10.1109/iCCECE49321.2020.9231167 doi: 10.1109/iCCECE49321.2020.9231167
    [33] Neha D, Vidyavathi BM (2015) A Survey on Applications of Data Mining using Clustering Techniques. International Journal of Computer Applications 126: 7–12. https://doi.org/10.5120/ijca2015905986 doi: 10.5120/ijca2015905986
    [34] Kaur R, Singh S (2016) FULL-LENGTH ARTICLE A survey of data mining and social network analysis based anomaly detection techniques. Egypt Informatics J 17: 199–216. https://doi.org/10.1016/j.eij.2015.11.004 doi: 10.1016/j.eij.2015.11.004
    [35] Sharath KA, Singh S (2013) Detection of user cluster with suspicious activity in online social networking sites. Proc - 2nd Int Conf Adv Comput Netw Secur ADCONS 2013, 220–225. https://doi.org/10.1109/ADCONS.2013.17 doi: 10.1109/ADCONS.2013.17
    [36] Al Mansoori S, Almansoori A, Alshamsi M, et al. (2020) Suspicious Activity Detection of Twitter and Facebook using Sentimental Analysis. TEM JOURNAL - Technology, Education, Management, Informatics TEM J 9: 1313–1319. https://doi.org/10.18421/TEM94-01 doi: 10.18421/TEM94-01
    [37] Rajeswari K, Shanthibala P (2018) SARCASM DETECTION USING MACHINE LEARNING TECHNIQUES. Int J Recent Sci Res 9: 26368–26372. http://dx.doi.org/10.24327/ijrsr.2018.0904.2046 doi: 10.24327/ijrsr.2018.0904.2046
    [38] Chen J, Yan S, Wong KC (2018) Verbal aggression detection on Twitter comment : convolutional neural network for short-text sentiment analysis. Neural Comput Appl 32: 10809‒10818. https://doi.org/10.1007/s00521-018-3442-0 doi: 10.1007/s00521-018-3442-0
    [39] Li Y, Li T (2013) Deriving market intelligence from microblogs. Decis Support Syst 55: 206–217. https://doi.org/10.1016/j.dss.2013.01.023 doi: 10.1016/j.dss.2013.01.023
    [40] Kharde VA, Sonawane SS (2016) Sentiment Analysis of Twitter Data: A Survey of Techniques. International Journal of Computer Applications 139: 5–15. https://doi.org/10.5120/ijca2016908625 doi: 10.5120/ijca2016908625
    [41] Joshi S, Deshpande D (2018) Twitter Sentiment Analysis System. International Journal of Computer Applications 180: 35–39. https://doi.org/10.5120/ijca2018917319 doi: 10.5120/ijca2018917319
    [42] Rui H, Liu Y, Whinston A (2013) Whose and what chatter matters? The effect of tweets on movie sales. Decis Support Syst 55: 863–870. https://doi.org/10.1016/j.dss.2012.12.022 doi: 10.1016/j.dss.2012.12.022
    [43] Ghosh D, Guo W, Muresan S (2015) Sarcastic or not: Word embeddings to predict the literal or sarcastic meaning of words. Conf Proc - EMNLP 2015 Conf Empir Methods Nat Lang Process, 1003–1012. https://doi.org/10.18653/v1/D15-1116 doi: 10.18653/v1/D15-1116
    [44] Khodak M, Saunshi N, Vodrahalli K (2018) A large self-annotated corpus for sarcasm. Proceedings of the Eleventh International Conference on Language Resources and Evaluation (LREC 2018).
    [45] Rahman AU, Halim Z (2022) Identifying dominant emotional state using handwriting and drawing samples by fusing features. Appl Intell 2022: 1‒17. https://doi.org/10.1007/s10489-022-03552-x doi: 10.1007/s10489-022-03552-x
    [46] Halim Z, Ali O, Khan MG (2021) On the Efficient Representation of Datasets as Graphs to Mine Maximal Frequent Itemsets. IEEE T Knowl Data Eng 33: 1674–1691. https://doi.org/10.1109/TKDE.2019.2945573 doi: 10.1109/TKDE.2019.2945573
    [47] Savini E, Caragea C (2022) Intermediate-Task Transfer Learning with BERT for Sarcasm Detection. Mathematics 10: 844. https://doi.org/10.3390/math10050844. doi: 10.3390/math10050844
    [48] Halim Z, Rehan M (2020) On identification of driving-induced stress using electroencephalogram signals: A framework based on wearable safety-critical scheme and machine learning. Inf Fusion 53: 66–79. https://doi.org/10.1016/j.inffus.2019.06.006 doi: 10.1016/j.inffus.2019.06.006
  • This article has been cited by:

    1. Taniya Mukherjee, Isha Sangal, Biswajit Sarkar, Qais Ahmed Almaamari, Logistic models to minimize the material handling cost within a cross-dock, 2022, 20, 1551-0018, 3099, 10.3934/mbe.2023146
    2. Mrudul Y. Jani, Manish R. Betheja, Urmila Chaudhari, Biswajit Sarkar, Effect of Future Price Increase for Products with Expiry Dates and Price-Sensitive Demand under Different Payment Policies, 2023, 11, 2227-7390, 263, 10.3390/math11020263
    3. Raj Kumar Bachar, Shaktipada Bhuniya, Ali AlArjani, Santanu Kumar Ghosh, Biswajit Sarkar, A sustainable smart production model for partial outsourcing and reworking, 2023, 20, 1551-0018, 7981, 10.3934/mbe.2023346
    4. Shubham Kumar Singh, Anand Chauhan, Biswajit Sarkar, Supply Chain Management of E-Waste for End-of-Life Electronic Products with Reverse Logistics, 2022, 11, 2227-7390, 124, 10.3390/math11010124
    5. Ata Allah Taleizadeh, Mohammad Sadegh Moshtagh, Behdin Vahedi-Nouri, Biswajit Sarkar, New products or remanufactured products: Which is consumer-friendly under a closed-loop multi-level supply chain?, 2023, 73, 09696989, 103295, 10.1016/j.jretconser.2023.103295
    6. Raj Kumar Bachar, Shaktipada Bhuniya, Santanu Kumar Ghosh, Biswajit Sarkar, Controllable Energy Consumption in a Sustainable Smart Manufacturing Model Considering Superior Service, Flexible Demand, and Partial Outsourcing, 2022, 10, 2227-7390, 4517, 10.3390/math10234517
    7. Bikash Koli Dey, Mitali Sarkar, Kripasindhu Chaudhuri, Biswajit Sarkar, Do you think that the home delivery is good for retailing?, 2023, 72, 09696989, 103237, 10.1016/j.jretconser.2022.103237
    8. Zahra Davoudi, Mehdi Seifbarghy, Mitali Sarkar, Biswajit Sarkar, Effect of bargaining on pricing and retailing under a green supply chain management, 2023, 73, 09696989, 103285, 10.1016/j.jretconser.2023.103285
    9. Rubayet Karim, Koichi Nakade, A Literature Review on the Sustainable EPQ Model, Focusing on Carbon Emissions and Product Recycling, 2022, 6, 2305-6290, 55, 10.3390/logistics6030055
    10. Subrata Saha, Biswajit Sarkar, Mitali Sarkar, Application of improved meta-heuristic algorithms for green preservation technology management to optimize dynamical investments and replenishment strategies, 2023, 03784754, 10.1016/j.matcom.2023.02.005
    11. Mowmita Mishra, Santanu Kumar Ghosh, Biswajit Sarkar, Maintaining energy efficiencies and reducing carbon emissions under a sustainable supply chain management, 2022, 9, 2372-0352, 603, 10.3934/environsci.2022036
    12. Dharmendra Yadav, Umesh Chand, Ruchi Goel, Biswajit Sarkar, Smart Production System with Random Imperfect Process, Partial Backordering, and Deterioration in an Inflationary Environment, 2023, 11, 2227-7390, 440, 10.3390/math11020440
    13. Biswajit Sarkar, Sumi Kar, Kajla Basu, Yong Won Seo, Is the online-offline buy-online-pickup-in-store retail strategy best among other product delivery strategies under variable lead time?, 2023, 73, 09696989, 103359, 10.1016/j.jretconser.2023.103359
    14. Bikash Koli Dey, Hyesung Seok, Kwanghun Chung, Optimal Decisions on Greenness, Carbon Emission Reductions, and Flexibility for Imperfect Production with Partial Outsourcing, 2024, 12, 2227-7390, 654, 10.3390/math12050654
    15. Biswajit Sarkar, Bikash Koli Dey, Is online-to-offline customer care support essential for consumer service?, 2023, 75, 09696989, 103474, 10.1016/j.jretconser.2023.103474
    16. Lalremruati Lalremruati, Aditi Khanna, Analysing a lean manufacturing inventory system with price-sensitive demand and carbon control policies, 2023, 57, 0399-0559, 1797, 10.1051/ro/2023060
    17. Ernesto A. Lagarda-Leyva, María Paz Guadalupe Acosta-Quintana, Javier Portugal-Vásquez, Arnulfo A. Naranjo-Flores, Alfredo Bueno-Solano, System Dynamics and Sustainable Solution: The Case in a Large-Scale Pallet Manufacturing Company, 2023, 15, 2071-1050, 11766, 10.3390/su151511766
    18. Najibeh Usefi, Mehdi Seifbarghy, Mitali Sarkar, Biswajit Sarkar, A bi-objective robust possibilistic cooperative gradual maximal covering model for relief supply chain with uncertainty, 2023, 57, 0399-0559, 761, 10.1051/ro/2022204
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(13417) PDF downloads(265) Cited by(4)

Figures and Tables

Figures(7)  /  Tables(9)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog