An algorithm for computing the QR decomposition of a polynomial matrix

An algorithm for computing the QR decomposition of a polynomial matrix

This paper introduces an algorithm for computing a QR decomposition of a polynomial matrix. The algorithm proceeds to perform the decomposition by following the same strategy in eliminating entries of the matrix as is used in the Givens method for a QR decomposition of a scalar matrix. However scala...

Full description

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

Internet

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

Similar Items