Multiple shift QR decomposition for polynomial matrices

Tools

Coutts, Fraser K. and Corr, Jamie and Thompson, Keith and Weiss, Stephan and Proudler, Ian K. and McWhirter, John G.; (2016) Multiple shift QR decomposition for polynomial matrices. In: 11th IMA International Conference on Mathematics in Signal Processing. Institute of Mathematics and its Applications, GBR, pp. 1-4.

[thumbnail of Coutts-etal-IMAICMSP-2016-Multiple-shift-QR-decomposition-for-polynomial matrices]
Preview
 Text. Filename: Coutts_etal_IMAICMSP_2016_Multiple_shift_QR_decomposition_for_polynomial_matrices.pdf
Accepted Author Manuscript
Download (77kB)| Preview

Abstract

In recent years, several algorithms for the iterative calculation of a polynomial matrix QR decomposition (PQRD) have been introduced. The PQRD is a generalisation of the ordinary QRD and uses paraunitary operations to upper-triangularise a polynomial matrix. This paper addresses a multiple shift strategy that can be applied to an existing PQRD algorithm. We demonstrate that with the proposed strategy, the computation time of the algorithm can be reduced. The benefits of this are important for a number of broadband multichannel problems.

ORCID iDs

Coutts, Fraser K. ORCID logoORCID: https://orcid.org/0000-0003-2299-2648, Corr, Jamie ORCID logoORCID: https://orcid.org/0000-0001-9900-0796, Thompson, Keith ORCID logoORCID: https://orcid.org/0000-0003-0727-7347, Weiss, Stephan ORCID logoORCID: https://orcid.org/0000-0002-3486-7206, Proudler, Ian K. and McWhirter, John G.;
CORE (COnnecting REpositories)