A polynomial eigenvalue decomposition of paraher-#R##N#mitian matrices can be calculated approximately using iterative approaches such as the sequential matrix diagonalisation (SMD) algorithm. In this paper, we present an improved SMD algorithm which, compared to existing SMD approaches, eliminates more off-diagonal energy per step. This leads to faster convergence while incurring only a marginal increase in complexity. We motivate the approach, prove its convergence, and demonstrate some results that underline the algorithm’s performance.
['Jamie Corr', 'Keith Thompson', 'Stephan Weiss', 'John G. McWhirter', 'Soydan Redif', 'Ian K. Proudler']
Multiple shift maximum element sequential matrix diagonalisation for parahermitian matrices