Eigenvalues of symmetric tridiagonal interval matrices revisited
arXiv:1704.036701.22 citationsh-index: 25
Originality Synthesis-oriented
AI Analysis
Provides a practical tool for eigenvalue analysis in interval matrices, though incremental over existing methods.
The paper presents a fast, simple method for computing exact eigenvalue bounds of symmetric tridiagonal interval matrices, avoiding assumptions and providing explicit matrices for bound attainment.
In this short note, we present a novel method for computing exact lower and upper bounds of eigenvalues of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and avoids any assumptions. Our construction explicitly yields those matrices for which particular lower and upper bounds are attained.