In this article we discuss a small modification of the bisection routines i
n EISPACK and LAPACK for finding a few of the eigenvalues of a symmetric tr
idiagonal matrix A. When the principal miners of the matrix A yield good ap
proximations to the desired eigenvalues, these modifications can yield abou
t 30% reduction in the computation times.