Notes on the Birkhoff Algorithm for Doubly Stochastic Matrices
From MaRDI portal
Publication:3943084
DOI10.4153/CMB-1982-026-3zbMATH Open0484.15018OpenAlexW2313548030MaRDI QIDQ3943084
Publication date: 1982
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cmb-1982-026-3
stabilitydoubly stochastic matricesrepresentationBirkhoff's algorithmconvex combinations of permutation matrices
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Polytopes and polyhedra (52Bxx) Stochastic matrices (15B51)
Cited In (14)
- Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
- Order independence and factor convergence in iterative scaling
- Some applications of doubly stochastic matrices
- The polytope of even doubly stochastic matrices
- On stochasticity preserving methods for the computation of the matrix \(p\)th root
- Further notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
- On the extreme points of a family of matrices related to a theorem of Birkhoff
- On assignment functions
- The Marcus-de Oliveira conjecture, bilinear forms, and cones
- Positional Voting and Doubly Stochastic Matrices
- An ordinal evaluation of categorical judgement data by random utilities and a corresponding correlation analysis
- The Birkhoff theorem for unitary matrices of prime-power dimension
- Alternating sign matrices, extensions and related cones
- Preconditioning techniques based on the Birkhoff-von Neumann decomposition
This page was built for publication: Notes on the Birkhoff Algorithm for Doubly Stochastic Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3943084)