Strong-stability-preserving additive linear multistep methods

Yiannis Hadjimichael, David I. Ketcheson

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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.
Original languageEnglish (US)
Pages (from-to)2295-2320
Number of pages26
JournalMathematics of Computation
Issue number313
StatePublished - Feb 20 2018

Cite this