# Burgers equation

### From CFD-Wiki

(9 intermediate revisions not shown) | |||

Line 1: | Line 1: | ||

== Problem definition == | == Problem definition == | ||

+ | :<math> \frac{\partial u}{\partial t}+ u \frac{\partial u}{\partial x}=\nu \frac{\partial^2 u}{\partial x^2} </math> | ||

- | == Domain | + | == Domain == |

+ | :<math>x \in \left[0,25\right]</math> | ||

== Initial Condition == | == Initial Condition == | ||

+ | :<math> u(x,0)=1-tanh(\frac{x-x_c}{2\nu})</math> | ||

== Boundary condition == | == Boundary condition == | ||

+ | :<math>u(0,t)=2</math> | ||

+ | :<math>u_n=2u_{n-1}-u_{n-2}</math> | ||

+ | |||

+ | == Exact solution == | ||

+ | :<math> u(x,t)=1-tanh(\frac{x-x_c-t}{2\nu})</math> | ||

== Numerical method == | == Numerical method == | ||

+ | :<math> dx=0.2,dt=0.2dx </math> | ||

+ | :Long <math> \frac{dx}{\nu}=1 </math> | ||

+ | :Medium<math> \frac{dx}{\nu}=3 </math> | ||

+ | :Short <math> \frac{dx}{\nu}=10 </math> | ||

+ | === Space === | ||

+ | ==== Explicit Scheme (DRP)==== | ||

+ | :<math> {(\frac{\partial u}{\partial x})}_i=\frac{1.0}{dx}\sum_{k=-3}^3 a_k u_{i+k} </math> | ||

+ | The coefficients can be found in Tam(1993).At the right boundaries use fourth order central difference and fourth backward difference.At left boundaries use second order central difference for i=2 and fourth order central difference for i=3.The Dispersion relation preserving (DRP) finite volume scheme can be found in Popescu (2005).The second order derivative can be calculated from the first order derivative inside the domain using the abouve defined discretization.Near the boundaries use a second order central difference. | ||

+ | ====Implicit Scheme(Compact)==== | ||

+ | =====First derivative ===== | ||

+ | :Domain: <math>\alpha v_{i-1} + v_i + \alpha v_{i+1}=\frac{a}{2h}(u_{i+1}-u_{i-1}) </math> | ||

+ | :Boundaries: <math> v_1+\alpha v_2=\frac{1}{h}(au_1+bu_2+cu_3+du_4) </math> | ||

+ | where v refers to the first derivative.For a general treatment of compact scheme refer to Lele (1992).In this test case the following values are used | ||

+ | :<math> \mbox{Domain:} \alpha=0.25 , a=\frac{2}{3}(\alpha+2) </math> | ||

+ | :<math> \mbox{Boundary:} \alpha=2 ,a=-(\frac{11+2\alpha}{6}),b=\frac{6-\alpha}{2},c=\frac{2\alpha-3}{2},d=\frac{2-\alpha}{6} </math> | ||

+ | Both the schemes are 4th order accurate in the domain.The compact scheme has third order accuracy at the boundary. | ||

+ | ===== Second derivative ===== | ||

+ | :Domain: <math>\alpha v_{i-1} + v_i + \alpha v_{i+1}=\frac{a}{h^2}(u_{i+1}-2u_i+u_{i-1}) </math> | ||

+ | where v in here refers to the second derivative.Second order central difference is used at the boundaries.The coefficients used are | ||

+ | :<math> \alpha=1/10 ,a=6/5 </math> | ||

+ | ===Time (4th Order Runga-Kutta)=== | ||

+ | :<math>\frac{\partial u}{\partial t}=f </math> | ||

+ | |||

+ | :<math>u^{M+1} =u^M + b^{M+1}dtH^M </math> | ||

+ | |||

+ | :<math> H^M=a^MH^{M-1}+f^M </math> | ||

+ | ,M=1,2..5 .The coefficients a and b can be found in Williamson(1980) | ||

== Results == | == Results == | ||

+ | [[Image:Burger_long.png]] | ||

+ | [[Image:Burger_medium.png]] | ||

+ | [[Image:Burger_short.png]] | ||

+ | |||

+ | == Reference == | ||

+ | |||

+ | {{reference-paper|author=Mihaela Popescu, Wei Shyy , Marc Garbey|year=2005|title=Finite volume treatment of dispersion-relation-preserving and optimized prefactored compact schemes for wave propagation|rest=Journal of Computational Physics, Vol. 210, pp. 705-729}} | ||

+ | |||

+ | {{reference-paper|author=Tam and Webb|year=1993|title=Dispersion-relation-preserving finite difference schemes for computational acoustics|rest=Journal of Computational Physics, Vol. 107, pp. 262-281}} | ||

+ | |||

+ | {{reference-paper|author=SK Lele|year=1992|title=Compact finite difference schemes with spectrum-like resolution|rest=Journal of Computational Physics, Vol.103, pp.16-42}} | ||

+ | |||

+ | {{reference-paper|author=Williamson|year=1980|title=Low Storage Runge-Kutta Schemes|rest=Journal of Computational Physics, Vol.35, pp.48–56}} |

## Latest revision as of 15:22, 14 July 2007

## Contents |

## Problem definition

## Domain

## Initial Condition

## Boundary condition

## Exact solution

## Numerical method

- Long
- Medium
- Short

### Space

#### Explicit Scheme (DRP)

The coefficients can be found in Tam(1993).At the right boundaries use fourth order central difference and fourth backward difference.At left boundaries use second order central difference for i=2 and fourth order central difference for i=3.The Dispersion relation preserving (DRP) finite volume scheme can be found in Popescu (2005).The second order derivative can be calculated from the first order derivative inside the domain using the abouve defined discretization.Near the boundaries use a second order central difference.

#### Implicit Scheme(Compact)

##### First derivative

- Domain:
- Boundaries:

where v refers to the first derivative.For a general treatment of compact scheme refer to Lele (1992).In this test case the following values are used

Both the schemes are 4th order accurate in the domain.The compact scheme has third order accuracy at the boundary.

##### Second derivative

- Domain:

where v in here refers to the second derivative.Second order central difference is used at the boundaries.The coefficients used are

### Time (4th Order Runga-Kutta)

,M=1,2..5 .The coefficients a and b can be found in Williamson(1980)

## Results

## Reference

**Mihaela Popescu, Wei Shyy , Marc Garbey (2005)**, "Finite volume treatment of dispersion-relation-preserving and optimized prefactored compact schemes for wave propagation", Journal of Computational Physics, Vol. 210, pp. 705-729.

**Tam and Webb (1993)**, "Dispersion-relation-preserving finite difference schemes for computational acoustics", Journal of Computational Physics, Vol. 107, pp. 262-281.

**SK Lele (1992)**, "Compact finite difference schemes with spectrum-like resolution", Journal of Computational Physics, Vol.103, pp.16-42.

**Williamson (1980)**, "Low Storage Runge-Kutta Schemes", Journal of Computational Physics, Vol.35, pp.48–56.