2000 character limit reached
Sinkhorn limits in finitely many steps
Published 29 Nov 2019 in math.CO, cs.NA, and math.NA | (1912.00095v2)
Abstract: Applied to a nonnegative $m\times n$ matrix with a nonzero $\sigma$-diagonal, the sequence of matrices constructed by alternate row and column scaling conveges to a doubly stochastic matrix. It is proved that if this sequence converges after only a finite number of scalings, then it converges after at most two scalings.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.