An Algorithm for Scaling Matrices

DOI10.1137/1004032zbMath0108.12401OpenAlexW1975579532MaRDI QIDQ3843908

D. R. Fulkerson, Peter Wolfe

Publication date: 1962

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1004032

zbMATH Keywords

numerical analysis

Related Items (15)

The Sylvester Resultant Matrix and Image Deblurring ⋮ Computational methods of linear algebra ⋮ An algorithm for scaling matrices and computing the minimum cycle mean in a digraph ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ Scaling linear optimization problems prior to application of the simplex method ⋮ Some Results on Sparse Matrices ⋮ On scaling linear programs—some experimental results ⋮ A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds ⋮ Cones, graphs and optimal scalings of matrices ⋮ The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results ⋮ On solving problems with sparse matrices ⋮ Characterizations of optimal scalings of matrices ⋮ A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit ⋮ Applications of shortest path algorithms to matrix scalings ⋮ Computing optimal scalings by parametric network algorithms

This page was built for publication: An Algorithm for Scaling Matrices