| An algorithm to determine the eigenintervals of the generalized eigenvalue problem {dollar}Asp1x=lambda Bsp1x,{dollar} where {dollar}(Asp1,Bsp1){dollar} 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. |
