Convexity preserving and predicting by Bernstein polynomials

It is known that the Bernstein polynomials of a function f defined on [0, 1 ] preserve its convexity properties, i.e., if f⁽ⁿ⁾ 0 then for m n, (B_mf)⁽ⁿ⁾ 0. Moreover, if f is n-convex then (B_mf)⁽ⁿ⁾ 0. While the converse is not true, we show that if f is bounded on (a, b) and if for every subinterval [α, β] (a, b) the nth derivative of the mth Bernstein polynomial of f on [α, β] is nonnegative then f is n-convex.     

Properties of convergence for -Bernstein polynomials

In this paper, we discuss properties of the ω,q-Bernstein polynomials introduced by S. Lewanowicz and P. Woźny in [S. Lewanowicz, P. Woźny, Generalized Bernstein polynomials, BIT 44 (1) (2004) 63–78], where fC[0,1], ω,q>0, ω≠1,q⁻¹,…,q⁻ⁿ⁺¹. When ω=0, we recover the q-Bernstein polynomials introduced by [G.M. Phillips, Bernstein polynomials based on the q-integers, Ann. Numer. Math. 4 (1997) 511–518]; when q=1, we recover the classical Bernstein polynomials. We compute the second moment of , and demonstrate that if f is convex and ω,q(0,1) or (1,∞), then are monotonically decreasing in n for all x[0,1]. We prove that for ω(0,1), q_n(0,1], the sequence converges to f uniformly on [0,1] for each fC[0,1] if and only if lim_n→∞q_n=1. For fixed ω,q(0,1), we prove that the sequence converges for each fC[0,1] and obtain the estimates for the rate of convergence of by the modulus of continuity of f, and the estimates are sharp in the sense of order for Lipschitz continuous functions.     

Relativistic Lamé functions: Completeness vs. polynomial asymptotics

In earlier work we introduced and studied two commuting generalized Lamé operators, obtaining in particular joint eigenfunctions for a dense set in the natural parameter space. Here we consider these difference operators and their eigenfunctions in relation to the Hilbert space L²((0, π/r), w(x)dx), with r > 0 and the weight function w(x) a ratio of elliptic gamma functions. In particular, we show that the previously known pairwise orthogonal joint eigenfunctions need only be supplemented by finitely many new ones to obtain an orthogonal base. This completeness property is derived by exploiting recent results on the large-degree Hilbert space asymptotics of a class of orthonormal polynomials. The polynomials p_n(cos(rx)), n ε , that are relevant in the Lamé setting are orthonormal in L²((0, π/r), w_P(x)dx), with w_p(x) closely related to w(x).     

q-Bernstein polynomials and their iterates

Let B_n( f,q;x), n=1,2,… be q-Bernstein polynomials of a function f : [0,1]→C. The polynomials B_n( f,1;x) are classical Bernstein polynomials. For q≠1 the properties of q-Bernstein polynomials differ essentially from those in the classical case. This paper deals with approximating properties of q-Bernstein polynomials in the case q>1 with respect to both n and q. Some estimates on the rate of convergence are given. In particular, it is proved that for a function f analytic in {z: |z|<q+} the rate of convergence of {B_n( f,q;x)} to f(x) in the norm of C[0,1] has the order q⁻ⁿ (versus 1/n for the classical Bernstein polynomials). Also iterates of q-Bernstein polynomials {B_n^j_n( f,q;x)}, where both n→∞ and j_n→∞, are studied. It is shown that for q(0,1) the asymptotic behavior of such iterates is quite different from the classical case. In particular, the limit does not depend on the rate of j_n→∞.     

Error estimates for a class of quadrature formulae

The problem considered is that of estimating the error of a class of quadrature formulae for _–1 ¹ w _r (x)f(x)dx, (w _r (x) being a positive weight-function), where only values off(x) in (–1,1) and off(x) and its derivatives at the end-points of the interval are considered.     

On the Convergence and Iterates of q-Bernstein Polynomials

The convergence properties of q-Bernstein polynomials are investigated. When q1 is fixed the generalized Bernstein polynomials _nf of f, a one parameter family of Bernstein polynomials, converge to f as n→∞ if f is a polynomial. It is proved that, if the parameter 0<q<1 is fixed, then _nf→f if and only if f is linear. The iterates of _nf are also considered. It is shown that _n^Mf converges to the linear interpolating polynomial for f at the endpoints of [0,1], for any fixed q>0, as the number of iterates M→∞. Moreover, the iterates of the Boolean sum of _nf converge to the interpolating polynomial for f at n+1 geometrically spaced nodes on [0,1].     

On the existence of entire functions of boundedl-index andl-regular growth

