2010
DOI: 10.1002/fld.2116
|View full text |Cite
|
Sign up to set email alerts
|

The Laplace transform method for Burgers' equation

Abstract: SUMMARYThe 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(x, t k ) and w(x, t), t k t t k+1 , and obtain a time-dependent linear partial differential equation (PDE) for w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
7
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(9 citation statements)
references
References 16 publications
2
7
0
Order By: Relevance
“…Our goal to construct the new schemes is to reduce the scale of corresponding matrices from order 2 N to order N when we choose the spatial step size be h=ba2N; thereby, the computational cost will be reduced. () It cannot neglect the fact that the leading terms of local truncation error of the existing schemes and with spatial step size h=ba2N are boldbold1bold2bold2boldCbold1boldhbold2 and boldbold1bold2bold2boldCbold2boldhbold2; hence, the leading terms of the local truncation error of the new schemes (denoted by C1h2 and C2h2) with spatial step size h=ba2N must be boldbold1bold2bold2boldCboldjboldboldCboldjbold′boldCboldj,.1emfalse(j=1,2false). If Cj=Cj, the effect of new schemes is not improved, which means the new schemes do not realize our goal; if Cj=122Cj, we obtain the optimal error in theory under positive integer 2 N .…”
Section: Construction Of Structure‐preserving Schemesmentioning
confidence: 99%
“…Our goal to construct the new schemes is to reduce the scale of corresponding matrices from order 2 N to order N when we choose the spatial step size be h=ba2N; thereby, the computational cost will be reduced. () It cannot neglect the fact that the leading terms of local truncation error of the existing schemes and with spatial step size h=ba2N are boldbold1bold2bold2boldCbold1boldhbold2 and boldbold1bold2bold2boldCbold2boldhbold2; hence, the leading terms of the local truncation error of the new schemes (denoted by C1h2 and C2h2) with spatial step size h=ba2N must be boldbold1bold2bold2boldCboldjboldboldCboldjbold′boldCboldj,.1emfalse(j=1,2false). If Cj=Cj, the effect of new schemes is not improved, which means the new schemes do not realize our goal; if Cj=122Cj, we obtain the optimal error in theory under positive integer 2 N .…”
Section: Construction Of Structure‐preserving Schemesmentioning
confidence: 99%
“…It removes the time dependency and converts the original problem into a series of boundary value problems (BVPs). Chen and Wu et al combined LT with the rational spectral collocation method to solve the advectiondi usion equation [17] and one-dimensional Burgers' equation (18). A coupled method of LT and Legendre wavelets was presented in [19] for one-dimensional Klein-Gordon equations.…”
Section: Introductionmentioning
confidence: 99%
“…e increment linearization method was first proposed by Wu et al [26] and then integrated with LT to solve Burgers' equation (18). Its key idea is to define an increment function at each time step: Δu(x, t) � u(x, t) − u(x, t n ), t n ≤ t ≤ t n+1 , linearize the equation by omitting the nonlinear terms of the order O(τ c ), c ≥ 2, and finally get the approximation by u(x, t n+1 ) ≈ u(x, t n ) + Δu(x, t n+1 ).…”
Section: Introductionmentioning
confidence: 99%
“…We call it viscous Burger's equation, and in case of ν = 0, we call it inviscid Burger's equation. Normally, the solution of Burger's equation can be obtained by Hopf-Cole transformation which transforms Burgers equation into a linear parabolic equation [4], and the numerical solution has been still pursued because of comparing it with the exact solution. In this article, we would like to approach the topic by using Laplace transform.…”
Section: Introductionmentioning
confidence: 99%
“…With relation to this topic, several researches have been pursued for integral transforms related to differential equations [3,[5][6][7][10][11][12][13][14][15][16], and for nonlinear equation [2,[8][9]. Benton researched exact solutions of the one-dimensional Burger's equation [1], Elzaki has proposed Elzaki homotopy perturbation method to find the solution of Burger's equation [9], and Chen applied the increment linerarization technique(ILT) and Laplace transform to solve the equation [4]. Chen employed Laplace transform to control linear terms, and ILT to control nonlinear term.…”
Section: Introductionmentioning
confidence: 99%