The problem of computing the minimal eigenvalue of a real symmetric positive definite Toeplitz matrix is considered. Algorithms for estimating such an eigenvalue, which need only one or two inverses, are presented. The suggested algorithms are based on good initial approximations to the corresponding eigenvector which can be derived by approximating the Toeplitz matrix by circulant matrices.
|Original language||English (US)|
|Number of pages||7|
|Journal||Applied Mathematics and Computation|
|State||Published - Sep 1994|
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics