A novel algorithm for calculating the QR decomposition of a polynomial matrix

A novel algorithm for calculating the QR decomposition of a polynomial matrix

A novel algorithm for calculating the QR decomposition (QRD) of polynomial matrix is proposed. The algorithm operates by applying a series of polynomial Givens rotations to transform a polynomial matrix into an upper-triangular polynomial matrix and, therefore, amounts to a generalisation of the con...

Full description

Saved in:
Bibliographic Details
Main Authors: Joanne Foster, Jonathon Chambers, John McWhirter
Format: Default Conference proceeding
Published: 2009
Subjects:
Mechanical engineering not elsewhere classified
Paraunitary matrix
Polynomial matrix QR decomposition
Broadband MIMO channel equalisation
Mechanical Engineering not elsewhere classified
Online Access:https://hdl.handle.net/2134/5873
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/5873

Similar Items