ITEM METADATA RECORD
Title: A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix
Authors: Mastronardi, Nicola *
Van Barel, Marc * ×
Vandebril, Raf * #
Issue Date: Jan-2008
Publisher: North-Holland, New York
Series Title: Linear Algebra and its Applications vol:428 issue:2-3 pages:479-491
Abstract: Recent progress in signal processing and estimation has generated considerable interest in the problem of computing the smallest eigenvalue of symmetric positive definite Toeplitz matrices. Several algorithms have been proposed in the literature. They compute the smallest eigenvalue in an iterative fashion, many of them relying on the Levinson–Durbin solution of sequences of Yule–Walker systems.
Exploiting the properties of two algorithms recently developed for estimating a lower and an upper bound of the smallest singular value of upper triangular matrices, respectively, an algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix is derived. The algorithm relies on the computation of the R factor of the QR-factorization of the Toeplitz matrix and the inverse of R. The simultaneous computation of $R$ and $R^{-1}$ is efficiently accomplished by the generalized Schur algorithm.
ISSN: 0024-3795
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Numerical Analysis and Applied Mathematics Section
* (joint) first author
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
Mastronardi_VanBarel_Vandebril_2008b.pdf Published 352KbAdobe PDFView/Open

 


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science