Picture of scraped petri dish

Scrape below the surface of Strathprints...

The Strathprints institutional repository is a digital archive of University of Strathclyde research outputs. Explore world class Open Access research by researchers at Strathclyde, a leading technological university.

Explore

The Sinkhorn-Knopp algorithm : convergence and applications

Knight, P.A. (2008) The Sinkhorn-Knopp algorithm : convergence and applications. SIAM Journal on Matrix Analysis and Applications, 30 (1). pp. 261-275. ISSN 0895-4798

[img]
Preview
PDF (THE SINKHORN-KNOPP ALGORITHM: CONVERGENCE AND APPLICATIONS)
skapp.pdf - Draft Version
Available under License Unspecified.

Download (202kB) | Preview

Abstract

As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal scaling of A that is doubly stochastic. It is known that the convergence is linear, and an upper bound has been given for the rate of convergence for positive matrices. In this paper we give an explicit expression for the rate of convergence for fully indecomposable matrices. We describe how balancing algorithms can be used to give a measure of web page significance. We compare the measure with some well known alternatives, including PageRank. We show that, with an appropriate modi. cation, the Sinkhorn-Knopp algorithm is a natural candidate for computing the measure on enormous data sets.