Computing eigenvalues of normal matrices via complex symmetric matrices

DOI10.1016/j.cam.2013.08.036zbMath1291.65119OpenAlexW2159232044MaRDI QIDQ2252834

Raf Vandebril, Micol Ferranti

Publication date: 23 July 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.08.036

zbMATH Keywords

normal matrixunitary similarityTakagi factorizationeigenvalue decompositioncomplex symmetricsymmetric singular value decomposition

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unitary similarity transform of a normal matrix to complex symmetric form
• Normal matrices
• Singular value decompositions of complex symmetric matrices
• Closest normal matrix finally found
• Normal matrices: an update
• Schur parameter pencils for the solution of the unitary eigenproblem
• Symmetrization of complex normal matrices
• Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
• Orthogonal similarity of a real matrix and its transpose
• Unitary equivalence to a complex symmetric matrix: a modulus criterion
• A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix
• A Procedure for the Diagonalization of Normal Matrices
• Unitary equivalence to a complex symmetric matrix: geometric criteria
• A Divide-and-Conquer Method for the Takagi Factorization
• The Matrix Eigenvalue Problem
• On the quadratic convergence of the Jacobi method for normal matrices

This page was built for publication: Computing eigenvalues of normal matrices via complex symmetric matrices