On the complexity of nonnegative-matrix scaling (Q1915608)

From MaRDI portal
Revision as of 05:14, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references