Closest normal matrix finally found
closest normal matrixeigenvectorsfield of valuesFrobenius normHermitian matrixnumerical rangessimilaritysingular value decompositionspread of eigenvaluesunitary matrix
Eigenvalues, singular values, and eigenvectors (15A18) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Hermitian, skew-Hermitian, and related matrices (15B57) Orthogonalization in numerical linear algebra (65F25) Numerical computation of matrix norms, conditioning, scaling (65F35)
A method is given that will numerically find the closest normal matrix N (in the Frobenius norm) to a given matrix A by a sequence of unitary similarities. In the coordinate system of the eigenvectors of N, the obesity matrix of A is Hermitian. There is also a chapter with computed examples for the numerical ranges of N and A.
- A Procedure for the Diagonalization of Normal Matrices
- Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices
- scientific article; zbMATH DE number 3783337 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- Matrizen mit maximaler Diagonale bei unitärer Similarität.
- On the quadratic convergence of the Jabobi method for normal matrices
- The norm of a matrix after a similarity transformation
- The normal \(\Delta\) H-matrices with connection to some Jacobi-like methods
- The structured distance to normality of banded Toeplitz matrices
- The symmetric Procrustes problem
- Some aspects of the theory of norms
- Least-squares inner product shaping
- Structured distance to normality of tridiagonal matrices
- On the construction of nearest defective matrices to a normal matrix
- A Jacobi-like algorithm for computing the generalized Schur form of a regular pencil
- Computing the field of values and pseudospectra using the Lanczos method with continuation
- Destabilising nonnormal stochastic differential equations
- Computing eigenvalues of normal matrices via complex symmetric matrices
- Computing the closest real normal matrix and normal completion
- Properties of linear approximations of matrices in the spectral norm
- Finding the closest normal structured matrix
- Normal shape and numerical range of a real 2-Toeplitz tridiagonal matrix
- The structured distance to normality of Toeplitz matrices with application to preconditioning.
- Upper bounds for matrix diagonals
- Matrix differential equations: a continuous realization process for linear algebra problems
- scientific article; zbMATH DE number 567677 (Why is no real title available?)
- Numerical Rank Deficiency in Matrix Products
- scientific article; zbMATH DE number 920718 (Why is no real title available?)
- On the banded Toeplitz structured distance to symmetric positive semidefiniteness
- Newton iteration for the closest normal matrix of order two
- Perturbations of non-diagonalizable stochastic matrices with preservation of spectral properties
- Geometric approaches to matrix normalization and graph balancing
- A simple, randomized algorithm for diagonalizing normal matrices
- Matrix nearness problems: Do real inputs admit real solutions?
- A continuous Jacobi-like approach to the simultaneous reduction of real matrices
- Normal approximants to binormal operators
- Some complexity results in parallel matrix-based signal processing
This page was built for publication: Closest normal matrix finally found
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097936)
