A Deterministic Algorithm for Eigenvalue Separation in Tridiagonal Matrices

We develop a deterministic algorithm for separating the eigenvalues of Hermitian tridiagonal matrices by small diagonal perturbations. For $\|T\|_2\leq1$, $0<δ<1/2$, and $X=\mathrm{diag}(1,\ldots,n)$, our algorithm selects $t\in[0,δ/n]$ such that $D=tX$ satisfies $\|D\|_2\leqδ$ and $\mathrm{gap}(T+D)>c\,δ^2n^{-12}$ for an absolute constant $c>0$. The construction uses a classical convex weighted eigenvalue sum and its finite-scale slope variation. A tridiagonal localization argument turns near-degenerate eigenvalues into separated responses to the fixed diagonal direction, yielding a quantitative gap certificate. An adaptive interval selector then identifies a certifying window in at most $\lceil\log_2(16n^3)\rceil$ refinements, using $O(\log n)$ evaluations of the weighted eigenvalue sum to inverse-polynomial accuracy. A structure-exploiting implementation uses rigorous Sturm eigenvalue enclosures and adaptive precision to certify the stopping condition on six families of test matrices. The directly certified gaps are substantially larger than the worst-case analytical bounds, illustrating both the effectiveness of the construction and the conservatism of the universal certificate. Our results give a deterministic answer to the eigenvalue-separation question underlying the deterministic Minami perturbation problem for tridiagonal matrices.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.21055
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Deterministic Algorithm for Eigenvalue Separation in Tridiagonal Matrices

Wenqi Zhu, Ping Nie
arXiv (Cornell University)
Matrix Theory and Algorithms
preprint

A Deterministic Algorithm for Eigenvalue Separation in Tridiagonal Matrices

Wenqi Zhu, Ping Nie
preprint en

Abstract

We develop a deterministic algorithm for separating the eigenvalues of Hermitian tridiagonal matrices by small diagonal perturbations. For $\|T\|_2\leq1$, $0<δ<1/2$, and $X=\mathrm{diag}(1,\ldots,n)$, our algorithm selects $t\in[0,δ/n]$ such that $D=tX$ satisfies $\|D\|_2\leqδ$ and $\mathrm{gap}(T+D)>c\,δ^2n^{-12}$ for an absolute constant $c>0$. The construction uses a classical convex weighted eigenvalue sum and its finite-scale slope variation. A tridiagonal localization argument turns near-degenerate eigenvalues into separated responses to the fixed diagonal direction, yielding a quantitative gap certificate. An adaptive interval selector then identifies a certifying window in at most $\lceil\log_2(16n^3)\rceil$ refinements, using $O(\log n)$ evaluations of the weighted eigenvalue sum to inverse-polynomial accuracy. A structure-exploiting implementation uses rigorous Sturm eigenvalue enclosures and adaptive precision to certify the stopping condition on six families of test matrices. The directly certified gaps are substantially larger than the worst-case analytical bounds, illustrating both the effectiveness of the construction and the conservatism of the universal certificate. Our results give a deterministic answer to the eigenvalue-separation question underlying the deterministic Minami perturbation problem for tridiagonal matrices.

arXiv (Cornell University)
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