首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We consider the average caseL-approximation of functions fromCr([0, 1]) with respect to ther-fold Wiener measure. An approximation is based onnfunction evaluations in the presence of Gaussian noise with varianceσ2>0. We show that the n th minimal average error is of ordern−(2r+1)/(4r+4) ln1/2 n, and that it can be attained either by the piecewise polynomial approximation using repetitive observations, or by the smoothing spline approximation using non-repetitive observations. This completes the already known results forLq-approximation withq<∞ andσ0, and forL-approximation withσ=0.  相似文献   

2.
Let f: be a continuous, 2π-periodic function and for each n ε let tn(f; ·) denote the trigonometric polynomial of degree n interpolating f in the points 2kπ/(2n + 1) (k = 0, ±1, …, ±n). It was shown by J. Marcinkiewicz that limn → ∞0¦f(θ) − tn(f θ)¦p dθ = 0 for every p > 0. We consider Lagrange interpolation of non-periodic functions by entire functions of exponential type τ > 0 in the points kπ/τ (k = 0, ± 1, ± 2, …) and obtain a result analogous to that of Marcinkiewicz.  相似文献   

3.
Necessary and sufficient conditions are given which ensure the completeness of the trigonometric systems with integer indices; {einx; x }n=−∞ or {einx; x }n=1 in Lα(μ,  ), α1. If there exists a support Λ of the measure μ which is a wandering set, that is, Λ+2, k=0, ±1, ±2, … are mutually disjoint for different k's, then the linear span of our trigonometric system {einx; x }n=−∞ is dense in Lα(μ,  ) α1. The converse statement is also true.  相似文献   

4.
For a functionfLp[−1, 1], 0<p<∞, with finitely many sign changes, we construct a sequence of polynomialsPnΠnwhich are copositive withfand such that fPnp(f, (n+1)−1)p, whereω(ft)pdenotes the Ditzian–Totik modulus of continuity inLpmetric. It was shown by S. P. Zhou that this estimate is exact in the sense that if f has at least one sign change, thenωcannot be replaced byω2if 1<p<∞. In fact, we show that even for positive approximation and all 0<p<∞ the same conclusion is true. Also, some results for (co)positive spline approximation, exact in the same sense, are obtained.  相似文献   

5.
It is shown that an algebraic polynomial of degree k−1 which interpolates ak-monotone functionfatkpoints, sufficiently approximates it, even if the points of interpolation are close to each other. It is well known that this result is not true in general for non-k-monotone functions. As an application, we prove a (positive) result on simultaneous approximation of ak-monotone function and its derivatives inLp, 0<p<1, metric, and also show that the rate of the best algebraic approximation ofk-monotone functions (with bounded (k−2)nd derivatives inLp, 1<p<∞, iso(nk/p).  相似文献   

6.
There exist singular Riesz products =∏κ=1 (1+Re(ακζnκ)) on the unit circle with the parameters (an)n0 of orthogonal polynomials in L2() satisfying ∑n=0 |an|p<+∞ for every pp>2. The Schur parameters of the inner factor of the Cauchy integral ∫ (ζz)−1 (ζ), σ being such a Riesz product, belong to ∩p>2 lp.  相似文献   

7.
The convergence in L2( ) of the even approximants of the Wall continued fractions is extended to the Cesàro–Nevai class CN, which is defined as the class of probability measures σ with limn→∞n−1k=0 |ak|=0, {an}n0 being the Geronimus parameters of σ. We show that CN contains universal measures, that is, probability measures for which the sequence {|n|2 }n0 is dense in the set of all probability measures equipped with the weak-* topology. We also consider the “opposite” Szeg class which consists of measures with ∑n=0 (1−|an|2)1/2<∞ and describe it in terms of Hessenberg matrices.  相似文献   

8.
Let T be an ergodic automorphism of a probability space, f a bounded measurable function, . It is shown that the property that the probabilities μ(|Sn(f)|>n) are of order np roughly corresponds to the existence of an approximation in L of f by functions (coboundaries) ggT, gLp. Similarly, the probabilities μ(|Sn(f)|>n) are exponentially small iff f can be approximated by coboundaries ggT where g have finite exponential moments.

Résumé

Soit T un automorphisme ergodique d'un espace probabilisé, f une fonction bornée mesurable et . Une correspondance est établie entre l'existence de l'estimation des probabilités μ(|Sn(f)|>n) d'ordre np et l'existence de l'approximation dans L de la fonction f par des cobords ggTg est “presque” dans Lp. De manière similaire, les probabilités μ(|Sn(f)|>n) sont d'ordre ecn, pour un certain c>0, n=1,2… , si et seulement si f admet une approximation dans L par des cobords ggT avec g ayant des moments exponentiels.  相似文献   

9.
Let Xn, n , be i.i.d. with mean 0, variance 1, and EXn¦r) < ∞ for some r 3. Assume that Cramér's condition is fulfilled. We prove that the conditional probabilities P(1/√n Σi = 1n Xi t¦B) can be approximated by a modified Edgeworth expansion up to order o(1/n(r − 2)/2)), if the distances of the set B from the σ-fields σ(X1, …, Xn) are of order O(1/n(r − 2)/2)(lg n)β), where β < −(r − 2)/2 for r and β < −r/2 for r . An example shows that if we replace β < −(r − 2)/2 by β = −(r − 2)/2 for r (β < −r/2 by β = −r/2 for r ) we can only obtain the approximation order O(1/n(r − 2)/2)) for r (O(lg lgn/n(r − 2)/2)) for r ).  相似文献   

