A new derivation of the algorithm proposed by Davidson for obtaining some of the lowest eigenvalues and corresponding eigenvectors of large, symmetric matrices is presented. This derivation, which rests on the concepts of Galerkin approximation and coordinate relaxation, allows a simple description of the algorithm procedures. Then, a listing of the corresponding FORTRAN subroutine is given and an evaluation is made of its performances.