首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
The present paper gives a converse result by showing that there exists a functionfC [−1,1], which satisfies that sgn(x)f(x) ≥ 0 forx ∈ [−1, 1], such that {fx75-1} whereE n (0) (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.  相似文献   

2.
We investigate Besov spaces and their connection with trigonometric polynomial approximation inL p[−π,π], algebraic polynomial approximation inL p[−1,1], algebraic polynomial approximation inL p(S), and entire function of exponential type approximation inL p(R), and characterizeK-functionals for certain pairs of function spaces including (L p[−π,π],B s a(L p[−π,π])), (L p(R),s a(Lp(R))), , and , where 0<s≤∞, 0<p<1,S is a simple polytope and 0<α<r. This project is supported by the National Science Foundation of China.  相似文献   

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

4.
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≤ ∞)。  相似文献   

5.
We study the approximation of functions of several variables by bilinear forms that are the pairwise products of functions of fewer variables. The order of approximation of Sobolev classesW q r by bilinear forms inL p for 2≤qp≤∞ is found. Translated by N. K. Kulman Translated fromMatematicheskie Zametki, Vol. 62, No. 1, pp. 18–34, July, 1997.  相似文献   

6.
We obtain an estimate exact in order for the best trigonometric approximation of classes of functions of one variable in the spaceL q in the case where 1<p≤2≤q<∞. Institute of Mathematics, Ukrainian Academy of Sciences, Kiev. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 52, No. 6, pp. 850–855, June, 2000.  相似文献   

7.
We prove a direct Jackson estimate for the approximation by Chebyshev splines in the classes L p , p > 0. Translated from Ukrainskii Matematicheskii Zhurnal, Vol.50, No. 9, pp. 1193–1201, September, 1998.  相似文献   

8.
The main result is that for 2≦qp<∞ the only subspaces of the Lorentz function spaceL pq [0, 1] which are isomorphic to r.i. function spaces on [0, 1] are, up to equivalent renormings,L pq [0, 1] andL 2[0, 1].  相似文献   

9.
10.
If f∈L2[0, 1] and g*∈L2[0, 1] is the best non-decreasing approximation to f, then it's shown that ‖f−g*2=‖f−θ(f)‖2, where θ(f) denotes the Hardy-Littlewood maximal function of f.  相似文献   

11.
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.  相似文献   

12.
The best one-sided approximation of periodic functions by trigonometric polynomials of classW p 0 (K) in the metric ofL is obtained. Translated fromMatematicheskie Zametki, Vol. 67, No. 1, pp. 136–140, January, 2000.  相似文献   

13.
The aim of this paper is to study the algebraAC p of absolutely continuous functionsf on [0,1] satisfying f(0) = 0,f ’ ∈ Lp[0, 1] and the multipliers ofAC p .  相似文献   

14.
An algorithm for best approximating in the sup-norm a function f C[0, 1]2 by functions from tensor-product spaces of the form πk C[0, 1] + C[0, 1] πl, is considered. For the case k = L = 0 the Diliberto and Straus algorithm is known to converge. A straightforward generalization of this algorithm to general k, l is formulated, and an example is constructed demonstrating that this algorithm does not, in general, converge for k2 + l2 > 0.  相似文献   

15.
In 1980, M. Hasson raised a conjecture as follows: Let N≥1, then there exists a function f0(x)∈C [−1,1] 2N , for N+1≤k≤2N, such that p n (k) (f0,1)→f 0 (k) (1), n→∞, where pn(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.  相似文献   

16.
Let X represent either the space C[-1,1] L p (α,β) (w), 1 ≦ p < ∞ on [-1, 1]. Then Xare Banach spaces under the sup or the p norms, respectively. We prove that there exists a normalized Banach subspace X 1 αβ of Xsuch that every f ∈ X 1 αβ can be represented by a linear combination of Jacobi polynomials to any degree of accuracy. Our method to prove such an approximation problem is Fourier–Jacobi analysis based on the convergence of Fourier–Jacobi expansions. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   

17.
In this paper, function spaces V∩l A p (w) are considered in the context of their multiplicative structure. The space V is determined by conditions on the values of a function in a disk (for example, CA,Lip Aα). We denote by l A p (w) the space of power series such that their Taylor coefficients are p-summable with weight w. For an analytic function Φ acting in a space of this type, we prove the following alternative: either Φ″(z)≡0, or the space is a Banach algebra with respect to pointwise multiplication. For a wide class of weights w, we establish the continuity of the identity embeddingmult(V∩l A p (w))↪multl A p . An estimate for the lp-multiplicative norm of random polynomials is found. This estimate can be considered as an extension of the known result by Salem-Zygmund. Bibliography: 10 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 232, 1996, pp. 50–72. Translated by S. Shimorin.  相似文献   

18.
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.  相似文献   

19.
We present a new method that allows us to get a direct proof of the classical Bernstein asymptotics for the error of the best uniform polynomial approximation of |x| p on two symmetric intervals. Note that, in addition, we get asymptotics for the polynomials themselves under a certain renormalization. Also, we solve a problem on asymptotics of the best approximation of sgn(x) on [−1,−a]∪[a,1] by Laurent polynomials.   相似文献   

20.
The purpose of the present paper is to evaluate the error of the approximation of the function f∈L1[0,1] by Kantorovich-Bernstein polynomials in Lp-metric (0<p<1).  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号