We prove that, under certain conditions on a positive functionl continuous on [0, +∞], there exists an entire transcendental functionf of boundedl-index such that lnlnM _f(r)lnL(r),r→∞, whereM _f (r)=max {|f(z)|: |z|=r} andL(r)=∫ ₀ ^r l(t)dt. Ifl(r)=r ^p-1 forr≥1, 0<ρ<∞, then there exists an entire functionf of boundedl-index such thatM _f (r)≈r ^p . Lvov University, Lvov. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 48, No. 9, pp. 1166–1182, September, 1996.     

New Coins from Old, Smoothly

Given a (known) function f:[0,1]→(0,1), we consider the problem of simulating a coin with probability of heads f(p) by tossing a coin with unknown heads probability p, as well as a fair coin, N times each, where N may be random. The work of Keane and O’Brien (ACM Trans. Model. Comput. Simul. 4(2):213–219, 1994) implies that such a simulation scheme with the probability ℙ _p (N<∞) equal to 1 exists if and only if f is continuous. Nacu and Peres (Ann. Appl. Probab. 15(1A):93–115, 2005) proved that f is real analytic in an open set S⊂(0,1) if and only if such a simulation scheme exists with the probability ℙ _p (N>n) decaying exponentially in n for every p∈S. We prove that for α>0 noninteger, f is in the space C ^α [0,1] if and only if a simulation scheme as above exists with ℙ _p (N>n)≤C(Δ _n (p)) ^α , where \varDelta _n(x):=max{?{x(1-x)/n},1/n}\varDelta _{n}(x):=\max\{\sqrt{x(1-x)/n},1/n\}. The key to the proof is a new result in approximation theory: Let B⁺_n\mathcal{B}^{+}_{n} be the cone of univariate polynomials with nonnegative Bernstein coefficients of degree n. We show that a function f:[0,1]→(0,1) is in C ^α [0,1] if and only if f has a series representation ?_n=1^￥F_n\sum_{n=1}^{\infty}F_{n} with F_n ? B⁺_nF_{n}\in \mathcal{B}^{+}_{n} and ∑ _k>n F _k (x)≤C(Δ _n (x)) ^α for all x∈[0,1] and n≥1. We also provide a counterexample to a theorem stated without proof by Lorentz (Math. Ann. 151:239–251, 1963), who claimed that if some j_n ? B⁺_n\varphi_{n}\in\mathcal{B}^{+}_{n} satisfy |f(x)−φ _n (x)|≤C(Δ _n (x)) ^α for all x∈[0,1] and n≥1, then f∈C ^α [0,1].     

Necessary and sufficient conditions for the convergence of integrated and mean-integratedr-th order error of histogram density estimates

