On estimates of approximation numbers and best bilinear approximation

We obtain estimates of approximation numbers of integral operators, with the kernels belonging to Sobolev classes or classes of functions with bounded mixed derivatives. Along with the estimates of approximation numbers, we also obtain estimates of best bilinear approximation of such kernels.Communicated by Charles A. Micchelli.     

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

We prove that an absolute constantc>0 exists such that

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.     

Uniform rational approximation of functions with first derivative in the real hardy space ReH 1

The main result proved in the paper is: iff is absolutely continuous in (–, ) andf' is in the real Hardy space ReH ¹, then for everyn1, whereR _n(f) is the best uniform approximation off by rational functions of degreen. This estimate together with the corresponding inverse estimate of V. Russak [15] provides a characterization of uniform rational approximation.Communicated by Ronald A. DeVore.     

Shape-preserving approximation inL p

We prove a direct theorem for shape preservingL _p -approximation, 0p, in terms of the classical modulus of smoothnessw ₂(f, t _p ¹ ). This theorem may be regarded as an extension toL _p of the well-known pointwise estimates of the Timan type and their shape-preserving variants of R. DeVore, D. Leviatan, and X. M. Yu. It leads to a characterization of monotone and convex functions in Lipschitz classes (and more general Besov spaces) in terms of their approximation by algebraic polynomials.Communicated by Ron DeVore.     

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.     

Multivariate simultaneous approximation

Theorems of Jackson type are given, for the simultaneous approximation of a function of class C^m and its partial derivatives, by a polynomial and the corresponding partial derivatives.     

Optimality and uniqueness conditions in complex rational Chebyshev approximation with examples

It is well known that best complex rational Chebyshev approximants are not always unique and that, in general, they cannot be characterized by the necessary local Kolmogorov condition or by the sufficient global Kolmogorov condition. Recently, Ruttan (1985) proposed an interesting sufficient optimality criterion in terms of positive semidefiniteness of some Hermitian matrix. Moreover, he asserted that this condition is also necessary, and thus provides a characterization of best approximants, in a fundamental case.In this paper we complement Ruttan's sufficient optimality criterion by a uniqueness condition and we present a simple procedure for computing the set of best approximants in case of nonuniqueness. Then, by exhibiting an approximation problem on the unit disk, we point out that Ruttan's characterization in the fundamental case is not generally true. Finally, we produce several examples of best approximants on a real interval and on the unit circle which, among other things, give some answers to open questions raised in the literature.     

Rational approximation in the real Hardy spaceH 2 and Stieltjes integrals: A uniquencess theorem

The paper deals with rational approximation over the real Hardy spaceH _{2, R}(V), whereV is the complement of the closed unit disk. The results concern Stieltjes functions

Best polynomial approximation in Sobolev-Laguerre and Sobolev-Legendre spaces

We investigate limiting behavior as γ tends to ∞ of the best polynomial approximations in the Sobolev-Laguerre space W^N,2([0, ∞); e^−x) and the Sobolev-Legendre space W^N,2([−1, 1]) with respect to the Sobolev-Laguerre inner product

Weighted polynomial approximation with Freud weights

We show that ifw(x)=exp(–|x|), then in the case =1 for every continuousf that vanishes outside the support of the corresponding extremal measure there are polynomialsP _n of degree at mostn such thatw ⁿ P _n uniformly tends tof, and this is not true when <1. these=" are=" the=" missing=" cases=" concerning=" approximation=" by=" weighted=" polynomials=" of=" the=">w ⁿ P _n wherew is a Freud weight. Our second theorem shows that even if we are only interested in approximation off on the extremal support, the functionf must still vanish at the endpoints, and we actually determine the (sequence of) largest possible intervals where approximation is possible. We also briefly discuss approximation by weighted polynomials of the formW(a_nx)P _n (x).Communicated by Edward B. Saff.     

On the structure of a table of multivariate rational interpolants

In the table of multivariate rational interpolants the entries are arranged such that the row index indicates the number of numerator coefficients and the column index the number of denominator coefficients. If the homogeneous system of linear equations defining the denominator coefficients has maximal rank, then the rational interpolant can be represented as a quotient of determinants. If this system has a rank deficiency, then we identify the rational interpolant with another element from the table using less interpolation conditions for its computation and we describe the effect this dependence of interpolation conditions has on the structure of the table of multivariate rational interpolants. In the univariate case the table of solutions to the rational interpolation problem is composed of triangles of so-called minimal solutions, having minimal degree in numerator and denominator and using a minimal number of interpolation conditions to determine the solution.Communicated by Dietrich Braess.     

Incomplete rational approximation in the complex plane

We consider rational approximations of the form

Rational approximation to Neumann series of Bessel functions

LetJ _n (z) be the Bessel function of the first kind and ordern, and letf(z) be an analytic function in|z|r (r>0); then it is known that the Bessel expansion

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

Some properties of A-spaces and their relationship toL 1-approximation

Two new characterizations of A-spaces on an interval are obtained establishing a connection between the A-property and the Hobby-Rice theorem. A complete characterization of tensor product A-spaces on a rectangle is also given.Communicated by Allan Pinkus.     

On the sensitivity of radial basis interpolation to minimal data separation distance

Motivated by the problem of multivariate scattered data interpolation, much interest has centered on interpolation by functions of the form

An upper bound on the approximation power of principal shift-invariant spaces

An upper bound on theL _p-approximation power (1 ≤p ≤ ∞) provided by principal shift-invariant spaces is derived with only very mild assumptions on the generator. It applies to both stationary and nonstationary ladders, and is shown to apply to spaces generated by (exponential) box splines, polyharmonic splines, multiquadrics, and Gauss kernel.     

Characterization of Besov-Triebel-Lizorkin spaces via approximation by Whittaker's cardinal series and related unconditional Schauder bases

Let