Abstract

This study presents a new algorithm for effectively solving the nonlinear coupled Drinfeld’s–Sokolov–Wilson (DSW) system using a hybrid explicit finite difference technique with the Adomian polynomial (EFD-AP). The suggested approach addresses the problem of accurately solving the DSW system. Numerical results are obtained by comparing the exact solution with absolute and mean square errors using a test problem to assess the EFD-AP accuracy against the exact solution and the conventional explicit finite difference (EFD) method. The results exhibit excellent agreement between the approximate and exact solutions at different time values, and the results showed that the proposed EFD-AP method achieves superior accuracy and efficiency compared to the EFD method, which makes it a promising method for solving nonlinear partial differential systems of higher order.

1. Introduction

The exploration of nonlinear equations has a long and storied history, dating back to ancient civilizations. Mathematicians of the past were driven to address challenges involving curved shapes and nonlinear phenomena. However, it was not until the 17th century when Sir Isaac Newton and Gottfried Wilhelm Leibniz developed calculus that the fundamental groundwork for solving nonlinear equations began to take shape. Throughout the centuries, renowned figures in the world of mathematics and science, such as Lagrange, Gauss, and Poincaré, made substantial contributions to the theory and methods for solving nonlinear equations [1].

In the 18th and 19th centuries, the finite difference method emerged as a numerical technique for approximating solutions to differential equations [2]. Initially, it was applied to linear equations, but its popularity surged with the advent of digital computers in the mid-20th century. The finite difference method involves discretizing the continuous domain by dividing it into a grid of discrete points and approximating derivatives using finite difference formulas. This approach effectively transforms differential equations into systems of algebraic equations, enabling numerical solutions. The scope of the finite difference method expanded to encompass nonlinear equations, rendering it a potent tool for addressing challenges in fields such as physics, engineering [3], and finance. Various fields, including mathematical physics, theoretical physics, and integrable systems, heavily rely on the coupled Drinfeld’s–Sokolov–Wilson (DSW) system. Its applications encompass understanding soliton solutions in nonlinear wave equations, shedding light on quantum fields and string theories, and exploring nonlinear dynamics, chaos theory, and nonlinear optical phenomena, particularly in optical fiber technology. Moreover, it plays a vital role in information theory, quantum computing, and mathematical modeling across numerous physical domains. In the academic realm, the DSW system serves as an invaluable resource for advanced studies and instruction in mathematics and physics [4].

In summary, nonlinear equations boast a rich historical background and the development of the finite difference method has been pivotal in enabling numerical solutions. These advancements have significantly enhanced our grasp of intricate nonlinear phenomena and our capacity to address real-world challenges. For instance, methods such as the Adomian decomposition method with modified Bernstein polynomials [5], Bernstein polynomials in conjunction with artificial neural networks [6], and the Elzaki decomposition method for tackling higher-order integrodifferential equations have all contributed to this progress [714]. The formula for the Drinfeld’s–Sokolov–Wilson (DSW) system also plays a critical role in this context [1418].

In the system of (1) and (2), p, q, r, and s are nonzero constants, originally introduced by Drinfeld, Sokolov [8], and Wilson [1], and they represent a model for water waves and find extensive applications in the field of fluid dynamics. Over the years, various numerical and analytical methods have been developed to address these equations, including the Adomian decomposition method [16], the exp-function method [10], the improved F-expansion method [19], the bifurcation method [20], and qualitative theory [21]. These methods offer diverse approaches to solve systems (1) and (2), contributing to a better understanding of their behavior and properties. Traditionally, techniques such as the inverse scattering transform, Hirota’s bilinear method, and other integrable methods have been employed to analyze the DSW system.

The motivation behind this research is to introduce a novel hybrid approach that combines the finite difference method with the Adomian polynomial. This hybrid method aims to address the nonlinear term in the DSW system and handle cases where points fall outside the solution region. By doing so, this innovative technique enhances the accuracy and efficiency of the solution while dealing with the nonlinearities present in the system. In this research, we cover fundamental concepts, the mathematical formulation of the EFD and EFD-AP methods, their respective algorithms, the convergence analysis of EFD-AP, and their practical application, see [2224].

2. Main Concepts

2.1. Explicit Finite Difference (EFD) Method

The equations in question contain a third derivative term, which presents a distinctive challenge that calls for the adoption of a specialized numerical solution method. The peculiar impact of the third derivative on these equations and their behavior makes it necessary to employ a different approach or method to ensure accurate and efficient problem solving. To address this, we will utilize the following set of discrete equations [25].

