This paper presents an algorithm for finding the eigenvalues of tridiagonal symmetric matrices. The method is in fact Laguerre's method modified in such a way that the explicit calculations of the coefficients of characteristic polynomial are avoided. Each eigenvalue is evaluated by the iterative process with cubic rate of convergence.