Explicit Finite Difference Schemes for the Advection Equation
Mike H. Zhou, Michael Mascagni, and Alice Y. Qiao
Conventional explicit finite difference schemes for the advection equations
are subject to the time step restrictions dictated by the CFL condition. In
many situations, time step sizes are not chosen to satisfy accuracy
requirements but rather to satisfy the CFL condition. In this paper we
present explicit algorithms which are stable far beyond the CFL restriction.
Similar or even better accuracy can be achieved with a much larger time step
size. The idea is matching the stencil and the real domain of dependence by
characteristic analysis. Numerical tests are done for linear advection
equations as well as the Burgers equation.
- Available as PostScript (2.0 Mbytes) or
gzipped PostScript (296 kbytes; uncompress
- Explicit finite difference schemes for the advection equation
- Mike H. Zhou,
- Michael Mascagni,
Alice Y. Qiao,
- Publishing information:
- Submitted by:
June 17 1998.
Preprint Server Homepage
© The copyright for the following
documents lies with the authors. Copies of these documents made by electronic
or mechanical means including information storage and retrieval systems, may
only be employed for personal use.
Conservation Laws Preprint Server <email@example.com>
Last modified: Wed Jun 17 09:19:47 1998