𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Complexity of Matrix Balancing

✍ Scribed by Kalantari, B.; Khachiyan, L.; Shokoufandeh, A.

Book ID
118216138
Publisher
Society for Industrial and Applied Mathematics
Year
1997
Tongue
English
Weight
313 KB
Volume
18
Category
Article
ISSN
0895-4798

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Complexity of Matrix Product
On the Complexity of Matrix Product
✍ Raz, Ran πŸ“‚ Article πŸ“… 2003 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 169 KB
On complexity of matrix scaling
On complexity of matrix scaling
✍ Arkadi Nemirovski; Uriel Rothblum πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 182 KB

The Line Sum Scaling problem for a nonnegative matrix A is to find positive definite diagonal matrices Y, Z which result in prescribed row and column sums of the scaled matrix Y AZ. The matrix Balancing problem for a nonegative square matrix A is to find a positive definite diagonal Matrix X such th

On reducing the complexity of matrix clo
On reducing the complexity of matrix clocks
✍ LΓΊcia M.A. Drummond; Valmir C. Barbosa πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 140 KB

Matrix clocks are a generalization of the notion of vector clocks that allows the local representation of causal precedence to reach into an asynchronous distributed computationΓ•s past with depth x, where x P 1 is an integer. Maintaining matrix clocks correctly in a system of n nodes requires that e