On the complexity of nonnegative-matrix scaling (Q1915608): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(94)00188-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034025033 / rank | |||
Normal rank | |||
Latest revision as of 11:04, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of nonnegative-matrix scaling |
scientific article |
Statements
On the complexity of nonnegative-matrix scaling (English)
0 references
30 June 1996
0 references
The authors derive an upper bound on the norms of the scaling factors of an \(n \times n\) nonnegative double stochastic (scalable) matrix. A polynomial-time complexity bound on the problem of computing the scaling factors to a prescribed accuracy is also given.
0 references
stochastic matrix
0 references
norms
0 references
scaling factors
0 references
nonnegative double
0 references
complexity bound
0 references
0 references
0 references
