High-order linear multistep methods with general monotonicity and boundedness properties
By Steven J. Ruuth, Willem Hundsdorfer. 2005
72 citations recorded by the source corpus.
Subfields: Computational Mechanics, Computational Theory and Mathematics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/70469fad9674e87b7eb1e55fd624e091131053f7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
- Chi-Wang Shu
- David I. Ketcheson
- Lajos Lóczi
- Sigal Gottlieb
- Jianxian Qiu
- Michael Dumbser
- Eleuterio F. Toro
- Yan Xu
In Computational Theory and Mathematics
- David I. Ketcheson
- Chi-Wang Shu
- Lajos Lóczi
- Sigal Gottlieb
- Francesco Tornabene
- Erasmo Viola
- Nicholas Fantuzzi
- M. Bacciocchi
In Numerical Analysis
- Chi-Wang Shu
- David I. Ketcheson
- Lajos Lóczi
- Sigal Gottlieb
- Yan Xu
- Lilia Krivodonova
- Ruibin Qin
- Michael Dumbser
Citations in the corpus
- High Order Strong Stability Preserving Time Discretizations (2009, methodology): “with special starting procedures seem not to work as well [73].”
- Exact optimal values of step-size coefficients for boundedness of linear multistep methods (2017, methodology): “The coefficients for the EBDF methods are listed, for example, in [15].”