Computing the Nearest Rank-Deficient Matrix Polynomial
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Matrix polynomials appear in many areas of computational algebra, control systems theory, differential equations, and mechanics, typically with real or complex coefficients. Because of numerical error and instability, a matrix polynomial may appear of considerably higher rank (generically full rank), while being very close to a rank-deficient matrix. "Close" is defined naturally under the Frobenius norm on the underlying coefficient matrices of the matrix polynomial. In this paper we consider the problem of finding the nearest rank-deficient matrix polynomial to an input matrix polynomial, that is, the nearest square matrix polynomial which is algebraically singular. We prove that such singular matrices at minimal distance always exist (and we are never in the awkward situation having an infimum but no actual matrix polynomial at minimal distance). We also show that singular matrices at minimal distance are all isolated, and are surrounded by a basin of attraction of non-minimal solutions. Finally, we present an iterative algorithm which, on given input sufficiently close to a rank-deficient matrix, produces that matrix. The algorithm is efficient and is proven to converge quadratically given a sufficiently good starting point. An implementation demonstrates the effectiveness and numerical robustness in practice.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it