Cyclic-by-row approximation of iterative polynomial EVD Algorithms

Corr, J., Thompson, K., Weiss, S., McWhirter, John ORCID: https://orcid.org/0000-0003-1810-3318 and Proudler, I. K. 2014. Cyclic-by-row approximation of iterative polynomial EVD Algorithms. Presented at: 2014 Sensor Signal Processing for Defence (SSPD), Edinburgh, UK, 8-9 September 2014. Sensor Signal Processing for Defence (SSPD), 2014. 2014 Sensor Signal Processing for Defence. IEEE, 10.1109/SSPD.2014.6943330

Preview

PDF - Accepted Post-Print Version Download (154kB) | 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.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Engineering
Subjects:	T Technology > TA Engineering (General). Civil engineering (General)
Publisher:	IEEE
ISBN:	9781479952946
Date of First Compliant Deposit:	30 March 2016
Date of Acceptance:	2014
Last Modified:	06 Nov 2023 22:42
URI:	https://orca.cardiff.ac.uk/id/eprint/69301

Citation Data

Cited 5 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item