Forward formulas:

Central formulas:

Backward formulas:

2.2. The Adomian Polynomial (AP)

The method assumes that the nonlinear term can be approximated by an infinite series of polynomials expressed in a specific form.where are the Adomian polynomials [26] defined as , where n = 0, 1, 2, …

Now,

The Adomian decomposition method’s stability was examined in the research conducted by Azim and Hosseini [27]. Furthermore, the analysis of its convergence was established by Ahmed [28] and Zhang [19].

3. Methodology

In this section, the finite difference method involves solving the DSW system by substituting the derivatives in (1) and (2) with central finite difference derivatives as given in (7) and (9). This transformation converts the system into a set of regular algebraic equations that can be solved using standard methods to determine the values of certain variables. On the other hand, the hybrid method, which is the EFD-AP method, relies on replacing the nonlinear component in the finite differences with central derivatives. After this substitution, we simplify the system, resulting in a set of algebraic equations that are solved to obtain the values of u and .

3.1. Mathematical Formulation of the EFD Method for the DSW System

When applying the EFD method, solutions appear outside the region and, therefore, this case is dealt with in the second equation of the system in the following manner.

Divide the rectangle into and of rectangles length of each side () and (). We start from  =  = 0, where the solution values are calculated from the initial conditions as follows:

Then, the calculation of approximations is explained for and , and the grid points of the other rows and the solution method will be as follows.

To calculate the approximate value of the solution we use (3) and the central finite difference (7), and substituting them into (1), we get

Let α =  and by rearranging the above equation, we get

This equation computes the value of the solution at level from the known values of level at from (1), and to calculate approximate values for the solution when i = 1, we use forward difference equations (3), (4), and (6), and substituting them into (2), we get

Suppose that and by rearranging the above equation, we get

Equation (19) denotes the solution at point on the grid.

To determine the remaining approximate values where i is in the range of 2, 3, … , n − 2 within the same row, we substitute the central (7) and (9) into (2) as follows:

By compensating for values of α, β, and µ and rearranging equation (20), we get

Equation (21) computes the value of the solution at level using the known values of level at

Subsequently, we can calculate the values of at level when .

Similarly, by substituting the backward equations (10) and (12) into (2) and rearranging, we obtain

This equation calculates the solution at the point of the grid.

Upon examining the central numerical approximation of the third derivative as defined in (22), we observe that the two approximate solutions computed at grid node locations include values for points situated beyond the boundaries of the solution domain and these values remain unknown. Furthermore, the boundary conditions cannot be applied to these points as they do not fall within the boundary constraints. It is important to highlight that the local truncation error for these points is significant that the local truncation error for the method is ; the method is stable and its stability condition is (Algorithm 1).

Input: the values of a, , and confections , number of space fragmentation , and for time
Step 1: evaluate space step size and time step size.
Step 2: find the values of α = T/2H, β = , and µ = 
Step 3: compute the initial condition and boundary conditions
, ,
,
, , .
Step 4: compute the numerical solution from
where j = 1, 2, …, m − 1, and i = 1, 2, …, n − 1
Step 5: compute the numerical solution from
where i = 1 and for i = n − 1 compute the numerical solution from
Step 6: compute the numerical solution for i = 2, 3, …, n − 2 from
Step 7: print the numerical solutions and .
3.2. Mathematical Formulation of the EFD-AP Method

To calculate the approximate value of the solution , we substitute the central finite difference (7) into (1), and in the second step, we substitute the Adomian polynomial into (22), i.e., , where

Now, by replacing the above derivative by the finite differences formulaand by compensating equation (24) in (1), we obtain

This equation computes the value of the solution at level from the known values of level at from (1).

To calculate approximate values for the solution when i = 1, we use forward difference equations (3), (4), and (6), and substituting them into (2), we getwhere and are Adomian polynomials as follows:

Now, by replacing the above derivative by the finite differences formula, and so on, we obtainwhere .

To determine the remaining approximate values where i is in the range of 2, 3, … , n − 2 within the same level, we substitute the central equations into equation (2) as follows:

Subsequently, we can calculate the values of at the level when .

Similarly, by substituting the backward equations (10) and (12) into (2) and rearranging, we obtain

By expressing nonlinearities through Adomian polynomials, we can enhance the precision in approximating nonlinear components. This has the potential to result in a more precise overall solution, particularly when extending the polynomial expansion to higher degrees. In addition, augmenting the number of terms in the Adomian polynomial can boost the efficiency of the method proposed. However, choosing the optimal number of terms in the Adomian expansion to strike a balance between accuracy and computational efficiency can be a challenging task. Similar to other numerical methods, errors have the potential to propagate and amplify, especially if not applied correctly.

