Algorithms for Testing the Diagonal Similarity of Matrices and Related Problems

DOI10.1137/0603044zbMath0506.15003OpenAlexW1978535778MaRDI QIDQ4742933

Gernot M. Engel, Hans Schneider

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f327a15d535a427f66bce3876fd87b3e549ec53b

zbMATH Keywords

unitary matrixdiagonal similaritychain productHadamard quotientgraph of matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Software, source code, etc. for problems pertaining to linear algebra (15-04) Canonical forms, reductions, classification (15A21)

Related Items

On scaling to an integer matrix and graphs with integer weighted cycles, On 2k-twisted graphs, On matrices with cyclic structure, A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds, Penalized maximum-likelihood estimation, the Baum-Welch algorithm, diagonal balancing of symmetric matrices and applications to training acoustic data, On matrices having equal corresponding principal minors, Principal minors and diagonal similarity of matrices

Cites Work

• Unnamed Item
• Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
• Cyclic and diagonal products on a matrix
• Diagonal Scaling to an Orthogonal Matrix
• An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix