For parahermitian polynomial matrices, which can be used, for example, to characterize
space-time covariance in broadband array processing, the conventional eigenvalue …

An analytic parahermitian matrix admits an eigenvalue decomposition (EVD) with analytic
eigenvalues and eigenvectors except in the case of multiplexed data. In this paper, we …

This paper addresses the extension of the factorization of a Hermitian matrix by an
eigenvalue decomposition (EVD) to the case of a parahermitian matrix that is analytic at …

This paper presents initial progress on formulating minimum variance distortionless
response (MVDR) broadband beam-forming using a generalised sidelobe canceller (GSC) …

In this paper, we show that the paraunitary (PU) matrices that arise from the polynomial
eigenvalue decomposition (PEVD) of a parahermitian matrix are not unique. In particular …

A polynomial eigenvalue decomposition of paraher-mitian matrices can be calculated
approximately using iterative approaches such as the sequential matrix diagonalisation …

In this paper, a new algorithm for calculating the QR decomposition (QRD) of a polynomial
matrix is introduced. This algorithm amounts to transforming a polynomial matrix to upper …

This paper presents a novel method for calculating a compact order singular value
decomposition (SVD) of polynomial matrices, building upon the recently proven existence of …

In this paper, we present an improved version of the second order sequential best rotation
algorithm (SBR2) for polynomial matrix eigenvalue decomposition of para-Hermitian …

A number of algorithms are capable of iteratively calculating a polynomial matrix eigenvalue
decomposition (PEVD), which is a generalisation of the EVD and will diagonalise a …