Existence and optimality of strong stability preserving linear multistep\n methods: a duality-based approach

2015/04/15 by Adrián Németh, Németh, Adrián, David I. Ketcheson +1
Computer Science · Engineering · Mathematics · #Advanced Numerical Methods in Computational Mathematics #Advanced Optimization Algorithms Research #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Numerical methods for differential equations

paper · pdf · doi:10.48550/arxiv.1504.03930

openalex publication_date 2015/04/15 · openalex created_date 2022/09/30 · openalex updated_date 2026/07/28

Abstract

We prove the existence of explicit linear multistep methods of any order with\npositive coefficients. Our approach is based on formulating a linear\nprogramming problem and establishing infeasibility of the dual problem. This\nyields a number of other theoretical advances.\n

Related

• Optimal subsets in the stability regions of multistep methods
• Exact optimal values of step-size coefficients for boundedness of linear multistep methods
• Implicit-explicit methods based on strong stability preserving multistep time discretizations
• Spijker's example and its extension
• High order semi-implicit multistep methods for time dependent partial\n differential equations