Suppose thatX _l ,..., X _n are samples drawn from a population with density functionf andf _n (x)=f _n (x;X _l ,..., X _n is an estimate off(x), Denote bym _nr =|f _n (x)–f(n)| ^r dx andM _nr =E(m _nr) the Integratedr-th Order Error and Mean Integratedr-th Order Error off _n for somer1 (whenr=2,they are the familiar and widely studied ISE and MISE), In this paper the same necessary and sufficient condition for and a.s. is obtained whenf _n (x) is the ordinary histogram estimator.The Project supported by National Natural Science Foundation of China.     

N-widths of Ω r ′ in L p

Let Ω _ϕ ^r ={f:f ^(r-1) abs. cont. on [0,1], ‖q_r(D)f‖_p≤1, f^(2K+σ) (0)=f^(2K+σ)=0, (k)=0,...,l-1}. where , and I is an identical operator. Denote Kolmogorov, linear, Geelfand and Bernstein n-widths of Ω _ϕ ^r in L^p byd _n (Ω _ϕ ^r ;L ^p ),δ _n (Ω _ϕ ^r ;L ^p ),d ⁿ (Ω _p ^r ;L ^p ) andb _n (Ω _p ^r ;L ^p ), respectively. In this paper, we find a method to get an exact estimation of these n-widths. Related optimal subspaces and an optimal linear operator are given. For another subset , similar results are also derrived.     

Convergence of Lagrange Interpolation Polynomials for Piecewise Smooth Functions

The present paper first establishes a decomposition result for f(x)∈ C ^r C ^r+1. By using this decomposition we thus can obtain an estimate of ∣f(x) - L _n (f,x)∣ which reflects the influence of the position of the x's and ω(f ^(r+1),δ)_j, j = 0,1,...,s, on the error of approximation. This revised version was published online in June 2006 with corrections to the Cover Date.     

A Completeness Problem Related to the Riemann Hypothesis

It is proven that the set of eigenvectors and generalized eigenvectors associated to the non-zero eigenvalues of the Hilbert-Schmidt (non nuclear, non normal) integral operator on L²(0, 1)

Asymptotic formulas for n-diameters of certain compacta in L2[0, 1]

In the current article the order of the Kolmogorov n-diameters of compacta, determined by the operatorsLy =p (x)dy/dx +q (x)y, Ly = [–d²/dx² +q (x) d/dx]^r y in L₂[0, 1] with a bound on the order of the error is studied and asymptotic formulas for d_n as a function of p(x), q(x), and r are derived.Translated from Matematicheskie Zametki, Vol. 20, No. 3, pp. 331–340, September, 1976.     

On the convergence of Hunter's quadrature rule for Cauchy principal value integrals

Hunter's (n+1)-point quadrature rule for the approximate evaluation of the Cauchy principal value integralf ¹ _–1 (w(x)f(x)/(x – ))dx, –1<<1, is based on approximatingf by the polynomial which interpolatesf at the point and then zeros of the orthogonal polynomialp _n generated by the weight functionw. Sufficient conditions are given to ensure the convergence of a suitably chosen subsequence of the quadrature rules to the integral, whenf is Hölder continuous on [–1,1].     

Analytic Extension of Non Quasi - Analytic Whitney Jets of Beurling Type

Let (M_r)_r∈_?0 be a logarithmically convex sequence of positive numbers which verifies M₀ = 1 as well as M_r ≥ 1 for every r ∈ ? and defines a non quasi - analytic class. Let moreover F be a closed proper subset of ?ⁿ. Then for every function f on ?ⁿ belonging to the non quasi - analytic (M_r)-class of Beurling type, there is an element g of the same class which is analytic on ?,ⁿ F and such that D^αf(x) = D^αg(x) for every α ∈ ?ⁿ₀ and x ∈ F.     

Minimum asymptotic error of algorithms for solving ODE

We deal with algorithms for solving systems z′(x) = f(x, z(x)), x ε [0, c], z(0) = η where f has r continuous bounded derivatives in [0, c) × ^s. We consider algorithms whose sole dependence on f is through the values of n linear continuous functionals at f. We show that if these functionals are defined by partial derivatives off then, roughly speaking, the error of an algorithm (for a fixed f) cannot converge to zero faster than n^−r as n → +∞. This minimal error is achieved by the Taylor algorithm. If arbitrary linear continuous functionals are allowed, then the error cannot converge to zero faster than n^−(r+1) as n → +∞. This minimal error is achieved by the Taylor-integral algorithm which uses integrals of f.     

Negative result in pointwise 3-convex polynomial approximation

Let Δ³ be the set of functions three times continuously differentiable on [−1, 1] and such that f″′(x) ≥ 0, x ∈ [−1, 1]. We prove that, for any n ∈ ℕ and r ≥ 5, there exists a function f ∈ C ^r [−1, 1] ⋂ Δ³ [−1, 1] such that ∥f ^(r)∥ _{C[−1, 1]} ≤ 1 and, for an arbitrary algebraic polynomial P ∈ Δ³ [−1, 1], there exists x such that

Approximation by rational functions with prescribed numerator degree in L p spaces for 1<p< ∞

The present paper establishes a complete result on approximation by rational functions with prescribed numerator degree in L ^pspaces for 1 < p < ∞ and proves that if f(x)∈L ^p _[-1,1] changes sign exactly l times in (-1,1), then there exists r(x)∈R _n ^l such that

Wavelet expansions of fractal measures

Let μ be a measure on ℝⁿ that satisfies the estimate μ(B _r(x))≤cr ^α for allx ∈ ℝⁿ and allr ≤ 1 (B _r(x) denotes the ball of radius r centered atx. Let ϕ _j,k ^(ɛ) (x)=2 ^nj2ϕ^(ɛ)(2 ^j x-k) be a wavelet basis forj ∈ ℤ, κ ∈ ℤⁿ, and ∈ ∈E, a finite set, and letP _j (T)=Σ_ɛ,k <T,ϕ _j,k ^(ɛ) >ϕ _j,k ^(ɛ) denote the associated projection operators at levelj (T is a suitable measure or distribution). Iff ∈Ls ^p(dμ) for 1 ≤p ≤ ∞, we show thatP _j(f dμ) ∈ L^p(dx) and ||P _j (fdμ)||L _p(dx)≤c2 ^{j((n-α)/p′))}||f||L _p(dμ) for allj ≥ 0. We also obtain estimates for the limsup and liminf of ||P _j (fdμ)||L _p(dx) under more restrictive hypotheses. Communicated by Guido Weiss     

Convergence of Modified Lagrange Interpolation toLp-Functions Based on the Zeros of Orthonormal Polynomials with Freud Weights

We consider the “Freud weight”W²_Q(x)=exp(−Q(x)). let 1<p<∞, and letL*_n(f) be a modified Lagrange interpolation polynomial to a measurable functionf∈{f; ess sup_x∈ |f(x)| W_Q(x)(1+|x|)^α<∞},α>0. Then we have lim_n→∞ ∫^∞_−∞ [|f(x)−L*_n(f; x)| W_Q(x)(1+|x|)^−Δ]^p dx=0, whereΔis a constant depending onpandα.