10.
The purpose of this paper is to show that for a certain class of functions f which are analytic in the complex plane possibly minus (−∞, −1], the Abel series f(0) + Σn = 1 f(n)(nβ) z(znβ)n − 1/n! is convergent for all β>0. Its sum is an entire function of exponential type and can be evaluated in terms of f. Furthermore, it is shown that the Abel series of f for small β>0 approximates f uniformly in half-planes of the form Re(z) − 1 + δ, δ>0. At the end of the paper some special cases are discussed.  相似文献   

11.
Let 0<p<∞ and 0α<β2π. We prove that for n1 and trigonometric polynomials sn of degree n, we have

cnpβα |sn(θ)|p dθ, where c is independent of α, β, n, sn. The essential feature is the uniformity in [α,β] of the estimate and the fact that as [α,β] approaches [0,2π], we recover the Lp Markov inequality. The result may be viewed as the complete Lp form of Videnskii's inequalities, improving earlier work of the second author.  相似文献   

12.
In a sequence ofn independent random variables the pdf changes fromf(x, 0) tof(x, 0 + δvn−1) after the first variables. The problem is to estimateλ (0, 1 ), where 0 and δ are unknownd-dim parameters andvn → ∞ slower thann1/2. Letn denote the maximum likelihood estimator (mle) ofλ. Analyzing the local behavior of the likelihood function near the true parameter values it is shown under regularity conditions that ifnn2(− λ) is bounded in probability asn → ∞, then it converges in law to the timeT(δjδ)1/2 at which a two-sided Brownian motion (B.M.) with drift1/2(δ′Jδ)1/2ton(−∞, ∞) attains its a.s. unique minimum, whereJ denotes the Fisher-information matrix. This generalizes the result for small change in mean of univariate normal random variables obtained by Bhattacharya and Brockwell (1976,Z. Warsch. Verw. Gebiete37, 51–75) who also derived the distribution ofTμ forμ > 0. For the general case an alternative estimator is constructed by a three-step procedure which is shown to have the above asymptotic distribution. In the important case of multiparameter exponential families, the construction of this estimator is considerably simplified.  相似文献   

13.
In this paper we consider the problem of best approximation in ℓpn, 1<p∞. If hp, 1<p<∞, denotes the best ℓp-approximation of the element h n from a proper affine subspace K of n, hK, then limp→∞hp=h*, where h* is a best uniform approximation of h from K, the so-called strict uniform approximation. Our aim is to prove that for all r there are αj n, 1jr, such that

, with γp(r) n and γp(r)= (pr−1).  相似文献   

14.
Ann-dimensional random vector is said to have anα-symmetric distribution,α>0, if its characteristic function is of the form((|u1|α+…+|un|α)1/α). We study the classesΦn(α) of all admissible functions: [0, ∞)→ . It is known that members ofΦn(2) andΦn(1) are scale mixtures of certain primitivesΩnandωn, respectively, and we show thatωnis obtained fromΩ2n−1byn−1 successive integrations. Consequently, curious relations between 1- and 2- (or spherically) symmetric distributions arise. An analogue of Askey's criterion gives a partial solution to a question of D. St. P. Richards: If(0)=1,is continuous, limt→∞ (t)=0, and(2n−2)(t) is convex, thenΦn(1). The paper closes with various criteria for the unimodality of anα-symmetric distribution.  相似文献   

