ON THE INTERMEDIATE EIGENVALUES OF SYMMETRIC

An algorithm has been developed for finding the eigenvalues of a symmetric matrix A in a given interval [a, b] and the corresponding eigenvectors using a modification of the method of simultaneous iteration with the same favorable convergence properties. The technique is most suitable for large sparse matrices and can be effectively implemented on a parallel computer such as the ILLIAC IV.