Numerical-analytical method for the Burgers equation

نویسندگان

چکیده

We construct an efficient numerical-analytical method for solving the initial-boundary value problem Burgers equation on a segment with periodic boundary condition. The includes reduction to linear based explicit-implicit time discretization scheme and analytical solution of auxiliary at each step using explicit form corresponding Green’s function. efficiency constructed is due fact that algorithm has only complexity in terms number spatial nodes used, without involving difference approximations derivatives desired On basis Cole-Hopf substitution, we obtain interval compare results numerical implementation this solution. developed demonstrated combination high computational accuracy result.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reproducing Kernel Space Hilbert Method for Solving Generalized Burgers Equation

In this paper, we present a new method for solving Reproducing Kernel Space (RKS) theory, and iterative algorithm for solving Generalized Burgers Equation (GBE) is presented. The analytical solution is shown in a series in a RKS, and the approximate solution u(x,t) is constructed by truncating the series. The convergence of u(x,t) to the analytical solution is also proved.

متن کامل

A numerical solution of Burgers' equation by modified Adomian method

In this paper, the modified Adomian s decomposition method for calculating a numerical solution of the one-dimensional quasi-linear, the Burgers equation, is presented. Time discretization has been used in decomposition, without using any transformation in the Burgers equation such as Hopf–Cole transformation. The numerical results obtained by this way for various values of viscosity have been ...

متن کامل

A Numerical Solution of Burgers' Equation Based on Multigrid Method

in this article we discussed the numerical solution of Burgers’ equation using multigrid method. We used implicit method for time discritization and Crank-Nicolson scheme for space discritization for fully discrete scheme. For improvement we used Multigrid method in fully discrete solution. And also Multigrid method accelerates convergence of a basics iterative method by global correction. Nume...

متن کامل

The Laplace transform method for Burgers’ equation

The Laplace transform method (LTM) is introduced to solve Burgers’ equation. Because of the nonlinear term in Burgers’ equation, one cannot directly apply the LTM. Increment linearization technique is introduced to deal with the situation. This is a key idea in this paper. The increment linearization technique is the following: In time level t , we divide the solution u(x, t) into two parts: u(...

متن کامل

On the Analytical and Numerical Solutions of the One-Dimensional Non- linear Burgers' Equation

In this paper, we present two methods for finding solutions to the one-dimensional nonlinear Burgers’ equation. The first method is an analytical one, which is based on the tanh – function method. The second method is based on the Adomian decomposition method where two approaches are introduced. The first approach considers the use of the initial condition while the other considers the use of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ??????????? ??????????. ??????????????? ???????????

سال: 2023

ISSN: ['2413-3639']

DOI: https://doi.org/10.22363/2413-3639-2023-69-2-208-223