Interpolation by Weak Chebyshev Spaces
نویسنده
چکیده
We present two characterizations of Lagrange interpolation sets for weak Chebyshev spaces. The rst of them is valid for an arbitrary weak Chebyshev space U and is based on an analysis of the structure of zero sets of functions in U extending Stockenberg's theorem. The second one holds for all weak Chebyshev spaces that possess a locally linearly independent basis. x1. Introduction Let U denote a nite-dimensional subspace of real valued functions deened on a totally ordered set K, for example, an arbitrary subset of IR. A nite subset T = ft 1 ; : : : ; t n g of K, where n = dimU, is called an interpolation set (I-set) w.r.t. U if for any given data fy 1 ; : : : ; y n g there exists a unique function u 2 U such that It is easy to see that T is an I-set w.r.t. U if and only if dimU jT = n; where U jT := fu jT : u 2 Ug. For a set of s points, T = ft 1 ; : : : ; t s g K, with s < n, we say that T is an I-set if dimU jT = s. We are interested in describing I-sets w.r.t. U in the case when U is a weak Chebyshev space (W T-space), i.e., every u 2 U has at most n?1 sign changes. The primary example of a WT-space is the space of univariate polynomial splines, in which case all interpolation sets can be characterized by well-known Schoenberg-Whitney condition (see e.g. 12]). Extensions of Schoenberg-Whitney theorem to some classes of generalized spline spaces were proposed in 11,13,14]. Recently, some characterizations of I-sets w.r.t. weak Chebyshev spaces without any a priori assumption about \piecewise Haar" spline-like structure have been found. In 4] it was proved that Schoenberg-Whitney characterization in its \di-mension form" holds true for a WT-space U if and only if U jK 0 is also a WT-space for all K 0 K. This last property is satissed, for example, if U is a weak Descartes space. In 2] the \support form" of Schoenberg-Whitney theorem has been shown to hold true for every WT-space that possesses a locally linearly independent weak Descartes basis. (See 7] for a review of various forms of Schoenberg-Whitney condition , especially in regard to their extendibility to multivariate splines.)
منابع مشابه
Best L1 Approximation and Locally Computed L1 Spline Fits of the Heaviside Function and Multiscale Univariate Datasets
Best L1 approximations of the Heaviside function in Chebyshev and weak-Chebyshev spaces has a Gibbs phenomenon. It has been shown in the nineties for the trigonometric polynomial [1] and polygonal line cases [2]. By mean of recent results of characterization of best L1 approximation in Chebyshev and weak-Chebyshev spaces [3] that we recall, this Gibbs phenomenon can also be evidenced in the pol...
متن کاملInterpolation and Almost Interpolation by Weak Chebyshev Spaces
Some new results on univariate interpolation by weak Cheby-shev spaces, using conditions of Schoenberg-Whitney type and the concept of almost interpolation sets, are given. x1. Introduction Let U denote a nite-dimensional subspace of real-valued functions deened on some set K. We are interested in describing those conngurations T = dimU jT = s: T is called an interpolation set (I-set) w.r.t. U....
متن کاملInterpolation on Sparse Gauss-Chebyshev Grids in Higher Dimensions
In this paper, we give a unified approach to error estimates for interpolation on sparse Gauß–Chebyshev grids for multivariate functions from Besov–type spaces with dominating mixed smoothness properties. The error bounds obtained for this method are almost optimal for the considered scale of function spaces. 1991 Mathematics Subject Classification: 41A05, 41A63, 65D05, 46E35
متن کاملApproximating weak Chebyshev subspaces by Chebyshev subspaces
We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly approximated by a sequence of spaces having related properties. r 2003 Elsevier Science (USA). All rights reserved.
متن کاملHigh dimensional polynomial interpolation on sparse grids
We study polynomial interpolation on a d-dimensional cube, where d is large. We suggest to use the least solution at sparse grids with the extrema of the Chebyshev polynomials. The polynomial exactness of this method is almost optimal. Our error bounds show that the method is universal, i.e., almost optimal for many different function spaces. We report on numerical experiments for d = 10 using ...
متن کامل