Picture offshore wind farm

Open Access research that is improving renewable energy technology...

Strathprints makes available scholarly Open Access content by researchers across the departments of Mechanical & Aerospace Engineering (MAE), Electronic & Electrical Engineering (EEE), and Naval Architecture, Ocean & Marine Engineering (NAOME), all of which are leading research into aspects of wind energy, the control of wind turbines and wind farms.

Researchers at EEE are examining the dynamic analysis of turbines, their modelling and simulation, control system design and their optimisation, along with resource assessment and condition monitoring issues. The Energy Systems Research Unit (ESRU) within MAE is producing research to achieve significant levels of energy efficiency using new and renewable energy systems. Meanwhile, researchers at NAOME are supporting the development of offshore wind, wave and tidal-current energy to assist in the provision of diverse energy sources and economic growth in the renewable energy sector.

Explore Open Access research by EEE, MAE and NAOME on renewable energy technologies. Or explore all of Strathclyde's Open Access research...

Sequential matrix diagonalization algorithms for polynomial EVD of parahermitian matrices

Redif, Soydan and Weiss, Stephan and McWhirter, John G. (2015) Sequential matrix diagonalization algorithms for polynomial EVD of parahermitian matrices. IEEE Transactions on Signal Processing, 63 (1). pp. 81-89. ISSN 1053-587X

[img]
Preview
PDF (Redif-etal-IEEETSP-2015-Sequential-matrix-diagonalization-algorithms)
Redif_etal_IEEETSP_2015_Sequential_matrix_diagonalization_algorithms.pdf
Accepted Author Manuscript

Download (853kB) | Preview

Abstract

For parahermitian polynomial matrices, which can be used, for example, to characterise space-time covariance in broadband array processing, the conventional eigenvalue decomposition (EVD) can be generalised to a polynomial matrix EVD (PEVD). In this paper, a new iterative PEVD algorithm based on sequential matrix diagonalisation (SMD) is introduced. At every step the SMD algorithm shifts the dominant column or row of the polynomial matrix to the zero lag position and eliminates the resulting instantaneous correlation. A proof of convergence is provided, and it is demonstrated that SMD establishes diagonalisation faster and with lower order operations than existing PEVD algorithms.