Skip navigation
Skip navigation

Stable factorization of Hankel and Hankel-like matrices

Olshevsky, Vadim; Stewart, Michael


This paper gives displacement structure algorithms for the factorization positive defjnite and indefinite Hankel and Hankel-like matrices. The positive definite algorithm uses orthogonal symplectic transformations in place of the E-orthogonal transformations used in Toeplitz algorithms. The indefinite algorithm uses a look-ahead step and is based on the observation that displacement structure algorithms for Hankel factorization have a natural and simple block generalization. Both algorithms...[Show more]

CollectionsANU Research Publications
Date published: 1998
Type: Working/Technical Paper


File Description SizeFormat Image
TR-CS-98-12.pdf318.84 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator