Jump to content

Birkhoff algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Erel Segal (talk | contribs) at 12:02, 31 July 2020 (Created page with ''''Birkhoff's algorithm''' is an algorithm for decomposing a doubly stochastic matrix into a convex combination of [[Permutation matrix|permutation matrices]...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Birkhoff's algorithm is an algorithm for decomposing a doubly stochastic matrix into a convex combination of permutation matrices. It was developed by Garret Birkhoff.[1]

References

  1. ^ Birkhoff, Garrett (1946), "Tres observaciones sobre el algebra lineal [Three observations on linear algebra]", Univ. Nac. Tucumán. Revista A., 5: 147–151, MR 0020547.