SearcharxivSearch

arXiv subjects

Zachary Grant

Publications and source records attributed to Zachary Grant.

2 recordsLinked to original sources

A Strong Stability Preserving Analysis for Multistage Two-Derivative Time-Stepping Schemes Based on Taylor Series Conditions

High order strong stability preserving (SSP) time discretizations are often needed to ensure the nonlinear (and sometimes non-inner-product) strong stability properties of spatial discretizations specially designed for the solution of hyperbolic PDEs. Multiderivative time-stepping methods have recently been increasingly used for evolving hyperbolic PDEs, and the strong stability properties of these methods are of interest. In our prior work we explored time discretizations that preserve the strong stability properties of spatial discretizations coupled with forward Euler and a second derivative formulation. However, many spatial discretizations do not satisfy strong stability properties when coupled with this second derivative formulation, but rather with a more natural Taylor series formulation. In this work we demonstrate sufficient conditions for an explicit two-derivative multistage method to preserve the strong stability properties of spatial discretizations in a forward Euler and Taylor series formulation. We call these strong stability preserving Taylor series (SSP-TS) methods. We also prove that the maximal order of SSP-TS methods is p = 6, and define an optimization procedure that allows us to find such SSP methods. Several types of these methods are presented and their efficiency compared. Finally, these methods are tested on several PDEs to demonstrate the benefit of SSP-TS methods, the need for the SSP property, and the sharpness of the SSP time-step in many cases.

math.NA

Strong Stability Preserving Multistep Runge-Kutta Methods

High-order spatial discretizations with strong stability properties (such as monotonicity) are desirable for the solution of hyperbolic PDEs. Methods may be compared in terms of the strong stability preserving (SSP) time-step. We prove an upper bound on the SSP coefficient of explicit multistep Runge--Kutta methods of order two and above. Order conditions and monotonicity conditions for such methods are worked out in terms of the method coefficients. Numerical optimization is used to find optimized explicit methods of up to five steps, eight stages, and tenth order. These methods are tested on the advection and Buckley-Leverett equations, and the results for the observed total variation diminishing and positivity preserving time-step are presented.

math.NA