Stable factorization of Hankel and Hankel-like matrices
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]
|Collections||ANU Research Publications|
|1556-01.2003-07-02T02:07:10Z.xsh||356 B||EPrints MD5 Hash XML|
|TR-CS-98-12.pdf||318.84 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.