Corr, J., Thompson, K., Weiss, S., McWhirter, John G. ![]() |
Preview |
PDF
- Accepted Post-Print Version
Download (161kB) | Preview |
Abstract
Recently a selection of sequential matrix diagonalisation (SMD) algorithms have been introduced which approximate polynomial eigenvalue decomposition of parahermitian matrices. These variants differ only in the search methods that are used to bring energy onto the zero-lag. Here we analyse the search methods in terms of their computational complexities for different sizes of parahermitian matrices which are verified through simulated execution times. Another important factor for these search methods is their ability to transfer energy. Simulations show that the more computationally complex search methods transfer a greater proportion of the off-diagonal energy onto the zero-lag over a selected range of parahermitian matrix sizes. Despite their higher cost per iteration experiments indicate that the more complex search algorithms still converge faster in real time.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Engineering |
Subjects: | T Technology > TK Electrical engineering. Electronics Nuclear engineering |
Publisher: | IEEE |
ISBN: | 9781479919635 |
Funders: | EPSRC, DSTL |
Date of First Compliant Deposit: | 21 April 2016 |
Date of Acceptance: | 31 July 2015 |
Last Modified: | 01 Nov 2022 09:55 |
URI: | https://orca.cardiff.ac.uk/id/eprint/89671 |
Actions (repository staff only)
![]() |
Edit Item |