Numerische Mathematik

, Volume 34, Issue 3, pp 285–314

The method of fractional steps for conservation laws

  • Michael Crandall
  • Andrew Majda
A Complete Characterization of Local Minima in Quadratic Programming

DOI: 10.1007/BF01396704

Cite this article as:
Crandall, M. & Majda, A. Numer. Math. (1980) 34: 285. doi:10.1007/BF01396704

Summary

The stability, accuracy, and convergence of the basic fractional step algorithms are analyzed when these algorithms are used to compute discontinuous solutions of scalar conservation laws. In particular, it is proved that both first order splitting and Strang splitting algorithms always converge to the unique weak solution satisfying the entropy condition. Examples of discontinuous solutions are presented where both Strang-type splitting algorithms are only first order accurate but one of the standard first order algorithms is infinite order accurate. Various aspects of the accuracy, convergence, and correct entropy production are also studied when each split step is discretized via monotone schemes, Lax-Wendroff schemes, and the Glimm scheme.

Subject Classifications

AMS(MOS): 65M10 65 M05, 35L65 

Copyright information

© Springer-Verlag 1980

Authors and Affiliations

  • Michael Crandall
    • 1
  • Andrew Majda
    • 2
  1. 1.University of WisconsinMadisonUSA
  2. 2.University of California at BerkeleyUSA