
Sinkhorn's alternative minimization algorithm applied to a positive $n\times n$ matrix converges to a doubly stochastic matrix. If the algorithm, applied to a $2\times 2$ matrix, converges in a finite number of iterations, then it converges in at most two iterations, and the structure of such matrices is determined.
16 pages; minor corrections and improvements
Random matrices (algebraic aspects), Mathematics - Number Theory, doubly stochastic matrix, FOS: Mathematics, 11C20, 11B75, 11B99, Mathematics - Combinatorics, minimization, Combinatorics (math.CO), Number Theory (math.NT)
Random matrices (algebraic aspects), Mathematics - Number Theory, doubly stochastic matrix, FOS: Mathematics, 11C20, 11B75, 11B99, Mathematics - Combinatorics, minimization, Combinatorics (math.CO), Number Theory (math.NT)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
