Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Remote Access
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)


Algorithms for triangular decomposition of block Hankel and Toeplitz matrices with application to factoring positive matrix polynomials

Author: J. Rissanen
Journal: Math. Comp. 27 (1973), 147-154
MSC: Primary 65F30
MathSciNet review: 0329235
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Algorithms are given for calculating the block triangular factors $ A,\hat A,B = {A^{ - 1}}$ and $ \hat B = {\hat A^{ - 1}}$ and the block diagonal factor D in the factorizations $ R = AD\hat A$ and $ BR\hat B = D$ of block Hankel and Toeplitz matrices R. The algorithms require $ O({p^3}{n^2})$ operations when R is an $ n \times n$-matrix of $ p \times p$-blocks.

As an application, an iterative method is described for factoring $ p \times p$-matrix valued positive polynomials $ R = \sum\nolimits_{i = - m}^m {R_i}{x^i},{R_{ - i}} = {R'_i} $, as $ \bar A(x)\bar A'({x^{ - 1}})$, where $ \bar A(x)$ is outer.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65F30

Retrieve articles in all journals with MSC: 65F30

Additional Information

PII: S 0025-5718(1973)0329235-5
Keywords: Hankel and Toeplitz matrices, triangular decomposition of matrices
Article copyright: © Copyright 1973 American Mathematical Society

Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia