Certifying Degenerate Spectral Subspaces in Stateful Scientific Computation.

A small eigenpair residual does not certify recovery of a complete spectral subspace when the requested cutoff intersects a multiple eigenvalue. We present a finite qualification procedure combining an independently established spectral count and excluded-spectrum separation with exact arithmetic on saved binary Ritz data. A residual-and-Gram estimate bounds the Frobenius error of the saved low-rank projector without forming a dense projector. An archived recursive-graph case study contains 13 source matrices of orders 324, 972, 2916 and 8748, 22 prescribed payloads, two invocation histories per payload and 19 negative controls. The complete target contains 25 nonconstant dimensions, including a threefold boundary eigenspace. The largest recorded error bound is below 1.034 × 10⁻⁹, against the predeclared 10⁻⁶ ceiling. During manuscript preparation all 66 saved frames were re-evaluated with the supplied exact checker and reproduced their original rational certificates. This replay checks saved outputs; it is not a new eigensolver run or an independent external implementation. The contribution is a reproducible integration of established subspace estimates, exact graph spectra and explicit execution-history coverage, with a precise boundary between finite qualification and unrestricted reproducibility claims.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-17
DOI
https://doi.org/10.5281/zenodo.24312118
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Certifying Degenerate Spectral Subspaces in Stateful Scientific Computation.

Marco Gericke
1 links
Zenodo (CERN European Organization for Nuclear Research)
Matrix Theory and Algorithms
preprint

Certifying Degenerate Spectral Subspaces in Stateful Scientific Computation.

Marco Gericke
preprint en

Abstract

A small eigenpair residual does not certify recovery of a complete spectral subspace when the requested cutoff intersects a multiple eigenvalue. We present a finite qualification procedure combining an independently established spectral count and excluded-spectrum separation with exact arithmetic on saved binary Ritz data. A residual-and-Gram estimate bounds the Frobenius error of the saved low-rank projector without forming a dense projector. An archived recursive-graph case study contains 13 source matrices of orders 324, 972, 2916 and 8748, 22 prescribed payloads, two invocation histories per payload and 19 negative controls. The complete target contains 25 nonconstant dimensions, including a threefold boundary eigenspace. The largest recorded error bound is below 1.034 × 10⁻⁹, against the predeclared 10⁻⁶ ceiling. During manuscript preparation all 66 saved frames were re-evaluated with the supplied exact checker and reproduced their original rational certificates. This replay checks saved outputs; it is not a new eigensolver run or an independent external implementation. The contribution is a reproducible integration of established subspace estimates, exact graph spectra and explicit execution-history coverage, with a precise boundary between finite qualification and unrestricted reproducibility claims.

Zenodo (CERN European Organization for Nuclear Research)
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon