Applications of shortest path algorithms to matrix scalings

DOI10.1007/BF01389759zbMATH Open0548.65026OpenAlexW2014428243MaRDI QIDQ799343FDOQ799343

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

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

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)

Cites Work

• Title not available (Why is that?)
• A characterization of the minimum cycle mean in a digraph
• Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
• Characterizations of optimal scalings of matrices
• Remarks on optimally scaled matrices
• Optimally scaled matrices
• An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
• An Algorithm for Scaling Matrices
• Title not available (Why is that?)
• Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
• On the approximation of a function of several variables by the sum of functions of fewer variables
• Title not available (Why is that?)
• On the approximation of a bivariate function by the sum of univariate functions
• Title not available (Why is that?)
• The best approximation of bivariate functions by separable functions
• 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
• On the algorithm of diliberto and straus for approximating bivariate functions by univariate ones
• The Degree of Approximation of Certain Functions of Two Variables by a Sum of Functions of One Variable
• Title not available (Why is that?)
• On best approximation of functions of two variables

Cited In (5)

• The cost-to-time ratio problem for large or infinite graphs
• On visualization scaling, subeigenvectors and Kleene stars in max algebra
• Computing optimal scalings by parametric network algorithms
• External matrix multiplication and all-pairs shortest path
• Title not available (Why is that?)

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)