Matrix Balancing on a Massively Parallel Connection Machine

DOI10.1287/IJOC.2.2.112MaRDI QIDQ4029054zbMATH OpenOpenAlexFDO

Authors 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

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

Mathematics Subject Classification ID

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

Recommendations

• PARALLEL MATRIX MULTIPLICATION ON THE CONNECTION MACHINE
• Vector and parallel computing for matrix balancing
• On the Complexity of Matrix Balancing
• A fast algorithm for matrix balancing
• Communication balancing in parallel sparse matrix-vector multiplication
• A Parallel Matrix Scaling Algorithm
• A balanced submatrix merging algorithm for multiprocessor architectures
• Parallel matrix multiplication on networked microcomputers

Cited in

(11)

• A unified description of iterative algorithms for traffic equilibria
• Interval-constrained matrix balancing
• A fast algorithm for matrix balancing
• Massively parallel implementation of the splitting equilibration algorithm
• Data parallel computing for network-structured optimization problems
• Vector and parallel computing for matrix balancing
• A Parallel Matrix Scaling Algorithm
• Sparse Matrix Computations on Parallel Processor Arrays
• On the Complexity of Matrix Balancing
• A combination of potential reduction steps and steepest descent steps for solving convex programming problems
• A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4029054)