The polya-1 property for convex approximation

If f∈L_p[0, 1], let f_p be its best L_p-approximant by convex functions. It is shown that if exists uniformly on closed subintervals of (0,1). This research was partially supported by Grant No. 020-033-58 from the Faculty Research Committee, Idaho State University.     

Continuous and discrete N-convex approximations

We show that the best L_p-approximant to continuous functions by n-convex functions is the limit of discrete n-convex approximations. The techniques of the proof are then used to show the existence of near interpolants to discrete n-convex data by continuous n-convex functions if the data points are close.     

Best monotone approximation and the Hardy-Littlewood maximal function

If f∈L₂[0, 1] and g^*∈L₂[0, 1] is the best non-decreasing approximation to f, then it's shown that ‖f−g^*‖₂=‖f−θ(f)‖₂, where θ(f) denotes the Hardy-Littlewood maximal function of f.     

An algebra of absolutely continuous functions and its multipliers

The aim of this paper is to study the algebraAC _p of absolutely continuous functionsf on [0,1] satisfying f(0) = 0,f ’ ∈ L^p[0, 1] and the multipliers ofAC _p .     

Approximation by Kantorovich-Bernstein polynomials inL p(0<p<1)-metric

The purpose of the present paper is to evaluate the error of the approximation of the function f∈L₁[0,1] by Kantorovich-Bernstein polynomials in L_p-metric (0<p<1).     

On dyadic analysis based on the pointwise dyadic derivative

В пРЕДыДУЩИх РАБОтАх АВтОРы В ОсНОВНОМ РАж ВИВАлИ ДВОИЧНыИ АНАлИж, ОсНО ВАННыИ НА пОНьтИИ сИльНОИ ДВ ОИЧНОИ пРОИжВОДНОИ Д ль ФУНкцИИ, ОпРЕДЕлЕННых НА ДИАД ИЧЕскОИ ГРУппЕ ИлИ НА [0,1) с пЕРИО ДОМ 1. цЕльУ НАстОьЩЕИ Р АБОты ьВльЕтсь пОстРОЕНИЕ ДВОИЧНОгО ДИФФЕРЕНцИАльНОгО И ИНтЕгРАльНОгО ИсЧИс лЕНИИ НА ОсНОВЕ БОлЕЕ слОжНОг О, НО жАтО И БОлЕЕ клАссИЧЕскОгО пОНьт Иь ДВОИЧНОИ пРОИжВОД НОИ В тОЧкЕ. ИсслЕДУУтсь тЕ пРОст РАНстВА ФУНкцИИ, Дль кОтОРых пРИМЕНИМ ДВОИЧНыИ АНАлИж, А тАк жЕ ОпРЕДЕльУтсь гРАНИц ы ЕгО пРИМЕНИМОстИ. тАк ОкАжАлОсь, ЧтО пРО стРАНстВОL ^p(0, l), 1≦∞, ьВльЕ тсь БОлЕЕ ЕстЕстВЕННыМ п РОстРАН стВОМ Дль пОстРОЕНИь ДВОИЧНОгО АНАлИжА, ЧЕ М клАссИЧЕскОЕ пРОстР АНстВОс[0,1]. НАпРИМЕР, ЕслИ пЕРВАь ДВОИЧНАь пРОИжВОДНАь пРИНАДл ЕжИтс[0,1], тОf=const. с ДРУгОИ стОРОНы, ЕслИfεс[0,1], тО ДВОИЧНыИ ИНтЕгРАл, пОстРОЕННы И Дльf, НЕ пРИНАДлЕжИтс[0,1]. Уст АНОВлЕНО тАкжЕ, ЧтО сИльНАь ДВО ИЧНАь пРОИжВОДНАь И Д ВОИЧНАь пРОИжВОДНАь В тОЧкЕ с ОВпАДАУт пОЧтИ ВсУДУ Дль ФУНкцИИ, пРИ НАДлЕжАЩИх ОпРЕДЕлЕ ННОМУ пОДклАссУL ^p[0, 1]. пОлУЧЕННыЕ РЕжУльтА ты пРИМЕНьУтсь к пОЧл ЕННОМУ ДИФФЕРЕНцИРОВАНИУ И ИНтЕгРИРОВАНИУ РьДОВ пО сИстЕМЕ УОлш А, к ОцЕНкАМ ВЕлИЧИН кОЁФФИцИЕНтОВ ФУРьЕ-УОлшА, к ДОкАжАтЕльст ВУ АНАлОгА ОсНОВНОИ тЕО РЕМы О НАИлУЧшЕМ пРИБ лИжЕНИИ Дль пОлИНОМОВ пО сИстЕМЕ УОлшА, А тАкжЕ к РЕшЕНИ У ДВОИЧНОгО ВОлНОВОг О УРАВНЕНИь.     

