An algorithm for calculating the QR and singular value decompositions of polynomial matrices

In this paper, a new algorithm for calculating the QR decomposition (QRD) of a polynomial matrix is introduced. This algorithm amounts to transforming a polynomial matrix to upper triangular form by application of a series of paraunitary matrices such as elementary delay and rotation matrices. It is...

Full description

Saved in:
Bibliographic Details
Main Authors: Joanne Foster, John McWhirter, Martin Davies, Jonathon Chambers
Format: Default Article
Published: 2009
Subjects:
Mechanical engineering not elsewhere classified
Convolutive mixing
Multiple-input–multiple-output (MIMO) channel equalization
Paraunitary matrix
Polynomial matrix QR decomposition (QRD)
Polynomial matrix singular value decomposition (SVD)
Mechanical Engineering not elsewhere classified
Online Access:https://hdl.handle.net/2134/5944
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items