ITEM METADATA RECORD
Title: A Schur-based algorithm for computing the smallest eigenvalue of a symmetric positive definite Toeplitz matrix
Authors: Mastronardi, Nicola
Van Barel, Marc
Vandebril, Raf
Issue Date: May-2006
Publisher: K.U.Leuven, Department of Computer Science
Series Title: TW Reports vol:TW461
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. Many of them compute the smallest eigenvalue in an iterative fashion, 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 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 latter computation is efficiently accomplished by the generalized Schur algorithm.
URI: 
Publication status: published
KU Leuven publication type: IR
Appears in Collections:Electrical Engineering - miscellaneous
Numerical Analysis and Applied Mathematics Section

Files in This Item:
File Status SizeFormat
TW461.pdf Submitted 287KbAdobe PDFView/Open

 


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