Recurrence relations for the even and odd characteristic polynomials of a symmetric Toeplitz matrix

Abstract

In a recent paper [10] Melman proved an even–odd factorization of the characteristic polynomial of a symmetric Toeplitz matrix T on which a symmetry exploiting method for computing the smallest eigenvalue of T can be based. In this note we present a proof of the factorization which is less technical and more transparent.