Maximum energy sequential matrix diagonalisation for parahermitian matrices

Sequential matrix diagonalisation (SMD) refers to a family of algorithms to iteratively approximate a polynomial matrix eigenvalue decomposition. Key is to transfer as much energy as possible from off-diagonal elements to the diagonal per iteration, which has led to fast converging SMD versions involving judicious shifts within the polynomial matrix. Through an exhaustive search, this paper determines the optimum shift in terms of energy transfer. Though costly to implement, this scheme yields an important benchmark to which limited search strategies can be compared. In simulations, multiple-shift SMD algorithms can perform within 10% of the optimum energy transfer per iteration step