Eigenvalues of symmetric tridiagonal interval matrices revisited

Abstract: 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.