Eigenvalues of symmetric tridiagonal interval matrices revisited

04/12/2017
by   Milan Hladík, et al.
0

In this short note, we present a novel method for computing exact lower and upper bounds 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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset