Abstract
In the field of strong-stability-preserving time discretizations, a number of researchers have considered using both upwind and downwind approximations for the same derivative, in order to guarantee that some strong stability condition will be preserved. The cost of computing both the upwind and downwind operator has always been assumed to be double that of computing only one of the two. However, in this paper we show that for the weighted essentially non-oscillatory method it is often possible to compute both these operators at a cost that is far below twice the cost of computing only one. This gives rise to the need for optimal strong-stability-preserving time-stepping schemes which take into account the different possible cost increments. We construct explicit linear multistep schemes up to order six and explicit Runge–Kutta schemes up to order four which are optimal over a range of incremental costs
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Gottlieb S., and Shu C.W. (1998). Total variation diminishing Runge–Kutta schemes. Math. Comp. 67(221):73–85
Gottlieb S., Shu C.-W., and Tadmor E. (2001). Strong stability preserving high-order time discretization methods. SIAM Review 42: 89–112
Hundsdorfer W., Ruuth S.J., and Spiteri R.J. (2003). Monotonicity-preserving linear multistep methods. SIAM J. Numer. Anal. 41:605–623
Jiang G.-S., and Shu C.-W. (1996). Efficient implementation of weighted ENO schemes. J. Comp. Phys 126:202–228
Lenferink H.W.J. (1989). Contractivity preserving explicit linear multistep methods. Numer. Math. 55:213–223
Macdonald C.B. (2003). High-order embedded Runge–Kutta pairs for the time evolution of hyperbolic conservation laws. Master’s thesis, Simon Fraser University, Burnaby, BC, Canada
Ruuth S.J. (2006). Global optimization of explicit strong-stability-preserving Runge–Kutta schemes. Math. Comp. 75: 183–207
Ruuth S.J., and Hundsdorfer W. (2005). High-order linear multistep methods with general monotonicity and boundedness properties. J. Comput. Phys. 209(1):226–248
Ruuth S.J., and Spiteri R.J. (2004). High-order strong-stability-preserving Runge–Kutta methods with downwind-biased spatial discretizations. SIAM J. Numer. Anal. 42(3):974–996
Shu C.W., and Osher S. (1998). Efficient implementation of essentially nonoscillatory shock-capturing schemes. J. Comput. Phys. 77(2):439–471
Shu C.W. (1988). Total-variation-diminishing time discretizations. SIAM J. Sci. Statist. Comput. 9(6):1073–1084
Spiteri R.J., and Ruuth S.J. (2002). A new class of optimal high-order strong-stability-preserving time-stepping schemes. SIAM J. Numer. Anal. 40:469–491
Tawarmalani, M., and Sahinidis, N. V. (2002). Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, Nonconvex Optimization and Its Applications 65, Kluwer
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gottlieb, S., Ruuth, S.J. Optimal Strong-Stability-Preserving Time-Stepping Schemes with Fast Downwind Spatial Discretizations. J Sci Comput 27, 289–303 (2006). https://doi.org/10.1007/s10915-005-9054-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10915-005-9054-8