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.

Explore

Performance trade-offs in sequential matrix diagonalisation search strategies

Corr, Jamie and Thompson, Keith and Weiss, Stephan and McWhirter, John G. and Proudler, Ian K. (2015) Performance trade-offs in sequential matrix diagonalisation search strategies. In: 2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP). IEEE, Piscataway, NJ., pp. 25-28. ISBN 9781479919635

[img]
Preview
Text (Corr-etal-CAMSAP2015-Performance-trade-offs-in-sequential-matrix-diagonalisation-search-strategies)
Corr_etal_CAMSAP2015_Performance_trade_offs_in_sequential_matrix_diagonalisation_search_strategies.pdf - Accepted Author Manuscript

Download (127kB) | 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.