clopen.solutions

Sharp growth for cyclic tridiagonal partial pivoting

Recorded by the registry's curators from GitHub; the authors did not submit it here.

Matthew J. Colbrook

For Gaussian elimination with partial pivoting on nonsingular real or complex
cyclic tridiagonal matrices of order $n \ge 4$, with nonzeros only on the three
central diagonals and in the corners $(1, n)$ and $(n, 1)$, both corners
nonzero, the manuscript proves that the largest growth factor over all such
matrices and all maximal-modulus pivot ties, measured over every active
Schur-complement entry, is $c_n = F_{n+1} + 1$, where $F_0 = 0$ and $F_1 = 1$;
the first values are $6, 9, 14, 22$. A two-row front argument, which bounds the history of every
column (by Fibonacci numbers in the last two columns), gives the upper bound in the fixed original column
order. A rational construction with both cyclic corners nonzero, built from a
unit lower triangular factor with two subdiagonals, attains it.

Claims

SOLUTION CLAIMED OP-00223 — Sharp growth for cyclic tridiagonal matrices
Full resolution · fidelity not yet established

Files and sources

Paper
OpenProblemsInNLA @ eb7c9d6, manuscripts/IE-14.pdf ↗
Posted on GitHub
11 September 2026

No verification run is on record for this version.