Weighted simultaneous Chebyshev approximation

In this paper we discuss the problem of weighted simultaneous Chebyshev approximation to functions f₁,…f_m ε C(X) (1 m ∞), i.e., we wish to minimize the expression {∑^m_{j = 1} λ_j¦f_j − q¦^p}^1/p∞, where λ_j > 0, ∑^m_{j = 1} λ_j = 1, p 1. For this problem we establish the main theorems of the Chebyshev theory, which include the theorems of existence, alternation, de La Vallée Poussin, uniqueness, strong uniqueness, as well as that of continuity of the best approximation operator, etc.     

On almost sure convergence of Cesaro averages of subsequences of vector-valued functions

A remarkable theorem proved by Komlòs [4] states that if {f_n} is a bounded sequence in L¹(R), then there exists a subsequence {f_nk} and f L¹(R) such that f_nk (as well as any further subsequence) converges Cesaro to f almost everywhere. A similar theorem due to Révész [6] states that if {f_n} is a bounded sequence in L²(R), then there is a subsequence {f_nk} and f L²(R) such that Σ_k=1^∞ a_k(f_nk − f) converges a.e. whenever Σ_k=1^∞ | a_k |² < ∞. In this paper, we generalize these two theorems to functions with values in a Hilbert space (Theorems 3.1 and 3.3).     

