Strong-stability-preserving additive linear multistep methods

  • Hadjimichael Y
  • Ketcheson D
3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

The analysis of strong-stability-preserving (SSP) linear multistep methods is extended to semi-discretized problems for which different terms on the right-hand side satisfy different forward Euler (or circle) conditions. Optimal perturbed and additive monotonicity-preserving linear multistep methods are studied in the context of such problems. Optimal perturbed methods attain larger monotonicity-preserving step sizes when the different forward Euler conditions are taken into account. On the other hand, we show that optimal SSP additive methods achieve a monotonicity-preserving step-size restriction no better than that of the corresponding nonadditive SSP linear multistep methods.

Cite

CITATION STYLE

APA

Hadjimichael, Y., & Ketcheson, D. (2018). Strong-stability-preserving additive linear multistep methods. Mathematics of Computation, 87(313), 2295–2320. https://doi.org/10.1090/mcom/3296

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free