Existence and optimality of strong stability preserving linear multistep methods: a duality-based approach
classification
🧮 math.NA
keywords
linearapproachexistencemethodsmultistepproblemadvancescoefficients
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.