THE GLOBAL APPROXIMATION BY LEFT-BERNSTEIN-DURRMEYER QUASI-INTERPOLANTS IN Lp[0, 1]

In this paper,we will use the 2r-th Ditzian-Totik modulus of smoothness wp^2r(f,t)p to discuss the direct and inverse theorem of approximation by Left-Bernstein-Durrmeyer quasi-interpolants Mn^[2r-1]f for functions of the space Lp[0,1](1≤p≤ ∞)。     

Generalized monotone approximation inL p Space

Letf(x) ∈L _p[0,1], 1?p? ∞. We shall say that functionf(x)∈Δ^k (integerk?1) if for anyh ∈ [0, 1/k] andx ∈ [0,1?kh], we have Δ _h ^k f(x)?0. Denote by ∏ _n the space of algebraic polynomials of degree not exceedingn and define $$E_{n,k} (f)_p : = \mathop {\inf }\limits_{\mathop {P_n \in \prod _n }\limits_{P_n^{(\lambda )} \geqslant 0} } \parallel f(x) - P_n (x)\parallel _{L_p [0,1]} .$$ We prove that for any positive integerk, iff(x) ∈ Δ ^k ∩ L _p[0, 1], 1?p?∞, then we have $$E_{n,k} (f)_p \leqslant C\omega _2 \left( {f,\frac{1}{n}} \right)_p ,$$ whereC is a constant only depending onk.     

Convex polynomial and spline approximation inL p,O<p<∞

We prove that a convex functionf ∈ L _p[−1, 1], 0<p<∞, can be approximated by convex polynomials with an error not exceeding Cω ₃ ^ϕ (f,1/n)_p where ω ₃ ^ϕ (f,·) is the Ditzian-Totik modulus of smoothness of order three off. We are thus filling the gap between previously known estimates involving ω ₃ ^ϕ (f,1/n)_p, and the impossibility of having such estimates involving ω₄. We also give similar estimates for the approximation off by convexC ⁰ andC ¹ piecewise quadratics as well as convexC ² piecewise cubic polynomials. Communicated by Dietrich Braess     

When is a Markovian Semigroup Induced by a Semiflow?

