No label defined (Q4366389)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1089902
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1089902 |
Statements
2 September 1998
0 references
Burgers equation
0 references
finite differences
0 references
iteration
0 references
clustered grid points
0 references
numerical examples
0 references
stability
0 references
Fourier method
0 references
algorithm
0 references
0.8018232583999634
0 references
0.7923315763473511
0 references
0.7825630903244019
0 references
0.7795177698135376
0 references
0.7779971957206726
0 references
This paper is devoted to the numerical integration of the so-called generalized Burgers equation: \[ u_t+(\beta +\lambda u)u_x=\mu u_{xx} \] by means of finite differences. The author suggests to apply the second-order approximation of all the derivatives with respect to both variables \(t\) and \(x\) by three-point finite differences: forward, central, and backward. The computing process consists of five steps: -- a starting step computing the first two time lines, which uses the initial values, central and backward time differences, and the linearized equation, -- an iterative correction step, -- an explicit type scheme -- a kind of predictor for consecutive time steps, which uses the backward finite time difference and the linearized equation, -- an iterative correction step, -- and an additional step (when the whole solution is already determined), which improves the result by iterative correction on the whole time space grid. In the linear case, the stability analysis by means of the Fourier method is added. Moreover, the paper contains examples which compare the numerical solutions obtained by means of the algorithm proposed by the author with known solutions of the Burgers equation. The author's algorithm seems to work well in the cases under discussion.
0 references