Finding the closest normal structured matrix

DOI10.1016/j.laa.2021.01.013zbMath1460.15014arXiv2003.06391OpenAlexW3123741268MaRDI QIDQ2656639

Erna Begović Kovač

Publication date: 16 March 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.06391

zbMATH Keywords

diagonalizationHamiltonian matrixnormal matricesGivens rotationsskew-Hamiltonian matrixJacobi-type algorithm

Mathematics Subject Classification ID

Factorization of matrices (15A23) Hermitian, skew-Hermitian, and related matrices (15B57) Canonical forms, reductions, classification (15A21) Diagonalization, Jordan forms (15A20)

Related Items (1)

Convergence of a Jacobi-type method for the approximate orthogonal tensor diagonalization

Cites Work

• Unnamed Item
• The structured distance to normality of an irreducible real tridiagonal matrix
• A Schur decomposition for Hamiltonian matrices
• The structured distance to normality of banded Toeplitz matrices
• The normal \(\Delta\) H-matrices with connection to some Jacobi-like methods
• Closest normal matrix finally found
• Characterization and properties of matrices with generalized symmetry or skew symmetry.
• Structured distance to normality of tridiagonal matrices
• Computing the closest real normal matrix and normal completion
• Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors
• The structured distance to normality of Toeplitz matrices with application to preconditioning
• On Asymptotic Convergence of Nonsymmetric Jacobi Algorithms
• Matrizen mit maximaler Diagonale bei unitärer Similarität.
• Structured tools for structured matrices

This page was built for publication: Finding the closest normal structured matrix