Polynomials of best approximation inC[−1,1]

Equivalences between the condition |P _n ^(k) (x)|≦K(n ⁻¹√1−x ²+1/n ²) ^k n ^-a, whereP _n(x) is the bestn-th degree polynomial approximation tof(x), and the Peetre interpolation space betweenC[−1,1] and the space (1−x ²) ^k f ^(2k)(x)∈C[−1,1] is established. A similar result is shown forE _n(f)= ‖f−P _n‖ _C[−1,1]. Rates other thann ^-a are also discussed. Supported by NSERC grant A4816 of Canada.     

A counterexample in copositive approximation

The present paper gives a converse result by showing that there exists a functionf ∈C _[−1,1], which satisfies that sgn(x)f(x) ≥ 0 forx ∈ [−1, 1], such that {fx75-1} whereE _n ⁽⁰⁾ (f, 1) is the best approximation of degreen tof by polynomials which are copositive with it, that is, polynomialsP withP(x(f(x) ≥ 0 for allx ∈ [−1, 1],E _n(f) is the ordinary best polynomial approximation off of degreen.     

Some applications of Banach algebra techniques

We consider some functional Banach algebras with multiplications as the usual convolution product * and the so‐called Duhamel product ?. We study the structure of generators of the Banach algebras (C⁽ⁿ⁾[0, 1], *) and (C⁽ⁿ⁾[0, 1], ?). We also use the Banach algebra techniques in the calculation of spectral multiplicities and extended eigenvectors of some operators. Moreover, we give in terms of extended eigenvectors a new characterization of a special class of composition operators acting in the Lebesgue space L^p[0, 1] by the formula (C_φf)(x) = f(φ(x)).     

A problem on simultaneous approximation and a conjecture of Hasson

In 1980, M. Hasson raised a conjecture as follows: Let N≥1, then there exists a function f₀(x)∈C _[−1,1] ^2N , for N+1≤k≤2N, such that p _n ^(k) (f₀,1)→f ₀ ^(k) (1), n→∞, where p_n(f,x) is the algebraic polynomial of best approximation of degree ≤n to f(x). In this paper, a, positive answer to this conjecture is given.     

On simultaneous approximation to a differentiable function and its derivative by inverse Pal-Type interpolation polynomials

Let ξ_{n −1} < ξ_{n −2} < ξ_{n − 2} < ... < ξ₁ be the zeros of the the (n−1)-th Legendre polynomial P_n−1(x) and −1=x_n<x_n−1<...<x₁=1, the zeros of the polynomial . By the theory of the inverse Pal-Type interpolation, for a function f(x)∈C _[−1,1] ¹ , there exists a unique polynomial R_n(x) of degree 2n−2 (if n is even) satisfying conditions R_n(f, ξ_k) = f (ε_k) (1 ⩽ k ⩽ n −1); R¹ _n(f,x_k)=f¹(x_k)(1≤k≤n). This paper discusses the simultaneous approximation to a differentiable function f by inverse Pal-Type interpolation polynomial {R_n(f, x)} (n is even) and the main result of this paper is that if f∈C _[1,1] ^r , r≥2, n≥r+2, and n is even then |R¹ _n(f,x)−f¹(x)|=0(1)|W_n(x)|h(x)·n^3−r·E_2n−r−3(f^(r)) holds uniformly for all x∈[−1,1], where .     

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

Copositive approximation by rational functions with prescribed numerator degree

The paper proves that, if f（x） ∈ L^p[-1,1],1≤p〈∞ ,changes sign I times in （-1, 1）,then there exists a real rational function r（x） ∈ Rn^（2μ-1）l which is eopositive with f（x）, such that the following Jackson type estimate ｜｜f-r｜｜p≤Cδl^2μωφ（f,1/n）p holds, where μ is a natural number ≥3/2＋1/p, and Cδ is a positive constant depending only on δ.     

Simultaneous Approximation by Polynomial Projection Operators

Pointwise estimates are obtained for simultaneous approximation of a function f and its derivatives by means of an arbitrary sequence of bounded projection operators with some extra condition (1.3) (we do not require the operators to be linear) which map C_[-1,1] into polynomials of degree n, augmented by the interpolation of f at some points near ±1. The present result essentially improved those in [BaKi3], and several applications are discussed in Section 4.     

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

Spline monotone approximation with linear differential operators

Let f∈C³[a,b] and L be a linear differential operator such that L(f)≥0. Then there exists a sequence Q_n, n≥1, of polynomial splines with equally spaced knots, such that Q^(r), approximates f^(r), 0≤r≤s, simultaneously in the uniform norm. This approximation is given through inequalities with rates, involving a measure of smoothness to f^(s); so that L (Q_n)≥0. The encountered cases are the continuous, periodic and discrete.     

Incomplete polynomials of best approximation

The main theorem proved in this paper is as follows. There exist odd functionsf ɛC[−1,1] with the following property. LetP _n be the polynomial of best uniform approximation tof of degree≦n. Then for infinitely manyn,P _n has zero of orders(n)≧c logn atx=0. This research has been supported by Grant MPS 75-09833 of the National Science Foundation.     

Are the degrees of best (co)convex and unconstrained polynomial approximation the same?

Let ℂ[−1,1] be the space of continuous functions on [−,1], and denote by Δ² the set of convex functions f ∈ ℂ[−,1]. Also, let E _n (f) and E _n ⁽²⁾ (f) denote the degrees of best unconstrained and convex approximation of f ∈ Δ² by algebraic polynomials of degree < n, respectively. Clearly, En (f) ≦ E _n ⁽²⁾ (f), and Lorentz and Zeller proved that the inverse inequality E _n ⁽²⁾ (f) ≦ cE _n (f) is invalid even with the constant c = c(f) which depends on the function f ∈ Δ². In this paper we prove, for every α > 0 and function f ∈ Δ², that

Pointwise and uniform estimates for convex approximation of functions by algebraic polynomials

Let Δ ^q be the set of functionsf for which theqth difference, is nonnegative on the interval [? 1,1],P _n is the set of algebraic polynomials of degree not exceedingn, τ _k (f, δ) _p is the averaged Sendov-Popov modulus of smoothness in theL _p [?1,1] metric for 1≦p≦∞, ω _k (f, δ) and $\omega _\phi ^k (f,\delta ),\phi (x): = \sqrt {1 - x^2 } ,$ , are the usual modulus and the Ditzian-Totik modulus of smoothness in the uniform metric, respectively. For a functionf∈C[?1,1]?Δ² we construct a polynomialp _n ∈P _n ?Δ² such that $$\begin{gathered} \left| {f(x) - p_n (x)} \right| \leqslant C\omega _3 (f,n^{ - 1} \sqrt {1 - x^2 } + n^{ - 2} ),x \in [ - 1,1]; \hfill \\ \left\| {f - p_n } \right\|_\infty \leqslant C\omega _\phi ^3 (f,n^{ - 1} ); \hfill \\ \left\| {f - p_n } \right\|_p \leqslant C\tau _3 (f,n^{ - 1} )_p . \hfill \\ \end{gathered}$$ As a consequence, for a functionf∈C ²[?1,1]?Δ³ a polynomialp _n ^* ∈P _n ?Δ³ exists such that $$\left\| {f - p_n^* } \right\|_\infty \leqslant Cn^{ - 1} \omega _2 (f\prime ,n^{ - 1} ),$$ wheren≥2 andC is an absolute constant.     

On the degree of complex rational approximation to real functions

Iff∈C[?1, 1] is real-valued, letE _R ^mn (f) andE _C ^mn (f) be the errors in best approximation tof in the supremum norm by rational functions of type (m, n) with real and complex coefficients, respectively. We show that form≥n?1≥0 $$\gamma _{mn} = \inf \{ {{E_{mn}^C (f)} \mathord{\left/ {\vphantom {{E_{mn}^C (f)} {E_{mn}^R (f)}}} \right. \kern-\nulldelimiterspace} {E_{mn}^R (f)}}:f \in C[ - 1,1]\} = \tfrac{1}{2}.$$      

Convex polynomial and spline approximation in C[−1, 1]

We prove that a convex functionf C[–1, 1] can be approximated by convex polynomialsp _n of degreen at the rate of ₃(f, 1/n). We show this by proving that the error in approximatingf by C² convex cubic splines withn knots is bounded by ₃(f, 1/n) and that such a spline approximant has anL third derivative which is bounded by n³₃(f, 1/n). Also we prove that iff C²[–1, 1], then it is approximable at the rate ofn ^–2 (f, 1/n) and the two estimates yield the desired result.Communicated by Ronald A. DeVore.     

Polynomial approximation using projections whose kernels contain the Chebyshev polynomials

Let P be any projection of f ε C^{n + 1}[−1, 1] onto _n such that P(T_{n + 1}) = 0. It is shown that, for a wide class of such projections, f − Pf may be expressed in terms of f^{n + 1} in the same manner as E_n(f), the error of minimax approximation. Furthermore, a general necessary condition is obtained for this phenomenon.     

Error bounds for least squares approximation by polynomials

Let f ε Cⁿ⁺¹[−1, 1] and let H[f](x) be the nth degree weighted least squares polynomial approximation to f with respect to the orthonormal polynomials q_k associated with a distribution dα on [−1, 1]. It is shown that if q_n+1/q_n max(q_n+1(1)/q_n(1), −q_n+1(−1)/q_n(−1)), then f − H[f] f^{n + 1} · q_n+1/q_{n + 1}^{(n + 1)}, where · denotes the supremum norm. Furthermore, it is shown that in the case of Jacobi polynomials with distribution (1 − t)^α (1 + t)^β dt, α, β > −1, the condition on q_n+1/q_n is satisfied when either max(α,β) −1/2 or −1 < α = β < −1/2.     

Eine Fehlerabschätzung zum Quadraturverfahren von Clenshaw und Curtis

Summary LetR _n [f] be the error of the quadrature formula of Clenshaw and Curtis. Narrow bounds for the coefficientc _n in |R _n [f]|c _n (n!)^–1 max |f ⁽ⁿ⁾ (x)| are given. As a consequence is proven, that the Clenshaw-Curtis-method will generally give more accurate results than the method of Filippi.     

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.     

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].