Multiple shift QR decomposition for polynomial matrices

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.

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.

• Share and Export
  

  RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSHTML CitationASCII CitationOpenURL ContextObjectEndNoteOpenURL ContextObject in SpanMODSMPEG-21 DIDLEP3 XMLData Cite XMLRIS (EndNote Online, Zotero, Ref manager, etc)RDF+N3Multiline CSV
• Item metadata

  Item type:	Book Section
  ID code:	57613
  Dates:	Date Event 12 December 2016 Published 6 July 2016 Accepted
  Subjects:	Science > Mathematics Technology > Electrical engineering. Electronics Nuclear engineering
  Department:	Faculty of Engineering > Electronic and Electrical Engineering Technology and Innovation Centre > Sensors and Asset Management
  Depositing user:	Pure Administrator
  Date deposited:	31 Aug 2016 15:47
  Last modified:	13 Jun 2024 07:54
  URI:	https://strathprints.strath.ac.uk/id/eprint/57613