On an infinite series of Abel occurring in the theory of interpolation

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β) z(z − nβ)^{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.     

Convergence of greedy approximation for the trigonometric system

Summary We study the following nonlinear method of approximation by trigonometric polynomials in this paper. For a periodic function f we take as an approximant a trigonometric polynomial of the form G_m(f ) := ∑_kЄΛ f^(k) e ^{(i k,x)}, where ΛˆZ^d is a set of cardinality m containing the indices of the m biggest (in absolute value) Fourier coefficients f^ (k) of function f . Note that G_m(f ) gives the best m-term approximant in the L₂-norm and, therefore, for each f ЄL₂, ║f-G_m(f )║₂→0 as m →∞. It is known from previous results that in the case of p ≠2 the condition f ЄL_p does not guarantee the convergence ║f-G_m(f )║_p→0 as m →∞.. We study the following question. What conditions (in addition to f ЄL_p) provide the convergence ║f-G_m(f )║_p→0 as m →∞? In our previous paper [10] in the case 2< p ≤∞ we have found necessary and sufficient conditions on a decreasing sequence {A_n}_n=1^∞ to guarantee the L_p-convergence of {G_m(f )} for all f ЄL_p , satisfying a_n (f ) ≤A_n , where {a_n (f )} is a decreasing rearrangement of absolute values of the Fourier coefficients of f. In this paper we are looking for necessary and sufficient conditions on a sequence {M (m)} such that the conditions f ЄL_p and ║G_M(m)(f ) - G_m(f )║_p →0 as m →∞ imply ║f - G_m(f )║_p →0 as m →∞. We have found these conditions in the case when p is an even number or p = ∞.     

A recursive algorithm for the infinity-norm fixed point problem

We present the PFix algorithm for the fixed point problem f(x)=x on a nonempty domain [a,b], where d1, , and f is a Lipschitz continuous function with respect to the infinity norm, with constant q1. The computed approximation satisfies the residual criterion , where >0. In general, the algorithm requires no more than ∑_i=1^dsⁱ function component evaluations, where s≡max(1,log₂(||b−a||_∞/))+1. This upper bound has order as →0. For the domain [0,1]^d with <0.5 we prove a stronger result, i.e., an upper bound on the number of function component evaluations is , where r≡log₂(1/). This bound approaches as r→∞ (→0) and as d→∞. We show that when q<1 the algorithm can also compute an approximation satisfying the absolute criterion , where x^* is the unique fixed point of f. The complexity in this case resembles the complexity of the residual criterion problem, but with tolerance (1−q) instead of . We show that when q>1 the absolute criterion problem has infinite worst-case complexity when information consists of function evaluations. Finally, we report several numerical tests in which the actual number of evaluations is usually much smaller than the upper complexity bound.     

On the L convergence of Lagrange interpolating entire functions of exponential type

Let f: be a continuous, 2π-periodic function and for each n ε let t_n(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 lim_{n → ∞} ∝₀^2π¦f(θ) − t_n(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.     

On Positive and Copositive Polynomial and Spline Approximation inLp[−1, 1], 0<p<∞

For a functionfL_p[−1, 1], 0<p<∞, with finitely many sign changes, we construct a sequence of polynomialsP_nΠ_nwhich are copositive withfand such that f−P_npCω(f, (n+1)⁻¹)_p, whereω(f, t)_pdenotes the Ditzian–Totik modulus of continuity inL_pmetric. 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ω²if 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.     

An explicit extension formula of bounded holomorphic functions from analytic varieties to strictly convex domains

We consider a strictly convex domain D ⁿ and m holomorphic functions, φ₁,…, φ_m, in a domain . We set V = {z ε Ω: φ₁(z) = ··· = φ_m(z) = 0}, M = V ∩ D and ∂M = V ∩ ∂D. Under the assumptions that the variety V has no singular point on ∂M and that V meets ∂D transversally we construct an explicit kernel K(ζ, z) defined for ζ ε ∂M and z ε D so that the integral operator Ef(z) = ∝ _{ζ ε ∂M} f(ζ) K(ζ, z) (z ε D), defined for f ε H^∞(M) (using the boundary values f(ζ) for a.e. ζ ε ∂M), is an extension operator, i.e., Ef(z) = f(z) for z ε M and furthermore E is a bounded operator from H^∞ to H^∞(D).     

Coboundaries in

Let T be an ergodic automorphism of a probability space, f a bounded measurable function, . It is shown that the property that the probabilities μ(|S_n(f)|>n) are of order n^−p roughly corresponds to the existence of an approximation in L^∞ of f by functions (coboundaries) g−g○T, gL^p. Similarly, the probabilities μ(|S_n(f)|>n) are exponentially small iff f can be approximated by coboundaries g−g○T 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 μ(|S_n(f)|>n) d'ordre n^−p et l'existence de l'approximation dans L^∞ de la fonction f par des cobords g−g○T où g est “presque” dans L^p. De manière similaire, les probabilités μ(|S_n(f)|>n) sont d'ordre e^−cn, pour un certain c>0, n=1,2… , si et seulement si f admet une approximation dans L^∞ par des cobords g−g○T avec g ayant des moments exponentiels.     

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

Rate of Convergence of Positive Series

We investigate the rate of convergence of series of the form

Error bounds for multidimensional Laplace approximation

A numerical estimate is obtained for the error associated with the Laplace approximation of the double integral I(λ) = ∝∝_D g(x,y) e^−λf(x,y) dx dy, where D is a domain in , λ is a large positive parameter, f(x, y) and g(x, y) are real-valued and sufficiently smooth, and ∝(x, y) has an absolute minimum in D. The use of the estimate is illustrated by applying it to two realistic examples. The method used here applies also to higher dimensional integrals.     

On the Uniform Approximation of a Class of Analytic Functions by Bruwier Series

For a class of analytic functions f(z) defined by Laplace–Stieltjes integrals the uniform convergence on compact subsets of the complex plane of the Bruwier series (B-series) ∑^∞_n=0 λ_n(f) , λ_n(f)=f⁽ⁿ⁾(nc)+cf⁽ⁿ⁺¹⁾(nc), generated by f(z) and the uniform approximation of the generating function f(z) by its B-series in cones |arg z|< is shown.     

Interpretation of the Lavrentiev phenomenon by relaxation

We consider functionals of the calculus of variations of the form F(u)= ∝₀¹ f(x, u, u′) dx defined for u ε W^1,∞(0, 1), and we show that the relaxed functional with respect to weak W^1,1(0, 1) convergence can be written as

Full-size image

, where the additional term L(u), called the Lavrentiev term, is explicitly identified in terms of F.     

On Hilbert''s Integral Inequality

In this paper, we generalize Hilbert's integral inequality and its equivalent form by introducing three parameterst,a, andb.Iff, g L²[0, ∞), then[formula]where π is the best value. The inequality (1) is well known as Hilbert's integral inequality, and its equivalent form is[formula]where π²is also the best value (cf. [[1], Chap. 9]). Recently, Hu Ke made the following improvement of (1) by introducing a real functionc(x),[formula]wherek(x) = 2/π∫^∞₀(c(t²x)/(1 + t²)) dt − c(x), 1 − c(x) + c(y) ≥ 0, andf, g ≥ 0 (cf. [[2]]). In this paper, some generalizations of (1) and (2) are given in the following theorems, which are other than those in [ [2]].     

On a Polynomial Inequality of Paul Erd s

Let f be a real polynomial having no zeros in the open unit disk. We prove a sharp evaluation from above for the quantity f′_∞/f_p, 0p<∞. The extremal polynomials and the exact constants are given. This extends an inequality of Paul Erd s [7].     

Rates of Best Rational Approximation of Analytic Functions

Let E be a compact set in the extended complex plane C and let f be holomorphic on E. Denote by ρ_n the distance from f to the class of all rational functions of order at most n, measured with respect to the uniform norm on E. We obtain results characterizing the relationship between estimates of lim inf_n→∞ ρ^1/n_n and lim sup_n→∞ ρ^1/n_n.     

Multivariate approximation in the worst case setting over reproducing kernel Hilbert spaces

We study the worst case setting for approximation of d variate functions from a general reproducing kernel Hilbert space with the error measured in the L_∞ norm. We mainly consider algorithms that use n arbitrary continuous linear functionals. We look for algorithms with the minimal worst case errors and for their rates of convergence as n goes to infinity. Algorithms using n function values will be analyzed in a forthcoming paper.We show that the L_∞ approximation problem in the worst case setting is related to the weighted L₂ approximation problem in the average case setting with respect to a zero-mean Gaussian stochastic process whose covariance function is the same as the reproducing kernel of the Hilbert space. This relation enables us to find optimal algorithms and their rates of convergence for the weighted Korobov space with an arbitrary smoothness parameter α>1, and for the weighted Sobolev space whose reproducing kernel corresponds to the Wiener sheet measure. The optimal convergence rates are n^-(α-1)/2 and n^-1/2, respectively.We also study tractability of L_∞ approximation for the absolute and normalized error criteria, i.e., how the minimal worst case errors depend on the number of variables, d, especially when d is arbitrarily large. We provide necessary and sufficient conditions on tractability of L_∞ approximation in terms of tractability conditions of the weighted L₂ approximation in the average case setting. In particular, tractability holds in weighted Korobov and Sobolev spaces only for weights tending sufficiently fast to zero and does not hold for the classical unweighted spaces.     

A note on differential operators of infinite order

A sufficient condition for entire functions f and g to be such that the series ∑_m=0^∞f^(m)(0)g^(m)/m! represents an entire function is established; and in that case, the growth of the resulting function is described.