Existence and optimality of strong stability preserving linear multistep methods: a duality-based approach
Numerical Analysis
2016-04-07 v2
Abstract
We prove the existence of explicit linear multistep methods of any order with positive coefficients. Our approach is based on formulating a linear programming problem and establishing infeasibility of the dual problem. This yields a number of other theoretical advances.
Cite
@article{arxiv.1504.03930,
title = {Existence and optimality of strong stability preserving linear multistep methods: a duality-based approach},
author = {Adrián Németh and David Ketcheson},
journal= {arXiv preprint arXiv:1504.03930},
year = {2016}
}