Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2611.07981

A stability order barrier and SSP bound for Runge--Kutta methods with non-negative coefficients: AI-assisted proofs

Sigal Gottlieb·Zachary Grant·Lior Horesh·Lajos Lóczi·Avraham Shinnar·Barry Trager
View original source ↗Read source document ↗Export metadata ↓

Abstract

We prove three results about Runge--Kutta methods with non-negative coefficients. First, every $s$-stage implicit Runge--Kutta method of order at least two has SSP coefficient at most $2s$; the bound is sharp and is attained by a known diagonally implicit method, so full implicitness gives no advantage over DIRK at second order. This extends the second-order DIRK result of Kocsis \& Németh to full coefficient matrices and settles a conjecture of Ketcheson, Macdonald & Gottlieb. These proofs were found with the assistance of AI tools, which uncovered an interesting relationship between the Butcher matrices for SSP methods and phase-type distributions, and led to the proof of the second result: a bound on the SSP coefficient of $s$-stage implicit Runge--Kutta method of order at least three. The third result in this work is a proof that a third-order Runge--Kutta method with entrywise non-negative $A$ and $b$ cannot be algebraically stable. This algebraically intensive proof was also AI-assisted. This paper describes the iterative process of AI-assisted results, and presents an approach that centers human understanding and creativity in the AI-assisted mathematical endeavor.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sigal Gottlieb, Zachary Grant, Lior Horesh, Lajos Lóczi, Avraham Shinnar, Barry Trager. 2026-11-05. A stability order barrier and SSP bound for Runge--Kutta methods with non-negative coefficients: AI-assisted proofs. https://arxiv.org/abs/2611.07981

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Automatic Synthesis of Low-Complexity Translation Operators for the Fast Multipole Method

The FMM is the leading approach for attaining linear complexity in the evaluation of long-range (e.g. Coulomb) many-body interactions. We demonstrate a new, hybrid symbolic-numerical method for the automatic synthesis of all families of translation operators required for the execution of the Fast Multipole Method (FMM). Our method is dimension-independent (demonstrated in 2D and 3D) and applicable to any translation-invariant kernel. Low complexity in translation operators for the FMM is usually achieved by algorithms specialized for a potential obeying a specific partial differential equation (PDE). Absent a PDE or specialized algorithms, Taylor series based FMMs or kernel-independent FMM have been used, at asymptotically higher expense. When symbolically provided with a constant-coefficient elliptic PDE obeyed by the potential, our algorithm can automatically synthesize translation operators requiring $\mathrm{O}(p^d)$ operations, where $p$ is the expansion order and $d$ is dimension, compared with $\mathrm{O}(p^{2d})$ operations in a naive approach carried out on (Cartesian) Taylor expansions. This is achieved by using a compression scheme that asymptotically reduces the number of terms in the Taylor expansion and then operating directly on this "compressed" representation. Judicious exploitation of shared subexpressions permits formation, translation, and evaluation of local and multipole expansions to be performed in $\mathrm{O}(p^d)$ operations, while an FFT-based scheme permits multipole-to-local translations in $\mathrm{O}(p^{d-1}\log(p))$ operations. We demonstrate computational scaling of code generation and evaluation as well as numerical accuracy through numerical experiments on a number of potentials from classical physics.

math.NA↗
arXiv2026

Adaptive refinement based on local approximation power of hierarchical spline spaces

We propose an adaptive refinement strategy for hierarchical B-splines that increases the approximation power of every marked cell by at least one. Here, the approximation power of a cell is the finest level $\ell$ such that all the B-splines of level $\ell$ that do not vanish on the cell belong to the hierarchical space. This increase can be achieved with the standard refinement of hierarchical meshes, in which each cell is subdivided at most once per step, provided that the regions formed at each level by the cells with this property are nested. We call the hierarchical meshes with this nesting property \emph{weakly admissible}, characterize them, and prove that the proposed refinement preserves weak admissibility. We also prove a complexity estimate: the number of cells created along the adaptive process is bounded by a constant times the total number of marked cells. Moreover, we extend known local $L^q$ estimates for a multilevel quasi-interpolant on these meshes to Sobolev norms, showing that the local error bound on each active cell is governed by its approximation power, which supports using this quantity to drive the refinement. Numerical experiments illustrate the local gain of resolution produced by the proposed strategy, as well as its robustness with respect to the marking criterion and the marking parameter.

math.NA↗
arXiv2026

Vertex interpolation by bivariate $C^1$ cubic splines: counterexamples, geometric stability, and indecomposable defects

We study vertex evaluation on the full space of continuously differentiable piecewise cubic polynomials on a fixed planar triangulation. A complete dual description turns failure of interpolation into balanced edge weights with nonzero vertex loading. It leads to exact counterexamples with 17, 25, 31 and 41 vertices, each with one relation and the classical lower-bound dimension. The 31- and 41-vertex examples have interior graphs that are trees. We give a geometric construction criterion for a sector-completion family and a certified implicit construction outside that family. With all boundary vertices fixed, the nearby bad configurations form a four-dimensional smooth locus in the 17-vertex case, two intersecting components of dimensions six and five in the 25-vertex case, and isolated transverse points in the two tree examples. A common Schur-complement estimate explains their different interpolation costs. We first realize arbitrary defect by decomposable chains of the 41-vertex example. We then construct obstructions from individually interpolatory blocks, prove that the capacity of one complete edge is exactly five, and build a fixed-square family with arbitrarily large strongly indecomposable defect. The latter excludes two triangle-disjoint connected normal bad submeshes even when those submeshes may have holes.

math.NA↗