{'fraction_non_alphanumeric': 0.0325956937799043, 'fraction_numerical': 0.011842105263157895, 'mean_word_length': 4.976054324517513, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 1, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Numerical Method of the Line for Solving One Dimensional Initial- Boundary Singularly Perturbed Burger Equation

4 Published By: Lattice Science Publication © Copyright: All rights reserved. Retrieval Number: 100.1/ijam.B1103101121 DOI: 10.54105/ijam.B1103.101221 Journal Website: www.ijam.latticescipub.com Abstract: In this Research Method of Line is used to find the approximation solution of one dimensional singularly perturbed Burger equation given with initial and boundary conditions. First, the given solution domain is discretized and the derivative involving the spatial variable x is replaced into the functional values at each grid points by using the central finite difference method. Then, the resulting first-order linear ordinary differential equation is solved by the fifth-order Runge-Kutta method. To validate the applicability of the proposed method, one model example is considered and solved for different values of the perturbation parameter ‘ ’ and mesh sizes in the direction of the temporal variable, t. Numerical results are presented in tables in

Although PDEs have a wide range of applications to real-world problems in science and engineering, the majority of PDEs do not have analytical solutions. It is, therefore, important to be able to obtain an accurate solution numerically. Many computational methods have been developed and implemented to successfully approximate solutions for mathematical modeling in the application of PDEs. To make use of mathematical models, it is necessary to have solutions to the model equations. Generally, this requires numerical methods because of the complexity and number of equations [4] Scientists in the field of computational mathematics are trying to develop more accurate numerical methods by using computers for further application [16]. One of those numerical methods is a method of line. Burgers' equation, which belongs to the class of Navier-Stokes equation, is a fundamental partial differential equation from the model of fluid mechanics analyses [4,15]. It was first introduced by Bateman [6]. In 1948, Burgers (1939Burgers ( , 1948 introduced one-dimensional PDEs, to capture some features of turbulent fluid in a channel caused by the interaction of the opposite effects of convection and diffusion; it arises in the theory of shock waves, in turbulence problems, and continuous stochastic processes [12].
The structure of Burgers' equation is roughly similar to that of Navier-Stokes equations due to the presence of the non-linear convection term and the occurrence of the diffusion term with viscosity coefficient. So this equation can be considered as a simplified form of the Navier-Stokes equations [7], [9].
The study of the general properties of the Burgers' equation has attracted the attention of the scientific community due to its applications in various fields such as gas dynamics, heat conduction, elasticity, etc [7].
The study of the solution of Burgers' equation has been carried out for the last half-century and still, it is an active area of research to develop a better numerical scheme to approximate its solution.
Due to the wide range of the application of the one-dimensional Burgers equation, several numerical methods have been developed. Even though many numerical methods were applied to solve these types of equations.
Accordingly, more efficient and simpler numerical methods are required to solve the Burgers equation. In the literature review, many researchers have used various methods to seek the numerical solutions of 1D Burgers' equation [6]-- [10]. Similarly, the coupled and 2D Burgers' equations are solved by many researchers with different numerical methods.
Abazaria and Borhanifar presented the solution of coupled and 2D Burgers' equations by using the differential transform method (DTM).DTM is a semi-numerical-analytic technique that formalizes the Taylor series differently. The Taylor series method is computationally time-consuming for large orders and high contaminated round-off error and truncation error. Asaithambi [14] presented a Numerical solution to the Burgers' equation by using automatic differentiation. Kutluay, Esen, and Dag in [20] are presented a Numerical solution of the Burgers' equation by the least-squares quadratic B-spline finite element method. Khater [13] proposed the Chebyshev spectral collocation method for solving the coupled Burgers' equations. With pseudo-spectral methods care must be taken with the round-off error issue when higher derivatives or a large several points N is involved. For instance, the utilization of Chebyshev collocation methods incurs a rounding-off error of order (N2ke), where k is the order of the PDE and e is the machine zero. This can ruin the computed solution even if k and N are not large. Gowrisankar, S., and Natesan, S. in [15], present the numerical solution of singularly perturbed initial-boundary Burgers' equation by using an efficient robust numerical method. They provide an e-uniformly convergent numerical method for the singularly perturbed Burger. They obtain uniform convergence concerning the perturbation parameter  . Even though the method is capable of approximating Burger's equation, they failed to solve a relatively small perturbation parameter  . However, still, the accuracy of the method needs attention; because the treatment of the method used to solve the Burger equation is not trivial distribution. Even though the accuracy of the aforementioned methods needs attention, sometimes they require large memory or long computational time besides costing. So the treatments of this method present severe difficulties that have to be addressed to ensure the accuracy of the solution.
To this end, this paper aims to develop a numerical method that is capable of solving singularly perturbed initial-boundary Burger equation for any  and approximate the exact solution. The convergence has been shown in the sense of L  norm so that the local behavior of the solution is captured exactly. The stability of the present method is also investigated by using Von Neumann stability analysis techniques.

Singularly Perturbed Problem
A singular perturbation problem is one for which the perturbed problem is qualitatively different from the unperturbed problem. One typically obtains an asymptotic, but possibly divergent, expansion of the solution, which depends singularly on the parameter  . Although singular perturbation problems may appear typical, they are the most interesting problems to study because they allow one to understand qualitatively new phenomena.
The solutions of singular perturbation problems involving differential equations often depend on several widely different length of time scales. Such problems can be divided into two broad classes: layer problems, treated using the method of matched asymptotic expansions (MMAE); and multiple-scale problems, treated by the method of multiple scales (MMS) [15]. Brandt's boundary layer theory for the high Reynolds flow of a viscous fluid over a solid body is an example of a boundary layer problem and the semi-classical limit of quantum mechanics is an example of a multiple-scale problem [15]. An example of the perturbation problem is singularly perturbed Burgers' initial-boundary-value problem. Under suitable continuity and compatibility conditions on the data, the IBVP in EQs (1) has a unique solution, [15].
They used Cole-Hopf transformation which transforms the Burgers' equation to a linear diffusion equation and this diffusion equation can be solved exactly for an arbitrary initial condition with regularity assumption on the initial and boundary conditions. In addition to these, they can assure that boundary layer occurs in the solution when 0  → at the boundary of the domain x = 1; the solution varies rapidly, while away from the layer the solution changes slowly, and smoothly. The accuracy of the method is decreased.
Beckett, B, and Mackenzie have presented a numerical solution for one-dimensional convection-and reaction-diffusion problems using equidistribution of the singular component of the solution in [17]. Moreover, space-time parabolic reaction-diffusion and convection-diffusion evolution problems are analyzed by Gowrisankar and Natesan in [18], [19].

The Numerical Method of Lines
The method of lines (MOL) is a convenient procedure for solving time-dependent PDEs, which proceeds in two separate steps: Approximation of the spatial derivatives using finite differences, finite elements, or finite volume methods (or any other techniques), and time integration of the resulting semi-discrete (discrete in space, but continuous in time) ODEs [11].
The method of lines (MOL, NMOL) [5], [22], [23] is a technique for solving partial differential equations (PDEs) in which all but one dimension is discretized [22]. MOL allows standard, general-purpose methods and software, developed for the numerical integration of ODEs and DAEs, to be used [11]. Many integration routines have been developed over the years in many different programming languages and some have been published as open-source resources [24].
The method of lines most often refers to the construction or analysis of numerical methods for partial differential equations that proceeds by first discretizing the spatial derivatives only and leaving the time variable continuous.
This leads to a system of ordinary differential equations to which a numerical method for initial value ordinary equations can be applied. The method of lines in this context dates back to at least the early 1960s [11], [25]. Many papers discussing the accuracy and stability of the method of lines for various types of partial differential equations have appeared in [26], [27]. MOL requires that the PDE problem is well-posed as an initial value (Cauchy) the problem in at least one dimension because ODE and DAE integrators are initial value problem (IVP) solvers [11], [19].
Thus it cannot be used directly on purely elliptic partial differential equations, such as Laplace's equation. However, MOL has been used to solve Laplace's equation by using the method of false transients [19]. In this method, a time derivative of the dependent variable is added to Laplace's equation. Finite differences are then used to approximate the spatial derivatives and the resulting system of equations is solved by MOL. It is also possible to solve elliptical problems by a semi-analytical method of lines [29], [30]. In this method, the discretization process results in a set of ODE's that are solved by exploiting properties of the associated exponential matrix. Recently, to overcome the stability issues associated with the method of false transients, a perturbation approach was proposed which was found to be more robust than the standard method of false transients for a wide range of elliptic PDEs [31] III. DESCRIPTION OF THE METHOD, RESULTS, AND DISCUSSION

Description of the Method
Consider the following singularly perturbed Burgers' initial-boundary-value problem (IBVP) considered in [15]: subject to initial and boundary conditions: Here, where 0 <  << 1 is a small perturbation parameter 1 () fx , is continuous and differentiable functions.

Variable
Recalling that the one-dimensional singularly perturbed Burgers' initial-boundary value problem (IBVP) given in Eq (1), we aim to approximate the partial derivative of u(x,t) involving spatial variable. The given non-linear PDE in Eq(1) is reduced into the system of no linear ODEs by using the method of line. The idea of the method of the line is discretizing partial derivative involving spatial variable by using central finite difference method and the remaining part of variable is discretized. Now the discretizing of partial derivative involving a spatial variable by using central difference method is: 1, 1, 2 j n j n uu u xh , j n j n j n u u u u xh +− −+  =  (6) where j = 1,2,3,…,M in direction of special variable.

Substituting
Eqs,(5) and (6) into singularly perturbation Burger's equation given in Eq (1), we obtain the system of the non-linear differential equation of the form: wherein Eq. (7). Hence the given equation is further discretized in space for a first-order and second-order spatial derivative and then obtains a semi discretized scheme corresponding to Burger's equation. In this discretization, we consider redistributing grid points for spatial direction. The distributive of mesh point in the domain, outside and inside of boundary layer region almost equal for both spatial and temporal variables.

Results and Discussion
That method of the line is used to approximate subject to the initial condition The system of ODEs in Eq (8) has an N differential equation. Hence by introducing the vector U i.e.
where 00 () j U x U = initial condition and H is a nonlinear function of U with element is j h which is given by:  (13) where N is the number of mesh elements int-direction. Then the resulting system of ODEs in Eq (10) can now be solved by using the fifth-order Runge-Kutta method.

Stability Analysis
In this section, the stability of the proposed numerical method is investigated by using Von-Neumann stability analysis. To do these we assumed the non-linear term uux of partial differential equation in Eq.  (14) and (15) into Eq (8) we obtain:  Therefore from Eqs (16) and (17), we obtain: proof: Assuming that the system matrix is diagonal. Let "P" be invertible matrix. Then,

Numerical Experiments
To test the validity of the proposed method, we have considered the following model problem. Example1: Consider the one dimensional perturbed Burger equation considered by Gowrisankae and Natesan [15] ( )     Tables 1, 2, and 3 the present method can generate a convergent numerical solution for  and for different mesh refinement at which the method presented by Gowrisankae and Natesan, 2019 in [15] fails to produce the convergent solution. To compare the results obtained by the present method with the already existing methods, we produced maximum point-wise errors and the corresponding order of convergence applying on the uniform mesh in the spatial direction in Table 2, and Shishkin mesh results are given in Table 3. From the results given in both Tables, one can observe that when both uniform and Shishkin meshes give high convergence than the already existing method. As the value of the perturbation parameter decrease, the accuracy of the numerical result increase. Further, the numerical results present in Tables 2 and 3 show that the accuracy of the method is enhanced for different values of time-step and step length h for both uniform and Shishkin meshes in the spatial direction. The convergence of the present method is also depending on the perturbation parameter. The parameter-uniform convergence of the scheme is validated with numerical results. To Shaw, the physical behavior of the given problem, the surfaces, and plot graphs of approximating solution are given in Figures 1, 3, and 4, for ε= 10 -02, M = 64 & Δt=0.1. Finger 4 shows that the sequence of the line that the method is used to give the better solution through line segment for the uniform mesh. It means that the distribution of the solution on the grid pint along the line segment. For parameter ε Comparison among Table  1- Table 3 shows that a more accurate result is generated by the present method . Again the presented in Figures 1, 3, and 4 shows that the approximate solution obtained by the present method for uniform mesh is in good agreement with the exact solution. The simulations presented in Figures 2 and  5 shows that the approximate solution obtained by the present method for shrinking mesh is also in good agreement with the exact solution.

V. CONCLUSION
In this paper, the 'numerical method of the line' is used to solve one-dimensional singularly perturbed Burger's equation. First, we discretizing the derivative involving the special variable by using the central difference method to obtain the system of ODE. Then we solve the resulting initial value problem by using the Runge-Kutta method and the stability of the method is also established.
To validate the applicability of the method, one model example is considered and solved by varying the value of perturbation parameter ε, time-step k, and step-length h. As can be seen from the numerical results presented in tables and graphs, the present method is superior to the method developed by Gowrisankae and Natesan, 2019 in [15]and approximates the exact solution very well. In a nutshell, the present method is conceptually simple, easy to use, and adaptable for computer implementation for solving one-dimensional singularly perturbed Burger's equation.