[en] A general eigenvalue solver for a large sparse symmetric matrix with zero eigenvalue solutions is developed using a subspace method. The technique for the large sparse system is a list vector; for a system with zero eigenvalues, a zero filter technique is added. The solutions can be obtained starting from the smallest eigenvalue excepting zero eigenvalue solutions. (author)