Matrix scaling limits in finitely many iterations

From MaRDI portal



Abstract: The alternate row and column scaling algorithm applied to a positive nimesn matrix A converges to a doubly stochastic matrix S(A), sometimes called the emph{Sinkhorn limit} of A. For every positive integer n, a two parameter family of row but not column stochastic nimesn positive matrices is constructed that become doubly stochastic after exactly one column scaling.












This page was built for publication: Matrix scaling limits in finitely many iterations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296098)