An Algorithm for Computing the QR Decomposition of a Polynomial Matrix

Author

Foster, Joanne ; McWhirter, John ; Chambers, Jonathon

Author_Institution

Cardiff Univ., Cardiff

fYear

2007

fDate

1-4 July 2007

Firstpage

71

Lastpage

74

Abstract

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 scalar Givens rotation matrices can no longer be applied. Instead, a polynomial Givens rotation is introduced, enabling the QR decomposition of a polynomial matrix. Convergence of the algorithm is discussed and through simulations the capability of the algorithm is assessed.

Keywords

convergence of numerical methods; polynomial matrices; Givens rotation polynomial; QR decomposition; algorithm convergence; polynomial matrix; scalar matrix; Communication channels; Computational modeling; Covariance matrix; Delay effects; Equations; Finite impulse response filter; Matrix decomposition; Polynomials; Sensor arrays; Signal processing algorithms; Polynomial matrix; paraunitary matrix; polynomial matrix QR decomposition;

fLanguage

English

Publisher

ieee

Conference_Titel

Digital Signal Processing, 2007 15th International Conference on

Conference_Location

Cardiff

Print_ISBN

1-4244-0882-2

Electronic_ISBN

1-4244-0882-2

Type

conf

DOI

10.1109/ICDSP.2007.4288521

Filename

4288521