The saturation class for linear combinations of Bernstein operators

In this paper we study the saturation class for the linear combinations of Bernstein operators. The characterization of the saturation class involving the modulus of smoothness is proved under certain assumption. Received: 1 September 2007     

Direct and inverse theorems for Bernstein polynomials in the space of riemann integrable functions

Equivalence theorems concerning the convergence of the Bernstein polynomialsB _n f are well known for continuous functionsf in the sup-norm. The purpose of this paper is to extend these results for functionsf, Riemann integrable on [0, 1], We have therefore to consider the seminorm

Remez-, Nikolskii-, and Markov-type inequalities for generalized nonnegative polynomials with restricted zeros

Sharp Remez-, Nikolskii-, and Markov-type inequalities are proved for functions of the form

A necessary and sufficient condition for the linear independence of the integer translates of a compactly supported distribution

Given a multivariate compactly supported distribution, we derive here a necessary and sufficient condition for the global linear independence of its integer translates. This condition is based on the location of the zeros of =the Fourier-Laplace transform of. The utility of the condition is demonstrated by several examples and applications, showing, in particular, that previous results on box splines and exponential box splines can be derived from this condition by a simple combinatorial argument.Communicated by Carl de Boor.     

Generalized cardinal B-splines: Stability, linear independence, and appropriate scaling matrices

Generalized cardinal B-splines are defined as convolution products of characteristic functions of self-affine lattice tiles with respect to a given integer scaling matrix. By construction, these generalized splines are refinable functions with respect to the scaling matrix and therefore they can be used to define a multiresolution analysis and to construct a wavelet basis. In this paper, we study the stability and linear independence properties of the integer translates of these generalized spline functions. Moreover, we give a characterization of the scaling matrices to which the construction of the generalized spline functions can be applied.     

Adaptive greedy approximations

The problem of optimally approximating a function with a linear expansion over a redundant dictionary of waveforms is NP-hard. The greedy matching pursuit algorithm and its orthogonalized variant produce suboptimal function expansions by iteratively choosing dictionary waveforms that best match the function’s structures. A matching pursuit provides a means of quickly computing compact, adaptive function approximations. Numerical experiments show that the approximation errors from matching pursuits initially decrease rapidly, but the asymptotic decay rate of the errors is slow. We explain this behavior by showing that matching pursuits are chaotic, ergodic maps. The statistical properties of the approximation errors of a pursuit can be obtained from the invariant measure of the pursuit. We characterize these measures using group symmetries of dictionaries and by constructing a stochastic differential equation model. We derive a notion of the coherence of a signal with respect to a dictionary from our characterization of the approximation errors of a pursuit. The dictionary elements slected during the initial iterations of a pursuit correspond to a function’s coherent structures. The tail of the expansion, on the other hand, corresponds to a noise which is characterized by the invariant measure of the pursuit map. When using a suitable dictionary, the expansion of a function into its coherent structures yields a compact approximation. We demonstrate a denoising algorithm based on coherent function expansions.     

On the L 1-condition number of the univariate Bernstein basis

We show that the size of the 1-norm condition number of the univariate Bernstein basis for polynomials of degree n is O (2ⁿ / √n). This is consistent with known estimates [3], [5] for p = 2 and p = ∞ and leads to asymptotically correct results for the p-norm condition number of the Bernstein basis for any p with 1 ≤ p ≤ ∞.     

Factorisation of positive definite operators

In this paper we prove Reade’s result for the positive definite C ¹ kernels by using the factorisation method used by Kühn. Received: 10 April 2007, Revised: 3 December 2007     

Explicit generalized zolotarev polynomials with complex coefficients

We give explicitly a class of polynomials with complex coefficients of degreen which deviate least from zero on [−1, 1] with respect to the max-norm among all polynomials which have the same,m + 1, 2m ≤n, first leading coefficients. Form=1, we obtain the polynomials discovered by Freund and Ruschewyh. Furthermore, corresponding results are obtained with respect to weight functions of the type 1/√ρl, whereρl is a polynomial positive on [−1, 1].     

Inequalities for generalized nonnegative polynomials

We define generalized polynomials as products of polynomials raised to positive real powers. The generalized degree can be defined in a natural way. We prove Markov-, Bernstein-, and Remez-type inequalities inL ^p (0p) and Nikolskii-type inequalities for such generalized polynomials. Our results extend the corresponding inequalities for ordinary polynomials.Communicated by George G. Lorentz.     

