An extension and analysis of the Shu-Osher representation of Runge-Kutta methods
نویسندگان
چکیده
In the context of solving nonlinear partial differential equations, Shu and Osher introduced representations of explicit Runge-Kutta methods, which lead to stepsize conditions under which the numerical process is totalvariation-diminishing (TVD). Much attention has been paid to these representations in the literature. In general, a Shu-Osher representation of a given Runge-Kutta method is not unique. Therefore, of special importance are representations of a given method which are best possible with regard to the stepsize condition that can be derived from them. Several basic questions are still open, notably regarding the following issues: (1) the formulation of a simple and general strategy for finding a best possible Shu-Osher representation for any given Runge-Kutta method; (2) the question of whether the TVD property of a given Runge-Kutta method can still be guaranteed when the stepsize condition, corresponding to a best possible ShuOsher representation of the method, is violated; (3) the generalization of the Shu-Osher approach to general (possibly implicit) Runge-Kutta methods. In this paper we give an extension and analysis of the original Shu-Osher representation, by means of which the above questions can be settled. Moreover, we clarify analogous questions regarding properties which are referred to, in the literature, by the terms monotonicity and strong-stability-preserving (SSP).
منابع مشابه
Total variation diminishing Runge-Kutta schemes
In this paper we further explore a class of high order TVD (total variation diminishing) Runge-Kutta time discretization initialized in a paper by Shu and Osher, suitable for solving hyperbolic conservation laws with stable spatial discretizations. We illustrate with numerical examples that non-TVD but linearly stable Runge-Kutta time discretization can generate oscillations even for TVD (total...
متن کاملExponential Runge-Kutta for the inhomogeneous Boltzmann equations with high order of accuracy
We consider the development of exponential methods for the robust time discretization of space inhomogeneous Boltzmann equations in stiff regimes. Compared to the space homogeneous case, or more in general to the case of splitting based methods, studied in Dimarco Pareschi [6] a major difficulty is that the local Maxwellian equilibrium state is not constant in a time step and thus needs a prope...
متن کاملStepsize Restrictions for the Total-Variation-Diminishing Property in General Runge-Kutta Methods
Much attention has been paid in the literature to total-variation-diminishing (TVD) numerical processes in the solution of nonlinear hyperbolic differential equations. For special Runge– Kutta methods, conditions on the stepsize were derived that are sufficient for the TVD property; see, e.g., Shu and Osher [J. Comput. Phys., 77 (1988), pp. 439–471] and Gottlieb and Shu [Math. Comp., 67 (1998),...
متن کاملError estimates for finite element methods for the shallow water equations
We consider a simple initial–boundary–value problem for the system of the shallow water equations and its symmetric variant in one space dimension. We discretize the problem in space by the standard Galerkin–finite element method and prove error estimates for the resulting semidiscretizations for quasiuniform and uniform meshes. We also discretize the problem in time using the third–order Shu–O...
متن کاملA Numerical Study for the Performance of the Runge-kutta Finite Difference Method Based on Different Numerical Hamiltonians
High resolution finite difference methods have been successfully employed in solving Hamilton Jacobi equations, and numerical Hamiltonians are as important as numerical fluxes for solving hyperbolic conservation laws using the finite volume methodology. Though different numerical Hamiltonians have been suggested in the literature, only some simple ones such as the Lax-Friedrichs Hamiltonian are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 74 شماره
صفحات -
تاریخ انتشار 2005