KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Applied Mathematics and Computational Science Program
Permanent link to this recordhttp://hdl.handle.net/10754/627959
MetadataShow full item record
AbstractThe 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.
CitationHadjimichael Y, Ketcheson DI (2018) Strong-stability-preserving additive linear multistep methods. Mathematics of Computation 87: 2295–2320. Available: http://dx.doi.org/10.1090/mcom/3296.
SponsorsThe authors would like to thank the anonymous referees for their suggestions that significantly improved the paper. Also, they would like to thank Lajos Loczi and Inmaculada Higueras for carefully reading this manuscript and making valuable comments.
PublisherAmerican Mathematical Society (AMS)
JournalMathematics of Computation