Multiple shift maximum element sequential matrix diagonalisation for parahermitian matrices

Tools

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. (https://doi.org/10.1109/SSP.2014.6884638)

[thumbnail of Corr-etal-SSP2014-multiple-shift-maximum-element-sequential-matrix]
Preview
 PDF. Filename: 1569904845.pdf
Accepted Author Manuscript
Download (348kB)| Preview

Abstract

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.

ORCID iDs

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, McWhirter, John G., Redif, Soydan and Proudler, Ian K.;
CORE (COnnecting REpositories)