An algorithm for computing the QR decomposition of a polynomial matrix

Foster, J., McWhirter, John ORCID: https://orcid.org/0000-0003-1810-3318 and Chambers, J. A. 2007. An algorithm for computing the QR decomposition of a polynomial matrix. Presented at: 15th International Conference on Digital Signal Processing (DSP 2007), Cardiff, Wales, 1-4 July 2007. Digital Signal Processing, 2007- 15th International Conference (DSP 2007) (Cardiff, UK). IEEE, 71 - 74. 10.1109/ICDSP.2007.4288521

Full text not available from this repository.

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.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Engineering
Publisher:	IEEE
ISBN:	1424408822
Last Modified:	18 Oct 2022 14:08
URI:	https://orca.cardiff.ac.uk/id/eprint/16587

Citation Data

Cited 8 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item