Applications of shortest path algorithms to matrix scalings
From MaRDI portal
Publication:799343
DOI10.1007/BF01389759zbMath0548.65026OpenAlexW2014428243MaRDI QIDQ799343
Hans Schneider, Manfred von Golitschek
Publication date: 1984
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132922
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Numerical computation of matrix norms, conditioning, scaling (65F35) Directed graphs (digraphs), tournaments (05C20)
Related Items
The cost-to-time ratio problem for large or infinite graphs, Computing optimal scalings by parametric network algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimally scaled matrices
- Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
- On the approximation of a bivariate function by the sum of univariate functions
- An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
- A characterization of the minimum cycle mean in a digraph
- Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
- Remarks on optimally scaled matrices
- On the approximation of a function of several variables by the sum of functions of fewer variables
- 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
- An Algorithm for Scaling Matrices
- Cones, graphs and optimal scalings of matrices
- Characterizations of 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
- On best approximation of functions of two variables
