Finding the closest normal structured matrix
Numerical Analysis
2024-03-20 v1 Numerical Analysis
Abstract
Given a structured matrix 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.
Keywords
Cite
@article{arxiv.2003.06391,
title = {Finding the closest normal structured matrix},
author = {Erna Begovic},
journal= {arXiv preprint arXiv:2003.06391},
year = {2024}
}
Comments
Submission arXiv:1810.03369v1 [math.NA] is split into two parts. This is a part dealing with the problem of finding the closest normal matrix. 24 pages, 4 figures, 1 table