Foster2.pdf (1.74 MB)
An algorithm for computing the QR decomposition of a polynomial matrix
conference contributionposted on 2009-12-09, 16:49 authored by Joanne Foster, John McWhirter, Jonathon Chambers
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.
- Mechanical, Electrical and Manufacturing Engineering
CitationFOSTER, J., MCWHIRTER, J. and CHAMBERS, J., 2007. An algorithm for computing the QR decomposition of a polynomial matrix. IN: 15th International conference on digital signal processing, Cardiff, 1-4 July, pp. 71-74
- VoR (Version of Record)
NotesThis is a conference paper [© IEEE]. It is also available at: http://ieeexplore.ieee.org/ Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.