On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms (Q1318656)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms |
scientific article; zbMATH DE number 540810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms |
scientific article; zbMATH DE number 540810 |
Statements
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms (English)
0 references
6 April 1994
0 references
A new bound on the number of iterations of the method for scaling a matrix with positive entries is given. The bound implies that the method is a polynomial-time approximation scheme.
0 references
convergence
0 references
RAS matrix scaling algorithms
0 references
number of iterations
0 references
polynomial-time approximation scheme
0 references
0 references
0.8149227499961853
0 references
0.7845197319984436
0 references
0.7548431754112244
0 references
0.7467143535614014
0 references
