[19] A.Melman, "Computation of the smallest even and odd eigenvalues of a symmetric positive-definite Toeplitz matrix", SIAM J. on Matrix Analysis and Applications, 25 (2004), 947-963.

Robert T. Gregory, Computing Eigenvalues and Eigenvectors of a Symmetric Matrix on the ILLIAC, Mathematical Tables and Other Aids to Computation, Vol. 7, No. 44 (Oct., 1953), pp. 215-220 ...

The matrix $A_ {N}$ is Hermitian (resp., symmetric) and deterministic with all but finitely many eigenvalues equal to zero. We first show that, as soon as the first largest or last smallest ...

In order to solve our inverse problem we simply apply the Lanczos method to the matrix . The same problem can be solved by the Gelfand-Levitan method in the following way. Let be an arbitrary known ...

Notice that since a is not symmetric the eigenvalues are complex. The first column of the VAL matrix is the real part and the second column is the complex part of the three eigenvalues.