Applications of shortest path algorithms to matrix scalings-Reference-Cited by-同舟云学术

Applications of shortest path algorithms to matrix scalings

Published:1984-02 Issue:1 Volume:44 Page:111-126
ISSN:0029-599X
Container-title:Numerische Mathematik
language:en
Short-container-title:Numer. Math.

Author:

v. Golitschek M.,Schneider H.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics

Link

http://link.springer.com/article/10.1007/BF01389759/fulltext.html

Reference23 articles.

1. Aumann, G.: �ber approximative Nomographie II. Bayer. Akad. Wiss. Math.-Natur. Kl. S.B., 103?109 (1959)

2. Bauer, F.L.: Optimally scaled matrices. Numer. Math.5, 73?87 (1963)

3. Bauer, F.L.: Remarks on optimally scaled matrices. Numer. Math.13, 1?3 (1969)

4. Cheney, E.W., Golitschek, M. v.: On the algorithm of Diliberto and Straus for approximating bivariate functions by univariate ones. Numer. Functional Analysis and Optimization1, 341?363 (1979)

5. Cheney, E.W., Golitschek, M.v.: The best approximation of bivariate functions by separable functions. In: Topological Methods in Nonlinear Functional Analysis, pp. 125?136 (S.P. Singh, S. Thomeier, B. Watson, eds.), Contemporary Mathematics, Vol. 21. Americ. Math. Soc., 1983.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Chapter 1 Applications of network optimization;Handbooks in Operations Research and Management Science;1995

2. Decomposition of Multivariate Functions;Canadian Journal of Mathematics;1992-06-01

3. Approximation by Solutions of the Planar Wave Equation;SIAM Journal on Numerical Analysis;1992-06

4. The cost-to-time ratio problem for large or infinite graphs;Discrete Applied Mathematics;1987-01

5. Computing optimal scalings by parametric network algorithms;Mathematical Programming;1985-05