## Total variation diminishing Runge-Kutta schemes.(English)Zbl 0897.65058

Suppose that a hyperbolic conservation law $$u_t = - f(u)_x$$ is discretized in space by a certain total variation diminishing (TVD) finite difference or finite element approximation, and that the resulting ordinary differential equation is solved by an explicit Runge-Kutta method. This article investigates methods which, under a suitable restriction on the stepsize, the total variation does not increase in time. First, a numerical example is presented which illustrates the importance of this property. Then, the authors construct optimal TVD Runge-Kutta methods of second, third and fourth order. Details are very technical and postponed to an appendix.
Reviewer: E.Hairer (Genève)

### MSC:

 65M20 Method of lines for initial value and initial-boundary value problems involving PDEs 65M50 Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs 65M06 Finite difference methods for initial value and initial-boundary value problems involving PDEs 65M60 Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs 35L65 Hyperbolic conservation laws 65L06 Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations 34A34 Nonlinear ordinary differential equations and systems
Full Text:

### References:

 [1] M. Carpenter and C. Kennedy, Fourth-order 2N-storage Runge-Kutta schemes, NASA TM 109112, NASA Langley Research Center, June 1994. [2] Bernardo Cockburn and Chi-Wang Shu, TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws. II. General framework, Math. Comp. 52 (1989), no. 186, 411 – 435. · Zbl 0662.65083 [3] Bernardo Cockburn, Suchung Hou, and Chi-Wang Shu, The Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws. IV. The multidimensional case, Math. Comp. 54 (1990), no. 190, 545 – 581. · Zbl 0695.65066 [4] Ami Harten, High resolution schemes for hyperbolic conservation laws, J. Comput. Phys. 49 (1983), no. 3, 357 – 393. · Zbl 0565.65050 [5] Ami Harten, Björn Engquist, Stanley Osher, and Sukumar R. Chakravarthy, Uniformly high-order accurate essentially nonoscillatory schemes. III, J. Comput. Phys. 71 (1987), no. 2, 231 – 303. · Zbl 0652.65067 [6] Z. Jackiewicz, R. Renaut, and A. Feldstein, Two-step Runge-Kutta methods, SIAM J. Numer. Anal. 28 (1991), no. 4, 1165 – 1182. · Zbl 0732.65064 [7] Masaharu Nakashima, Embedded pseudo-Runge-Kutta methods, SIAM J. Numer. Anal. 28 (1991), no. 6, 1790 – 1802. · Zbl 0736.65057 [8] Stanley Osher and Sukumar Chakravarthy, High resolution schemes and the entropy condition, SIAM J. Numer. Anal. 21 (1984), no. 5, 955 – 984. · Zbl 0556.65074 [9] Anthony Ralston, A first course in numerical analysis, McGraw-Hill Book Co., New York-Toronto-London, 1965. · Zbl 0258.65079 [10] Chi-Wang Shu, TVB uniformly high-order schemes for conservation laws, Math. Comp. 49 (1987), no. 179, 105 – 121. · Zbl 0628.65075 [11] Chi-Wang Shu, Total-variation-diminishing time discretizations, SIAM J. Sci. Statist. Comput. 9 (1988), no. 6, 1073 – 1084. · Zbl 0662.65081 [12] Chi-Wang Shu and Stanley Osher, Efficient implementation of essentially nonoscillatory shock-capturing schemes, J. Comput. Phys. 77 (1988), no. 2, 439 – 471. · Zbl 0653.65072 [13] P. K. Sweby, High resolution schemes using flux limiters for hyperbolic conservation laws, SIAM J. Numer. Anal. 21 (1984), no. 5, 995 – 1011. · Zbl 0565.65048 [14] B. van Leer, Towards the ultimate conservative difference scheme V. A second order sequel to Godunov’s method, J. Comput. Phys., v32, 1979, pp.101-136. · Zbl 1364.65223 [15] J. H. Williamson, Low-storage Runge-Kutta schemes, J. Comput. Phys. 35 (1980), no. 1, 48 – 56. · Zbl 0425.65038
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.