Back to search

NJIT

Certifying stability in runge-kutta schemes: Algebraic conditions and semidefinite programming

Abstract

dc:description.abstract

<p>Numerical stability is a critical property for a time-integration scheme. In the context of Runge-Kutta methods applied to stiff differential equations, A-stability is one of the most basic and practically important notions of stability. Dating back to the work of Dahlquist, it has been known that A-stability is equivalent to the Runge-Kutta stability function satisfying a particular convex feasibility problem. Specifically, up to a transformation, the stability function lies in the convex cone of positive functions. In recent years, sum-of-squares optimization and semidefinite programming have become valuable tools in developing rigorous certificates of stability in dynamical systems. Therefore, it is natural to employ these convex optimization tools for the purpose of rigorously certifying A- and A(α)-stability in Runge-Kutta methods.</p><p>Two distinct convex feasibility problems defined by linear matrix inequalities are introduced. The first approach employs sum-of-squares programming applied to the Runge-Kutta E-polynomial, making it applicable to both A- and A(α)-stability. The second approach refines the algebraic conditions for A-stability, as developed by Cooper, Scherer, Turke, and Wendler (CSTW), to incorporate the Runge-Kutta order conditions. The theoretical enhancement of the algebraic conditions facilitates the practical application of the refined conditions for certifying A-stability within a computational framework.</p><p>Additionally, a new theoretical perspective is provided, relating the algebraic conditions for A-stability to continued fraction approximations of the exponential. This perspective involves the introduction of a new transform defined in a recently established class of polynomials orthogonal with respect to a linear functional. </p><p>The E-polynomial and CSTW methodologies are utilized to obtain rigorous stability certificates for several implicit Runge-Kutta schemes proposed in the literature. Specific attention is given to certifying the implicit Runge-Kutta schemes utilized in the SUite of Nonlinear and DIfferential/ALgebraic equation Solvers (SUNDIALS).</p>

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy in Mathematical Sciences - (Ph.D.)
Discipline thesis:degree_discipline
Mathematical Sciences

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Juhl, Austin
  • 0009-0006-8150-157X
Contributors dc:contributor
  • David Shirokoff
  • Cristina Frederick
  • Travis Askham

Subjects

dc:subject × 8

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/dissertations/1775

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Juhl, Austin; 0009-0006-8150-157X. Certifying stability in runge-kutta schemes: Algebraic conditions and semidefinite programming. https://digitalcommons.njit.edu/dissertations/1775