15.
Tractability of Multivariate Integration for Weighted Korobov Classes   总被引:1,自引:0,他引:1  
We study the worst-case error of multivariate integration in weighted Korobov classes of periodic functions of d coordinates. This class is defined in terms of weights γj which moderate the behavior of functions with respect to successive coordinates. We study two classes of quadrature rules. They are quasi-Monte Carlo rules which use n function values and in which all quadrature weights are 1/n and rules for which all quadrature weights are non-negative. Tractability for these two classes of quadrature rules means that the minimal number of function values needed to guarantee error in the worst-case setting is bounded by a polynomial in d and −1. Strong tractability means that the bound does not depend on d and depends polynomially on −1. We prove that strong tractability holds iff ∑j=1 γj<∞, and tractability holds iff lim supd→∞dj=1 γj/log d<∞. Furthermore, strong tractability or tractability results are achieved by the relatively small class of lattice rules. We also prove that if ∑j=1 γ1/αj<∞, where α measures the decay of Fourier coefficients in the weighted Korobov class, then for d1, n prime and δ>0 there exist lattice rules that satisfy an error bound independent of d and of order nα/2+δ. This is almost the best possible result, since the order nα/2 cannot be improved upon even for d=1. A corresponding result is deduced for weighted non-periodic Sobolev spaces: if ∑j=1 γ1/2j<∞, then for d1, n prime and δ>0 there exist shifted lattice rules that satisfy an error bound independent of d and of order n−1+δ. We also check how the randomized error of the (classical) Monte Carlo algorithm depends on d for weighted Korobov classes. It turns out that Monte Carlo is strongly tractable iff ∑j=1 log γj<∞ and tractable iff lim supd→∞dj=1 log γj/log d<∞. Hence, in particular, for γj=1 we have the usual Korobov space in which integration is intractable for the two classes of quadrature rules in the worst-case setting, whereas Monte Carlo is strongly tractable in the randomized setting.  相似文献   

16.
We consider the class of doubly infinite sequences {a k } k = −∞ whose truncated sequences {a k } n k = −n are 3-times positive in the sense of Pólya and Fekete for all n = 1, 2, ..., and a 0 ≠ 0. We obtain a characterization of this class in terms of independent parameters. We also find an estimate of the growth order of the corresponding Laurent series ∑ k= −∞ akz k .  相似文献   

17.
We investigate approximation properties of Cesàro (C; −α, −β)-means of double Walsh-Fourier series with α, β ∈ (0, 1). As an application, we obtain a sufficient condition for the convergence of the means σ n,m /−α,−β (f; x, y) to f(x,y) in the L p -metric, p ∈ [1, ∞]. We also show that this sufficient condition cannot be improved.  相似文献   

18.
In this paper, the biorthogonal system corresponding to the system {e−αnx sin nx}n = 1 is represented in an appropriate form so that it is possible to obtain sufficiently good estimates of its norm. Then, by the stability of a completeness property we prove that the system of functions {e−αλnx sin λnx}n = 1 is complete.  相似文献   

19.
Let f(z) be analytic on the unit disk, and let p*(z) be the best (Chebyshev) polynomial approximation to f(z) on the disk of degree at most n. It is observed that in typical problems the “error curve,” the image of the unit circle under (fp*)(z), often approximates to a startling degree a perfect circle with winding number n + 1. This phenomenon is approached by consideration of related problems whose error curves are exactly circular, making use of a classical theorem of Carathéodory and Fejér. This leads to a technique for calculating approximations in one step that are roughly as close to best as the best approximation error curve is close to circular, and hence to strong theorems on near-circularity as the radius of the domain shrinks to 0 or as n increases to ∞. As a computational example, very tight bounds are given for approximation of ez on the unit disk. The generality of the near-circularity phenomenon (more general domains, rational approximation) is discussed.  相似文献   

20.
We consider the class of primitive stochastic n×n matrices A, whose exponent is at least (n2−2n+2)/2+2. It is known that for such an A, the associated directed graph has cycles of just two different lengths, say k and j with k>j, and that there is an α between 0 and 1 such that the characteristic polynomial of A is λn−αλnj−(1−α)λnk. In this paper, we prove that for any mn, if α1/2, then Am+kAmAm1wT, where 1 is the all-ones vector and wT is the left-Perron vector for A, normalized so that wT1=1. We also prove that if jn/2, n31 and , then Am+jAmAm1wT for all sufficiently large m. Both of these results lead to lower bounds on the rate of convergence of the sequence Am.  相似文献   

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

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