An algorithm for scaling matrices and computing the minimum cycle mean in a digraph

DOI10.1007/BF01396369zbMath0454.65032OpenAlexW2083815366MaRDI QIDQ1149744

Manfred von Golitschek

Publication date: 1980

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/186308

zbMATH Keywords

preconditioningdigraphsmatrix scalingminimum cycle mean problem

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Directed graphs (digraphs), tournaments (05C20) Conditioning of matrices (15A12)

Related Items (9)

The cost-to-time ratio problem for large or infinite graphs ⋮ Scaling linear optimization problems prior to application of the simplex method ⋮ The Chebyshev solution of certain matrix equations ⋮ 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 ⋮ Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones ⋮ Applications of shortest path algorithms to matrix scalings ⋮ Extremal signatures for bivariate Chebyshev approximation problems ⋮ Computing optimal scalings by parametric network algorithms

Cites Work

• Unnamed Item
• A characterization of the minimum cycle mean in a digraph
• On the approximation of a function of several variables by the sum of functions of fewer variables
• An Algorithm for Scaling Matrices
• Characterizations of optimal scalings of matrices
• On the algorithm of diliberto and straus for approximating bivariate functions by univariate ones

This page was built for publication: An algorithm for scaling matrices and computing the minimum cycle mean in a digraph