A fast algorithm for matrix balancing (Q2841064)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6190573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for matrix balancing |
scientific article; zbMATH DE number 6190573 |
Statements
A fast algorithm for matrix balancing (English)
0 references
24 July 2013
0 references
matrix balancing
0 references
Sinkhorn-Knopp algorithm
0 references
doubly stochastic matrix
0 references
conjugate gradient iteration
0 references
sparse matrices
0 references
inexact Newton method
0 references
0.91897005
0 references
0 references
0.89480853
0 references
0.88986856
0 references
0.87313867
0 references
0 references
0.8694097
0 references
The Sinkhorn-Knopp algorithm [\textit{R. Sinkhorn} and \textit{P. Knopp}, Pac. J. Math. 21, 343--348 (1967; Zbl 0152.01403)] offers an approach to balancing matrices but it does not work well for sparse matrices. In this paper, the authors derive some new algorithms that are fast for large matrix-balancing problems. They show that an inexact Newton method offers a simple way of overcoming the limitation of the Sinkhorn-Knopp algorithm. They make sure that if they remain in the positive cone then they show improvements for both symmetric and nonsymmetric matrices. They point out that if the diagonal of the matrix contain widely varying elements then the proposed algorithm converges slowly.
0 references
