Applications of shortest path algorithms to matrix scalings

DOI10.1007/BF01389759MaRDI QIDQ799343zbMATH OpenOpenAlexFDO

Authors Manfred von Golitschek, Hans Schneider

Publication date 1984

Published in Numerische Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

optimal scalingnonnegative matrixsymmetric scalingweighted directed graphsshortest path algorithms

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Numerical computation of matrix norms, conditioning, scaling (65F35)

Recommendations

• Computing optimal scalings by parametric network algorithms
• Scaling Matrices to Prescribed Row and Column Maxima
• Applications of max algebra to diagonal scaling of matrices
• Scalings of matrices satisfying line-product constraints and generalizations
• A Symmetry Preserving Algorithm for Matrix Scaling

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3139188 (Why is no real title available?)
• scientific article; zbMATH DE number 3170706 (Why is no real title available?)
• scientific article; zbMATH DE number 3561084 (Why is no real title available?)
• scientific article; zbMATH DE number 3238214 (Why is no real title available?)
• A characterization of the minimum cycle mean in a digraph
• A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds
• An Algorithm for Scaling Matrices
• An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
• Characterizations of optimal scalings of matrices
• Cones, graphs and optimal scalings of matrices
• Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
• On best approximation of functions of two variables
• On the algorithm of diliberto and straus for approximating bivariate functions by univariate ones
• On the approximation of a bivariate function by the sum of univariate functions
• On the approximation of a function of several variables by the sum of functions of fewer variables
• Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
• Optimally scaled matrices
• Remarks on optimally scaled matrices
• The Degree of Approximation of Certain Functions of Two Variables by a Sum of Functions of One Variable
• The best approximation of bivariate functions by separable functions

Cited in

(5)

• Computing optimal scalings by parametric network algorithms
• On visualization scaling, subeigenvectors and Kleene stars in max algebra
• The cost-to-time ratio problem for large or infinite graphs
• External matrix multiplication and all-pairs shortest path
• scientific article; zbMATH DE number 5039783 (Why is no real title available?)

This page was built for publication: Applications of shortest path algorithms to matrix scalings

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