Generalised eigenvialue problem for tridiagonal symmetric interval matrices
[Thesis]
Y. A.-B. Salem
King Fahd University of Petroleum and Minerals (Saudi Arabia)
1997
65
M.S.
King Fahd University of Petroleum and Minerals (Saudi Arabia)
1997
An algorithm to determine the eigenintervals of the generalized eigenvalue problem usdA\sp1x=\lambda B\sp1x,usd where usd(A\sp1,B\sp1)usd is a pair of real tridiagonal symmetric interval matrices, is presented. The eigenintervals are exactly calculated. The algorithm requires twice as much computational effort as the Sturm algorithm which is used for real point matrices.