Interval-constrained matrix balancing (Q758125): Difference between revisions
From MaRDI portal
Latest revision as of 11:08, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Interval-constrained matrix balancing |
scientific article |
Statements
Interval-constrained matrix balancing (English)
0 references
1991
0 references
The following two problems are studied: 1. Given a nonnegative (m,n)-matrix \(A=(a_{ij})\) and positive vectors u, v; determine a `nearby' nonnegative (m,n)-matrix \(X=(x_{ij})\) such that \(\sum_{j}x_{ij}=u_ i\), \(i=1,...,m\), \(\sum_{i}x_{ij}=v_ j\), \(j=1,...,n\) and \(x_{ij}>0\) only if \(a_{ij}>0.\) 2. Given the same matrix as above \((m=n)\); find a `nearby' nonnegative matrix X such that \(\sum_{j}x_{ij}=\sum_{j}x_{ji}\), \(i=1,...,n\) and \(x_{ij}>0\) only if \(a_{ij}>0.\) It is considered the entropy optimization approach to define the `nearness' in these problems. A numerical method for solving is given. Numerical experiments illustrate the efficiency and effectiveness of the method and its superior performance when implemented in parallel.
0 references
interval-constrained matrix balancing
0 references
parallel algorithm
0 references
nonnegative matrix
0 references
entropy optimization
0 references
Numerical experiments
0 references