Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

Memory and complexity reduction in parahermitian matrix manipulations of PEVD algorithms

Coutts, Fraser K. and Corr, Jamie and Thompson, Keith and Weiss, Stephan and Proudler, Ian K. and McWhirter, John G. (2016) Memory and complexity reduction in parahermitian matrix manipulations of PEVD algorithms. In: 2016 24th European Signal Processing Conference. IEEE, Piscataway, pp. 1633-1637. ISBN 9780992862657

[img]
Preview
Text (Coutts-etal-EUSIPCO2016-Memory-and-complexity-reduction-in-parahermitian-matrix-manipulations)
Coutts_etal_EUSIPCO2016_Memory_and_complexity_reduction_in_parahermitian_matrix_manipulations.pdf - Accepted Author Manuscript

Download (152kB) | Preview

Abstract

A number of algorithms for the iterative calculation of a polynomial matrix eigenvalue decomposition (PEVD) have been introduced. The PEVD is a generalisation of the ordinary EVD and will diagonalise a parahermitian matrix via paraunitary operations. This paper addresses savings — both computationally and in terms of memory use — that exploit the parahermitian structure of the matrix being decomposed, and also suggests an implicit trimming approach to efficiently curb the polynomial order growth usually observed during iterations of the PEVD algorithms. We demonstrate that with the proposed techniques, both storage and computations can be significantly reduced, impacting on a number of broadband multichannel problems.