Finding the closest normal structured matrix

03/13/2020

∙

by   Erna Begovic, et al.

∙

0

∙

share

Given a structured matrix A we study the problem of finding the closest normal matrix with the same structure. The structures of our interest are: Hamiltonian, skew-Hamiltonian, per-Hermitian, and perskew-Hermitian. We develop a structure-preserving Jacobi-type algorithm for finding the closest normal structured matrix and show that such algorithm converges to a stationary point of the objective function.