3.2.1. Convergence Analysis of the EFD-AP Method

Consider the approximate solution for the DSW system from (25) and the exact solutions of this system , and all the necessary derivatives of , exist and from (25), we havewhere is the local truncation error.

Defining the function  =  and then subtracting (25) from (32), we get

The initial and boundary conditions are , and .

Define the function ||, and ||where T = . , then

This is trivially true for the cases i = 0 and i = n + 1.and from the initial condition andby induction, we can show that .

Since  = , then  =  and

We have convergence if keeping fixed and letting ; we note that since then and therefore , which gives the convergence.

By the same approach, we have the approximate solution from (30); similarly, if we take the approximate solution from (29) and (31), we obtain

By defining the function  = , we get

In these three cases, we have , which gives the convergence.

It is worth mentioning that the proposed method is stable and its stability condition is (Algorithm 2).

Input: the values of a, , , and confections , number of space fragmentation , and for time
Step 1: evaluate space step size and time step size.
Step 2: find the values of α = T/2H, β = , and µ = 
Step 3: compute the initial condition and boundary conditions
, ,
,
, , .
Step 4: calculate the Adomian polynomials
Step 5: compute the numerical solution from
.
where j = 1, 2, …, m − 1, and i = 1, 2, …, n − 1
compute the numerical solution at i = 1 from
and the numerical solution at i = n − 1 from
.
Step 6: when i = 2, 3, …, n − 2, compute the numerical solution from .
Step 7: print the numerical solutions u(x, t) and (x, t).

4. Numerical Application

The analytic solution of the DSW system given by [2, 29] is as follows:

To assess the accuracy and convergence of the numerical solution in comparison to the exact solution (as outlined in (41) and (42)), we will employ two error criteria, namely, the absolute error (ABSE) and the mean square error (MSE). These error metrics enable us to quantitatively evaluate how closely the numerical solution aligns with the exact solution. The application of these error measures yields valuable insights into the effectiveness and reliability of the numerical method being used.

When equations (1) and (2) are solved by equations (3), (4), (6), (7), (9), (10), and (12), the results are shown in Tables 1 and 2, all computations we fixed , and are the number of iterations by using MATLAB R2022a.

Comparing Tables 1 and 2, it becomes evident that the MSE values obtained through the proposed technique surpass those achieved by the explicit approach. This implies that better results can be achieved using the proposed method. In addition, Figures 1 and 2 depict the exact solution alongside the numerical solutions generated by the EFD and EFD-AP methods for both u and . These visual representations correspond to specific parameter values, namely, a = 0, c = 2, t = 0.01, H = 0.4, k = 0.002, and s = 5, where “s” denotes the number of iterations in 2D and 3D, respectively.

These results underscore the efficiency of the EFD-AP method in adeptly managing the nonlinearity within the equation, leading to accurate and efficient solutions. In addition, the comparison of outcomes derived from the EFD-AP and EFD methods against the exact solution further reinforces this point.

5. Conclusion

In this study, we introduce a novel approach called EFD-AP, which integrates the finite difference method with the Adomian polynomial to address the nonlinearity within the DSW system. This innovative method offers a fresh perspective on handling the nonlinear aspects of the equations, resulting in improved accuracy and efficiency of the solutions. By combining the strengths of these two methods, our goal is to overcome the limitations of conventional numerical techniques, achieve more precise approximations for the DSW system, and address situations where points fall outside the solution region. The finite difference method provides a robust framework for discretizing the equations in space, while the Adomian polynomial offers a systematic and efficient method for solving the resulting nonlinear subproblems. We conducted a convergence analysis of the proposed method and found that EFD-AP exhibits greater stability compared to the EFD method, as shown in Figure 3, as evidenced by the results presented in Tables 1 and 2 and in Figures 14. The EFD-AP approach offers enhanced computational efficiency, higher precision, reduced mean square error, improved stability with larger time step sizes, and faster convergence. This approach also proves to be highly efficient and suitable for approximating solutions. In the future, this method can be extended to tackle nonlinear fractional systems and nonlinear fuzzy systems. In addition, there is a potential to develop new techniques by combining the homotopy method with the finite difference method.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

The research was supported by the College of Computer Sciences and Mathematics, University of Mosul, Republic of Iraq.