posted on 2009-12-09, 16:49authored byJoanne 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.
History
School
Mechanical, Electrical and Manufacturing Engineering
Citation
FOSTER, 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