t , for t ≥ 0, be a strongly continuous Markovian semigroup acting on C(X), where X is a compact Hausdorf space, and let D denote the domain of its infinitesimal generator Z. Suppose D contains a (perhaps finite) family of functions f separating the points of X and satisfying Zf² = 2fZf. If either (1) there exists δ > 0 such that (T^t f)²∈ D if 0 ≤ t ≤δ for each f in this family; or (1′) for some core D′ of Z, g ∈ D′ implies g²∈ D, then the underlying Markoff process on X is deterministic. That is, there exists a semiflow — a semigroup (under composition) of continuous functions φ_t from X into X — such that T^tf(x) = f(φ_t (x)). If the domain D should be an algebra then conditions (1) and (1′) hold trivially. Conversely, if we have a separating family satisfying Zf² = 2fZf then each of these conditions implies that D is an algebra. It is an open question as to whether these conditions are redundant. If the functions φ_t are homeomorphisms from X onto X, then of course we have a Markovian group induced by a flow. This result is obtained by first providing general results about the null-space N of the (function-valued) positive semidefinite quadratic form defined by < f, g > = Z(fg) - fZg - gZf. The set N can be defined for any generator Z of a strongly continuous Markovian semigroup and is equivalently given by N = {f ∈ D| f²∈ D and Zf² = 2fZf} = {f ∈ D| T^t(f²)-(T^tf)² is o(t²) in C(X)}. In the general case N is an algebra closed under composition with any C¹-function φ from the reals to the reals, and Z(φ[f]) = (Zf)φ′[f] if f ∈ N. This "chain rule" on N (on which Z must act as a derivation) is a special case of a theorem for C²-functions φ which holds more generally for all f in d, viz., Z(φ[f] = (Zf) φ′[f] + ? <f, f> φ″[f], Provided Z is a local operator and D is an algebra. In this case the form < f, g > itself enjoys the relation < φ[f], ψ[g] > = φ′ [f] ψ′[g] < f, g >, for C²functions φ and ψ. Some of the results and their proofs continue to hold when the setting is switched from the commutative C*-algebra C(X) to a general (noncommutative) C*-algebra A. In the norm continuous case we obtain a sharp characterization of Markovian semigroups that are groups: Let T^t = e^tz , defined for t ≥ 0, be a Markovian semigroup acting on a C*-algebra A that is norm continuous, i.e., ||T^t - I|| ⇒ 0 as t ⇒ 0 +. Assume Z(a²) = a(Za) + (Za) a for some (perhaps finite) set of self-adjoint elements a that generate a Jordan algebra dense among the self-adjoint elements of A. The e^tz , -∞ < t < ∞, is a group of Markovian operators.     

A development on approximation by monotone sequences of polynomials

Recently people proved that every f∈C[0,1] can be uniformly approximated by polynomial sequences {P_n}, {Q_n} such for any x∈[0,1] and n=1,2,… that {fx98-1}. For example, Xie and Zhou^[2] showed that one can construct such monotone polynomial sequences which do achieve the best uniform approximation rate for a continuous function. Actually they obtained a result as {fx98-2}, which essentially improved a conclusion in Gal and Szabados^[1]. The present paper, by optimal procedure, improves this inequality to {fx98-3}, where ɛ is any positive real number.     

New Coins From Old: Computing With Unknown Bias

Suppose that we are given a function f : (0, 1)→(0,1) and, for some unknown p∈(0, 1), a sequence of independent tosses of a p-coin (i.e., a coin with probability p of “heads”). For which functions f is it possible to simulate an f(p)-coin? This question was raised by S. Asmussen and J. Propp. A simple simulation scheme for the constant function f(p)≡1/2 was described by von Neumann (1951); this scheme can be easily implemented using a finite automaton. We prove that in general, an f(p)-coin can be simulated by a finite automaton for all p ∈ (0, 1), if and only if f is a rational function over ℚ. We also show that if an f(p)-coin can be simulated by a pushdown automaton, then f is an algebraic function over ℚ; however, pushdown automata can simulate f(p)-coins for certain nonrational functions such as . These results complement the work of Keane and O’Brien (1994), who determined the functions f for which an f(p)-coin can be simulated when there are no computational restrictions on the simulation scheme. * Supported by a Miller Fellowship. † Supported in part by NSF Grant DMS-0104073 and by a Miller Professorship. ‡ This work is supported under a National Science Foundation Graduate Research Fellowship.     

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

LIMIT OF ITERATES FOR BERNSTEIN POLYNOMIALS DEFINED ON A TRIANGLE

Let f∈C[0,1],and Bn(f,x) be the a-th Bernstein polynomial associated with function f.ln 1967,the limit of iterates for B.(f,x) was given by Kelisky and Rivlin.After this,Many mathematicians studied and generalized this result.But anyway,all these discussions are only for univariate case ,In this paper,the main contrlbution is that the limit of lterates for Bernstein polynomial defined on a triangle is given completely.     

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.     

nth order Stieltjes differential boundary operators and Stieltjes differential boundary systems

This article discusses linear differential boundary systems, which include nth-order differential boundary relations as a special case, in $\text{L}$_n^p[0,1] × $\text{L}$_n^p[0,1], 1 ? p < ∞. The adjoint relation in $\text{L}$_n^q[0,1] × $\text{L}$_n^q[0,1], $\text{1}\text{p}\text{+}\text{1}\text{q}\text{= 1}$, is derived. Green's formula is also found. Self-adjoint relations are found in $\text{L}$_n²[0,1] × $\text{L}$_n²[0,1], and their connection with Coddington's extensions of symmetric operators on subspaces of $\text{L}$_n^p[0,1] × $\text{L}$_n²[0,1] is established.     

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.     

The exact order of approximation of functions by Bernstein polynomials in a Hausdorff metric

We investigate the approximation of functions by Bernstein polynomials. We prove that (1) $$^\tau [0,1]^{(f,B_n (f))} \leqslant \mu _f \left( {4\sqrt {\tfrac{{\ln n}}{n}} } \right) + \left( {4\sqrt {\tfrac{{\ln n}}{n}} } \right),$$ where r_[0,1](f, Bn(f)) is the Hausdorff distance between the functionsf(x) and B_n(f; x) in [0,1], is the modulus of nonmonotonicity off(x). The bound (1) is of better order than that obtained by Sendov. We show that the order of (1) cannot be improved.     

On subsequences of the Haar system inL p [0, 1], (1<p<∞)

We show that ifX is the closed linear span inL _p [0,1] of a subsequence of the Haar system, thenX is isomorphic either tol _p or toL _p [0,1], [1<p<∞]. We give criteria to determine which of these cases holds; for a given subsequence, this is independent ofp. This is part of the second author's Ph.D. dissertation, written at the University of Alberta under the supervision of J. L. B. Galmen. The first author's research was partially supported by NRC A7552.     

On shape preserving extension and approximation of functions

We establish the concept of shapes of functions by using partial differential inequalites. Our definition about shapes includes some usual shapes such as convex, subharmonic, etc., and gives many new shapes of functions. The main results show that the shape preserving approximation has close relation to the shape preserving extension. One of our main results shows that if f∈C(Ω) has some shape defined by our definition, then f can be uniformly approximated by polynomials P_n ∈ ℙ_n (n∈ℕ) which have the same shape in Ω, and the degree of the approximation is Cω(f,n^−β) with constants C,β>0.