Efficient implementation of essentially non-oscillatory shock-capturing schemes
Journal of Computational Physics
Total-variation-diminishing time discretizations
SIAM Journal on Scientific and Statistical Computing
SIAM Journal on Scientific Computing
A New Class of Optimal High-Order Strong-Stability-Preserving Time Discretization Methods
SIAM Journal on Numerical Analysis
Two Barriers on Strong-Stability-Preserving Time Discretization Methods
Journal of Scientific Computing
SIAM Journal on Numerical Analysis
Optimal Strong-Stability-Preserving Time-Stepping Schemes with Fast Downwind Spatial Discretizations
Journal of Scientific Computing
IMEX extensions of linear multistep methods with general monotonicity and boundedness properties
Journal of Computational Physics
High Order Strong Stability Preserving Time Discretizations
Journal of Scientific Computing
Strong stability preserving hybrid methods
Applied Numerical Mathematics
Explicit Time Stepping Methods with High Stage Order and Monotonicity Properties
ICCS 2009 Proceedings of the 9th International Conference on Computational Science
Strong-stability-preserving 3-stage Hermite-Birkhoff time-discretization methods
Applied Numerical Mathematics
Optimal Explicit Strong-Stability-Preserving General Linear Methods
SIAM Journal on Scientific Computing
Linearly implicit methods for nonlinear PDEs with linear dispersion and dissipation
Journal of Computational Physics
On the Linear Stability of the Fifth-Order WENO Discretization
Journal of Scientific Computing
Stability of two IMEX methods, CNLF and BDF2-AB2, for uncoupling systems of evolution equations
Applied Numerical Mathematics
Strong-Stability-Preserving 7-Stage Hermite---Birkhoff Time-Discretization Methods
Journal of Scientific Computing
Stepsize Restrictions for Boundedness and Monotonicity of Multistep Methods
Journal of Scientific Computing
Strong Stability Preserving Two-step Runge-Kutta Methods
SIAM Journal on Numerical Analysis
The existence of stepsize-coefficients for boundedness of linear multistep methods
Applied Numerical Mathematics
Journal of Computational and Applied Mathematics
Hi-index | 31.46 |
We consider linear multistep methods that possess general monotonicity and boundedness properties. Strict monotonicity, in terms of arbitrary starting values for the multistep schemes, is only valid for a small class of methods, under very stringent step size restrictions. This makes them uncompetitive with the strong-stability-preserving (SSP) Runge-Kutta methods. By relaxing these strict monotonicity requirements a larger class of methods can be considered, including many methods of practical interest. In this paper we construct linear multistep methods of high-order (up to six) that possess relaxed monotonicity or boundedness properties with optimal step size conditions. Numerical experiments show that the new schemes perform much better than the classical monotonicity-preserving multistep schemes. Moreover there is a substantial gain in efficiency compared to recently constructed SSP Runge-Kutta (SSPRK) methods.