Referenced Items are not available for this document.
Easily computable bounds on the extreme eigenvalues of positive semidefinite (PSD) Toeplitz matrices are presented. The bounds are especially suitable for matrices of relatively small dimension. The bounds are derived for the wider class of PSD Hermitian matrices and interpreted via the Levinson-Durbin Algorithm for Toeplitz matrices. As a by-product of this derivation an order-recursive algorithm for the eigenvector/eigenvalue decomposition is obtained, and certain properties of the eigenvalues distribution are revealed
Published in:
Information Theory, IEEE Transactions on
(Volume:34
,
Issue:
2
)
Date of Publication: Mar 1988
- Page(s):
- 352 - 355
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 3232615
- Digital Object Identifier :
- 10.1109/18.2651
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Mar 1988
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
