Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
From MaRDI portal
(Redirected from Publication:1252203)
Cites work
- Cyclic and diagonal products on a matrix
- Diagonal similarity and equivalence for matrices over groups with 0
- Décompositions I-matricielles d'un demigroupe
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3503425 (Why is no real title available?)
- scientific article; zbMATH DE number 3440581 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- scientific article; zbMATH DE number 3363588 (Why is no real title available?)
- Problems Involving Diagonal Products in Nonnegative Matrices
- Qualitative Economics and the Scope of the Correspondence Principle
- Some results concerning completely 0-simple semigroups
Cited in
(25)- Principal minors and diagonal similarity of matrices
- Classes of matrices associated with the optimal assignment problem
- On 2k-twisted graphs
- Matrices diagonally similar to a symmetric matrix
- Penalized maximum-likelihood estimation, the Baum-Welch algorithm, diagonal balancing of symmetric matrices and applications to training acoustic data
- Special parity of perfect matchings in bipartite graphs
- On classes of normalized matrices
- On matrices whose numerical ranges have circular or weak circular symmetry
- On matrices with cyclic structure
- The free-fermion eight-vertex model: couplings, bipartite dimers and \(Z\)-invariance
- Alternating sign matrices, related (0,1)-matrices, and the Smith normal form
- On scaling to an integer matrix and graphs with integer weighted cycles
- A recursive least-squares algorithm for pairwise comparison matrices
- A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds
- Scalings of vector spaces and the uniqueness of lyapunov scaling factors
- Matrices with Sign Symmetric Diagonal Shifts or Scalar Shifts
- Cones, graphs and optimal scalings of matrices
- Characterizations of optimal scalings of matrices
- Diagonal Scaling to an Orthogonal Matrix
- Algorithms for Testing the Diagonal Similarity of Matrices and Related Problems
- Determinantal point processes for image processing
- Determinantally equivalent nonzero functions
- On matrices having equal corresponding principal minors
- Applications of shortest path algorithms to matrix scalings
- Schur-type stability properties and complex diagonal scaling
This page was built for publication: Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1252203)