Sinkhorn limits in finitely many steps

11/29/2019
by   Alex Cohen, et al.
0

Applied to a nonnegative m× n matrix with a nonzero σ-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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/01/2020

Diagonal scalings for the eigenstructure of arbitrary pencils

In this paper we show how to construct diagonal scalings for arbitrary m...
research
04/15/2022

Finding Hall blockers by matrix scaling

For a given nonnegative matrix A=(A_ij), the matrix scaling problem asks...
research
10/20/2021

A Row-Wise Update Algorithm for Sparse Stochastic Matrix Factorization

Nonnegative matrix factorization arises widely in machine learning and d...
research
09/09/2023

Linear convergence of the Collatz method for computing the Perron eigenpair of primitive dual number matrix

Very recently, Qi and Cui extended the Perron-Frobenius theory to dual n...
research
08/18/2022

Matrix Quantile Factor Model

In this paper, we introduce a matrix quantile factor model for matrix se...
research
12/07/2017

Sets of Stochastic Matrices with Converging Products: Bounds and Complexity

An SIA matrix is a stochastic matrix whose sequence of powers converges ...
research
07/09/2019

A method for computing the Perron-Frobenius root for primitive matrices

For a nonnegative matrix, the eigenvalue with the maximum magnitude or P...

Please sign up or login with your details

Forgot password? Click here to reset