Picture of classic books on shelf

Literary linguistics: Open Access research in English language

Strathprints makes available Open Access scholarly outputs by English Studies at Strathclyde. Particular research specialisms include literary linguistics, the study of literary texts using techniques drawn from linguistics and cognitive science.

The team also demonstrates research expertise in Renaissance studies, researching Renaissance literature, the history of ideas and language and cultural history. English hosts the Centre for Literature, Culture & Place which explores literature and its relationships with geography, space, landscape, travel, architecture, and the environment.

Explore all Strathclyde Open Access research...

Complexity and search space reduction in cyclic-by-row PEVD algorithms

Coutts, Fraser K. and Corr, Jamie and Thompson, Keith and Weiss, Stephan and Proudler, Ian K. and McWhirter, John G. (2016) Complexity and search space reduction in cyclic-by-row PEVD algorithms. In: 50th Asilomar Conference on Signals, Systems and Computers, 2016-11-06 - 2016-11-09, Asilomar Conference Ground. (In Press)

[img]
Preview
Text (Coutts-etal-ACSSC-2016-Complexity-and-search-space-reduction-in-cyclic-by-row-PEVD-algorithms)
Coutts_etal_ACSSC_2016_Complexity_and_search_space_reduction_in_cyclic_by_row_PEVD_algorithms.pdf
Accepted Author Manuscript

Download (150kB) | Preview

Abstract

In recent years, several algorithms for the iterative calculation of a polynomial matrix eigenvalue decomposition (PEVD) have been introduced. The PEVD is a generalisation of the ordinary EVD and uses paraunitary operations to diagonalise a parahermitian matrix. This paper addresses potential computational savings that can be applied to existing cyclic-by-row approaches for the PEVD. These savings are found during the search and rotation stages, and do not significantly impact on algorithm accuracy. We demonstrate that with the proposed techniques, computations can be significantly reduced. The benefits of this are important for a number of broadband multichannel problems.