Cyclic-by-row approximation of iterative polynomial EVD algorithms

Tools

Corr, Jamie and Thompson, Keith and Weiss, Stephan and McWhirter, John G. and Proudler, Ian K.; (2014) Cyclic-by-row approximation of iterative polynomial EVD algorithms. In: Sensor Signal Processing for Defence (SSPD), 2014. IEEE, GBR, pp. 1-5. ISBN 978-1-4799-5294-6 (https://doi.org/10.1109/SSPD.2014.6943330)

[thumbnail of Corr-etal-SSPD-2014-Cyclic-by-row-approximation-of-iterative]
Preview
 Text. Filename: Corr_etal_SSPD_2014_Cyclic_by_row_approximation_of_iterative.pdf
Accepted Author Manuscript
Download (164kB)| Preview

Abstract

A recent class of sequential matrix diagonalisation (SMD) algorithms have been demonstrated to provide a fast converging solution to iteratively approximating the polynomial eigenvalue decomposition of a parahermitian matrix. However, the calculation of an EVD, and the application of a full unitary matrix to every time lag of the parahermitian matrix in the SMD algorithm results in a high numerical cost. In this paper, we replace the EVD with a limited number of Givens rotations forming a cyclic-by-row Jacobi sweep. Simulations indicate that a considerable reduction in computational complexity compared to SMD can be achieved with a negligible sacrifice in diagonalisation performance, such that the benefits in applying the SMD are maintained.

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