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.


Multiple shift maximum element sequential matrix diagonalisation for parahermitian matrices

Corr, Jamie and Thompson, Keith and Weiss, Stephan and McWhirter, John G. and Redif, Soydan and Proudler, Ian K. (2014) Multiple shift maximum element sequential matrix diagonalisation for parahermitian matrices. In: 2014 IEEE Workshop on Statistical Signal Processing (SSP), 2014-06-29 - 2014-07-02, Australia.

PDF (Corr-etal-SSP2014-multiple-shift-maximum-element-sequential-matrix)
1569904845.pdf - Accepted Author Manuscript

Download (348kB) | Preview


A polynomial eigenvalue decomposition of paraher-mitian matrices can be calculated approximately using iterative approaches such as the sequential matrix diagonalisation (SMD) algorithm. In this paper, we present an improved SMD algorithm which, compared to existing SMD approaches, eliminates more off-diagonal energy per step. This leads to faster convergence while incurring only a marginal increase in complexity. We motivate the approach, prove its convergence, and demonstrate some results that underline the algorithm's performance.