A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof
From MaRDI portal
Publication:5547731
DOI10.1137/0703024zbMath0163.30602OpenAlexW2069655509MaRDI QIDQ5547731
Publication date: 1966
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0703024
Related Items (22)
On the degree of Boolean functions as real polynomials ⋮ Perceptrons, PP, and the polynomial hierarchy ⋮ Varying norms and constraints ⋮ A Short List of Equalities Induces Large Sign-Rank ⋮ A comparison of uniform and discrete polynomial approximation ⋮ Birefringence in viscoelastic materials ⋮ Unbounded-error quantum query complexity ⋮ Deviation of best discrete and uniform polynomial approximants ⋮ LWPP and WPP are not uniformly gap-definable ⋮ Unnamed Item ⋮ Computational methods for best spline function approximation ⋮ Approximations of functions of several variables: Product Chebychev approximations. I ⋮ Gram polynomials and the Kummer function ⋮ Interpolating subspaces in approximation theory ⋮ On discretization in generalized rational approximation ⋮ Minimum error bounds for multidimensional spline approximation ⋮ A note on discrete Čebysev approximation ⋮ Discrete Tchebycheff approximation for multivariate splines ⋮ On vectorial approximation ⋮ Discretization for uniform polynomial approximation ⋮ Complexity measures and decision tree complexity: a survey. ⋮ On separation between the degree of a Boolean function and the block sensitivity
This page was built for publication: A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof
