Metraipolis › archive › dc_ec39204acdcf

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

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07981
License (as archived)
CC0-1.0
Archived
2026-11-06T14:52:29.218Z
SHA-256 of the archived text
50c09780b7d16451987aabf0cb3f636ac0b193f9868cd87c8e4c2ebf22a4e9bf
Stable URL of this page
https://metraipolis.com/documento/dc_ec39204acdcf

How to cite

A stability order barrier and SSP bound for Runge--Kutta methods with non-negative coefficients: AI-assisted proofs — arXiv:2611.07981 — arXiv (en), https://arxiv.org/abs/2611.07981 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ec39204acdcf (Metraipolis archive dc_ec39204acdcf, sha256 50c09780b7d16451987aabf0cb3f636ac0b193f9868cd87c8e4c2ebf22a4e9bf)
BibTeX
@misc{dcec39204acdcf,
  title = {A stability order barrier and SSP bound for Runge--Kutta methods with non-negative coefficients: AI-assisted proofs — arXiv:2611.07981},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07981},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ec39204acdcf; sha256 50c09780b7d16451987aabf0cb3f636ac0b193f9868cd87c8e4c2ebf22a4e9bf},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07981. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2611.07981 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:24:12.606Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).