On the complexity of nonnegative-matrix scaling
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.
scientific article; zbMATH DE number 894237
scientific article