Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
From MaRDI portal
Publication:254898
DOI10.1016/j.laa.2016.02.023zbMath1334.15093OpenAlexW2270783633MaRDI QIDQ254898
Publication date: 8 March 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2016.02.023
Factorization of matrices (15A23) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random matrices (algebraic aspects) (15B52) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Stochastic matrices (15B51)
Related Items (6)
Birkhoff–von Neumann's theorem, doubly normalized tensors, and joint measurability ⋮ Combinatorial properties of integer matrices and integer matrices modk ⋮ Preconditioning techniques based on the Birkhoff-von Neumann decomposition ⋮ Further notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices ⋮ The Birkhoff theorem for unitary matrices of prime-power dimension ⋮ Positional Voting and Doubly Stochastic Matrices
Uses Software
Cites Work
- The diagonal hypergraph of a matrix (bipartite graph)
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
- A Symmetry Preserving Algorithm for Matrix Scaling
- The university of Florida sparse matrix collection
- Notes on the Birkhoff Algorithm for Doubly Stochastic Matrices
- DIAGONALS OF DOUBLY STOCHASTIC MATRICES
- Unnamed Item
- Unnamed Item
This page was built for publication: Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices