High-order linear multistep methods with general monotonicity and boundedness properties
- 1 October 2005
- journal article
- Published by Elsevier in Journal of Computational Physics
- Vol. 209 (1) , 226-248
- https://doi.org/10.1016/j.jcp.2005.02.029
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- On monotonicity and boundedness properties of linear multistep methodsMathematics of Computation, 2005
- Monotonicity-Preserving Linear Multistep MethodsSIAM Journal on Numerical Analysis, 2003
- A New Class of Optimal High-Order Strong-Stability-Preserving Time Discretization MethodsSIAM Journal on Numerical Analysis, 2002
- Strong Stability-Preserving High-Order Time Discretization MethodsSIAM Review, 2001
- On the Removal of Boundary Errors Caused by Runge–Kutta Integration of Nonlinear Partial Differential EquationsSIAM Journal on Scientific Computing, 1996
- Contractivity of Runge-Kutta methodsBIT Numerical Mathematics, 1991
- Total-Variation-Diminishing Time DiscretizationsSIAM Journal on Scientific and Statistical Computing, 1988
- Efficient implementation of essentially non-oscillatory shock-capturing schemesJournal of Computational Physics, 1988
- On a Class of High Resolution Total-Variation-Stable Finite-Difference SchemesSIAM Journal on Numerical Analysis, 1984
- Stability of explicit time discretizations for solving initial value problemsNumerische Mathematik, 1981