Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones

DOI10.1007/BF01399312zbMath0541.65009OpenAlexW1983697781MaRDI QIDQ794387

Manfred von Golitschek

Publication date: 1982

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

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

zbMATH Keywords

optimal solutionsapproximating bivariate functionsbinary search proceduredoubly weighted directed graphindustrial processesminimal pseudolengthsoptimal cycles

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical methods for integral equations (65R20) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Multidimensional problems (41A63) Algorithms for approximation of functions (65D15) Directed graphs (digraphs), tournaments (05C20) Approximation by other special function classes (41A30)

Related Items

On Eigenproblem for Circulant Matrices in Max-Algebra ⋮ Extremal eigenproblem for bivalent matrices ⋮ An additive eigenvalue problem of physics related to linear programming ⋮ The cost-to-time ratio problem for large or infinite graphs ⋮ Numerical procedure for solving a minimization eigenvalue problem ⋮ Maximum cycle-means of weighted digraphs ⋮ Almost global stability of nonlinear switched systems with mode-dependent and edge-dependent average dwell time ⋮ Graph-Based Dwell Time Computation Methods for Discrete-Time Switched Linear Systems ⋮ Dwell time and average dwell time methods based on the cycle ratio of the switching graph ⋮ The Chebyshev solution of certain matrix equations ⋮ An \(O(n^ 2)\) algorithm for the maximum cycle mean of an \(n\times n\) bivalent matrix ⋮ A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds ⋮ The Chebyshev solution of the linear matrix equation \(AX+YB=C\) ⋮ Failure of the alternating algorithm for best approximation of multivariate functions ⋮ Applications of shortest path algorithms to matrix scalings ⋮ Extremal signatures for bivariate Chebyshev approximation problems ⋮ Computing optimal scalings by parametric network algorithms

Cites Work

• 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
• On approximation theory and functional equations
• On the approximation of a function of several variables by the sum of functions of fewer variables
• 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
• Best approximation of functions of two variables by functions of the form 𝜑(𝑥)+𝜓(𝑦)
• Depth-First Search and Linear Graph Algorithms
• On best approximation of functions of two variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones