Matrix Balancing on a Massively Parallel Connection Machine

DOI10.1287/ijoc.2.2.112zbMath0765.65050OpenAlexW2132335767MaRDI QIDQ4029054

Stavros A. Zenios

Publication date: 1 April 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2.2.112

zbMATH Keywords

consistencyasynchronoussynchronousCM-2 machinemassively parallel connection machinedense and sparse problemsRAS algorithmiterative scaling algorithm RASmatrix balancing algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Parallel numerical computation (65Y05)

Related Items

Data parallel computing for network-structured optimization problems ⋮ A combination of potential reduction steps and steepest descent steps for solving convex programming problems ⋮ Vector and parallel computing for matrix balancing ⋮ Interval-constrained matrix balancing ⋮ A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems ⋮ A unified description of iterative algorithms for traffic equilibria

This page was built for publication: Matrix Balancing on a Massively Parallel Connection Machine