On the algorithm of diliberto and straus for approximating bivariate functions by univariate ones

DOI10.1080/01630567908816021zbMATH Open0479.41026OpenAlexW2057575867MaRDI QIDQ3937142FDOQ3937142

Authors: E. W. Cheney, Manfred von Golitschek 

Publication date: 1979

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630567908816021

zbMATH Keywords

convergence of algorithm

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)

Cited In (8)

• An automatic scaling procedure for a D'yakonov-Gunn iteration scheme
• Extremal signatures for bivariate Chebyshev approximation problems
• An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
• Blending interpolation and best \(L^1\)-approximation
• Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
• Applications of shortest path algorithms to matrix scalings
• On the approximation of a bivariate function by the sum of univariate functions
• A straightforward generalization of Diliberto and Straus' algorithm does not work

This page was built for publication: On the algorithm of diliberto and straus for approximating bivariate functions by univariate ones

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