Markov-Bernstein-type inequalities for classes of polynomials with restricted zeros

We prove that an absolute constantc>0 exists such that

Asymptotic expansion formula for Bernstein polynomials defined on a simplex

In this paper we give a complete expansion formula for Bernstein polynomials defined on ans-dimensional simplex. This expansion for a smooth functionf represents the Bernstein polynomialB _n (f) as a combination of derivatives off plus an error term of orderO(n^–s ).Communicated by Wolfgang Dahmen.     

On maximal ranges of polynomial spaces in the unit disk

Let be a domain in C, 0, and let _n ⁰ () be the set of polynomials of degreen such thatP(0)=0 andP(D), whereD denotes the unit disk. The maximal range _n is then defined to be the union of all setsP(D),P _n ⁰ (). We derive necessary and, in the case of ft convex, sufficient conditions for extremal polynomials, namely those boundaries whose ranges meet _n . As an application we solve explicitly the cases where is a half-plane or a strip-domain. This also implies a number of new inequalities, for instance, for polynomials with positive real part inD. All essential extremal polynomials found so far in the convex cases are univalent inD. This leads to the formulation of a problem. It should be mentioned that the general theory developed in this paper also works for other than polynomial spaces.Communicated by J. Milne Anderson.     

Universal bases and greedy algorithms for anisotropic function classes

We suggest a three-step strategy to find a good basis (dictionary) for non-linear m-term approximation. The first step consists of solving an optimization problem of finding a near best basis for a given function class F, when we optimize over a collection D of bases (dictionaries). The second step is devoted to finding a universal basis (dictionary) D _u ∈ D for a given pair (F, D) of collections: F of function classes and D of bases (dictionaries). This means that D_u provides near optimal approximation for each class F from a collection F. The third step deals with constructing a theoretical algorithm that realizes near best m-term approximation with regard to D _u for function classes from F. In this paper we work this strategy out in the model case of anisotropic function classes and the set of orthogonal bases. The results are positive. We construct a natural tensor-product-wavelet-type basis and prove that it is universal. Moreover, we prove that a greedy algorithm realizes near best m-term approximation with regard to this basis for all anisotropic function classes.     

Interpolatory properties of best rationalL 1-approximations

In this paper the distribution of the zeros of the error function for bestL ₁-approximation by rational functions fromR _n,m is considered. It is shown that the maximal distance between such zeros isO(1/(n–m)), ifn > m.Communicated by Edward B. Saff.     

Super spline spaces of smoothnessr and degreed≥3r+2

The problem of computing the dimension of spaces of splines whose elements are piecewise polynomials of degreed withr continuous derivatives globally has attracted a great deal of attention recently. We contribute to this theory by obtaining dimension formulae for certain spaces of super splines, including the case where varying amounts of additional smoothness is enforced at each vertex. We also explicitly construct minimally supported bases for the spaces. The main tool is the Bernstein-Bézier method.Communicated by Klaus Höllig.     

The numerical range of elementary operators

For n-tuplesA=(A ₁,...,A _n ) andB=(B ₁,...,B _n ) of operators on a Hilbert spaceH, letR _A,B denote the operator onL(H) defined by . In this paper we prove that

Rational approximation to Lipschitz and Zygmund classes

In this paper, characterizations for lim _n(R _n (f)/(n ^–1)=0 inH and for lim _n(n ^r+ R _n (f)=0 inW ^r Lip ,r1, are given, while, forZ, a generalization to a related result of Newman is established.Communicated by Ronald A. DeVore.     

Gibbs-Wilbraham splines

If a function with a jump discontinuity is approximated in the norm ofL ²[–1,1] by a periodic spline of orderk with equidistant knots, a behavior analogous to the Gibbs-Wilbraham phenomenon for Fourier series occurs. A set of cardinal splines which play the role of the sine integral function of the classical phenomenon is introduced. It is then shown that ask becomes large, the phenomenon for splines approaches the classical phenomenon.Communicated by Ronald A. DeVore.     

On the uniqueness of canonical points in the Hobby-Rice theorem

According to the Hobby-Rice theorem for anyn-dimensional subspaceU _n ofL ₁([a, b], ) ( positive, finite, nonatomic) there exist points =s ₀x ₁x _m+1=b, where 0mn, such that