Algorithms for Testing the Diagonal Similarity of Matrices and Related Problems
DOI10.1137/0603044zbMATH Open0506.15003OpenAlexW1978535778MaRDI QIDQ4742933FDOQ4742933
Authors: 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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Canonical forms, reductions, classification (15A21) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Cites Work
Cited In (7)
- On 2k-twisted graphs
- On scaling to an integer matrix and graphs with integer weighted cycles
- Principal minors and diagonal similarity of matrices
- 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 with cyclic structure
- On matrices having equal corresponding principal minors
This page was built for publication: Algorithms for Testing the Diagonal Similarity of Matrices and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742933)