An algorithm for computing the QR decomposition of a polynomial matrix
conference contributionposted on 09.12.2009, 16:49 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