Constrained Lp-Approximation by Generalized n-Convex Functions Induced by ECT-Systems

The problem of finding a best L_p-approximation (1 ≤ p < ∞) to a function in L_p from a special subcone of generalized n-convex functions induced by an ECT-system is considered. Tchebycheff splines with a countably infinite number of knots are introduced and best approximations are characterized in terms of local best approximations by these splines. Various properties of best approximations and their uniqueness in L₁ are investigated. Some special results for generalized monotone and convex cases are obtained.     

Near-best multivariate approximation by Fourier series, Chebyshev series and Chebyshev interpolation

A set of results concerning goodness of approximation and convergence in norm is given for L_∞ and L₁ approximation of multivariate functions on hypercubes. Firstly the trigonometric polynomial formed by taking a partial sum of a multivariate Fourier series and the algebraic polynomials formed either by taking a partial sum of a multivariate Chebyshev series of the first kind or by interpolating at a tensor product of Chebyshev polynomial zeros are all shown to be near-best L_∞ approximations. Secondly the trigonometric and algebraic polynomials formed by taking, respectively, a partial sum of a multivariate Fourier series and a partial sum of a multivariate Chebyshev series of the second kind are both shown to be hear-best L₁ approximations. In all the cases considered, the relative distance of a near-best approximation from a corresponding best approximation is shown to be at most of the order of Π log n_j, where n_j (j = 1, 2,…, N) are the respective degrees of approximation in the N individual variables. Moreover, convergence in the relevant norm is established for all the sequences of near-best approximations under consideration, subject to appropriate restrictions on the function space.     

Approximation with sums of exponentials in Lp[0, ∞)

We consider the problem of approximating a given f from L_p [0, ∞) by means of the family V_n(S) of exponential sums; V_n(S) denotes the set of all possible solutions of all possible nth order linear homogeneous differential equations with constant coefficients for which the roots of the corresponding characteristic polynomials all lie in the set S. We establish the existence of best approximations, show that the distance from a given f to V_n(S) decreases to zero as n becomes infinite, and characterize such best approximations with a first-order necessary condition. In so doing we extend previously known results that apply in L_p[0, 1].     

Best simultaneous L1 approximations

Three possible definitions are proposed for best simultaneous L₁ approximation to n continuous real-valued functions, and the relation between best simultaneous approximations and best L₁ approximations to the arithmetic mean of the n functions is discussed.     

Interpolatory properties of best L2-approximants

Let ƒbe a continuous function and s_n be the polynomial of degree at mostn of best L₂(μ)-approximation to ƒon [-1,1]. Let Z_n(ƒ):=\s{xε[-1,1]:ƒ(x)−s_n(x) = 0\s}. Under mild conditions on the measure μ, we prove that Z_n(ƒ) is dense in [-1,1]. This answers a question posed independently by A. Kroó and V. Tikhomiroff. It also provides an analogue of the results of Kadec and Tashev (for L∞) and Kroó and Peherstorfer (for L₁) for least squares approximation.     

The Fine Structure of the n-Widths of H-Spaces in Lq(−1, 1)

The n-widths of the unit ball A_p of the Hardy space H^p in L_q( −1, 1) are determined asymptotically. It is shown that for 1 ≤ q < p ≤∞ there exist constants k₁ and k₂ such that [formula]≤ d_n(A_p, L_q(−1, 1)),dⁿ(A_p, L_q(−1, 1)), δ_n(A_p, L_q(−1, 1))[formula]where d_n, dⁿ, and δ_n denote the Kolmogorov, Gel′fand and linear n-widths, respectively. This result is an improvement of estimates previously obtained by Burchard and Höllig and by the author.     

Convergence rate of Fourier–Laplace series of L-functions

The almost everywhere convergence rates of Fourier–Laplace series are given for functions in certain subclasses of L²(Σ_n−1) defined in terms of moduli of continuity.     

Best polynomial and durrmeyer approximation in Lp(S)

On a simplex SR^d, the best polynomial approximation is E_n()_Lp(S)=Inf{P_n−_Lp(S): P_n of total degree n}. The Durrmeyer modification, M_n, of the Bernstein operator is a bounded operator on L_p(S) and has many “nice” properties, most notably commutativity and self-adjointness. In this paper, relations between M_n−z.dfnc;_Lp(S) and E_[√n]()_Lp(S) will be given by weak inequalities will imply, for 0<α<1 and 1≤p≤∞, E_n()_Lp(S)=O(n^-2α)M_n−z.dfnc;_Lp(S)=O(n^-α). We also see how the fact that P(D)εL_p(S) for the appropriate P(D) affects directional smoothness.     

Minimal Lp projections by Fourier, Taylor, and Laurent series

In appropriate function space settings, it is proved that the Fourier, Taylor, and Laurent series projections are minimal in all L_p norms (1 p ∞). This result unifies and extends known results for the Fourier, Taylor, and Laurent projections in L_∞ and for the Fourier projection in L₁. The proof is based on a generalisation of a kernel summation formula due to Berman.     

Polynomial Projections inC[−1, 1] andL(−1, 1) with Growthn, 0<γ1/2

Forγ(0, 1/2] we constructn-dimensional polynomial subspacesY_nofC[−1, 1] andL¹(−1, 1) such that the relative projection constantsλ(Y_n, C[−1, 1]) andλ(Y_n, L¹(−1, 1)) grow asn^γ. These subspaces are spanned by Chebyshev polynomials of the first and second kind, respectively. The spacesL¹_{w(α, β}wherew_{α, β}is the weight function of the Jacobi polynomials and (α, β){(−1/2, −1/2), (−1/2, 0), (0, −1/2)} are also studied.     

Average CaseL∞-Approximation in the Presence of Gaussian Noise

We consider the average caseL_∞-approximation of functions fromC^r([0, 1]) with respect to ther-fold Wiener measure. An approximation is based onnfunction evaluations in the presence of Gaussian noise with varianceσ²>0. We show that the n th minimal average error is of ordern^{−(2r+1)/(4r+4)} ln^1/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 forL_q-approximation withq<∞ andσ0, and forL_∞-approximation withσ=0.     

Lp Markov–Bernstein Inequalities on All Arcs of the Circle

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

Full-size image

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

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.     

Isotonic Approximation in L1

Let (Ω, ,P) be a measurable space and a sub-σ-lattice of the σ-algebra . For XL₁(Ω, ,P) we denote by P X the set of conditional 1-mean (or best approximants) of X given L₁( ) (the set of all -measurable and integrable functions). In this paper, we obtain characterizations of the elements in P X, similar to those obtained by Landers and Rogge for conditional s-means with 1<s<∞. Moreover, using these characterizations we can extend the operator P to a bigger space L₀(Ω, ,P). When, in certain sense, _n goes to _∞, we will be able to prove theorems about convergence and we will obtain bounds for the maximal function sup_nP _nX. A sharper characterization of conditional 1-means for certain particular σ-lattice was proved in previous papers. In the last section of this paper we generalize those results to all totally ordered σ-lattices.     

L1-optimal estimates for a regression type function in R

Let X₁, X₂, …, X_n be random vectors that take values in a compact set in R^d, d ≥ 1. Let Y₁, Y₂, …, Y_n be random variables (“the responses”) which conditionally on X₁ = x₁, …, X_n = x_n are independent with densities f(y | x_i, θ(x_i)), i = 1, …, n. Assuming that θ lives in a sup-norm compact space Θ_q,d of real valued functions, an optimal L₁-consistent estimator of θ is constructed via empirical measures. The rate of convergence of the estimator to the true parameter θ depends on Kolmogorov's entropy of Θ_q,d.     

A class of functions having the same best approximation for all Lp norms (1≦P≦∞)

This paper gives a class of functions having the excellent property that L_{p, n} f=S_nf for all n and all p,1≤p≤∞, L_{p, n}f and S_nf being the best approximations to f in the L_p norm with weight w_p and the partial sum of the orthogonal expansion of f, respectively. Supported by National Naturol Science Fundation of China     

Laurent–Padé Approximants to Four Kinds of Chebyshev Polynomial Expansions. Part II: Clenshaw–Lord Type Approximants

Laurent–Padé (Chebyshev) rational approximants P _m (w,w ^–1)/Q _n (w,w ^–1) of Clenshaw–Lord type [2,1] are defined, such that the Laurent series of P _m /Q _n matches that of a given function f(w,w ^–1) up to terms of order w ^±(m+n), based only on knowledge of the Laurent series coefficients of f up to terms in w ^±(m+n). This contrasts with the Maehly-type approximants [4,5] defined and computed in part I of this paper [6], where the Laurent series of P _m matches that of Q _n f up to terms of order w ^±(m+n), but based on knowledge of the series coefficients of f up to terms in w ^±(m+2n). The Clenshaw–Lord method is here extended to be applicable to Chebyshev polynomials of the 1st, 2nd, 3rd and 4th kinds and corresponding rational approximants and Laurent series, and efficient systems of linear equations for the determination of the Padé–Chebyshev coefficients are obtained in each case. Using the Laurent approach of Gragg and Johnson [4], approximations are obtainable for all m0, n0. Numerical results are obtained for all four kinds of Chebyshev polynomials and Padé–Chebyshev approximants. Remarkably similar results of formidable accuracy are obtained by both Maehly-type and Clenshaw–Lord type methods, thus validating the use of either.     

Discrete time parametric models with long memory and infinite variance

We study a large class of infinite variance time series that display long memory. They can be represented as linear processes (infinite order moving averages) with coefficients that decay slowly to zero and with innovations that are in the domain of attraction of a stable distribution with index 1 < α < 2 (stable fractional ARIMA is a particular example). Assume that the coefficients of the linear process depend on an unknown parameter vector β which is to be estimated from a series of length n. We show that a Whittle-type estimator β_n for β is consistent (β_n converges to the true value β₀ in probability as n → ∞), and, under some additional conditions, we characterize the limiting distribution of the rescaled differences (n/logn)^1/ga(β_n − β₀).     

Distributions of class Lα

L_α (0 α 1) is a class of infinitely divisible distributions defined by restricting the measure in the Levy-Khinchin formula to a special form. When α = 1, L_α is just the classical class L. Several properties for L_α classes, which are similar to the most important properties for the class L, are established. Also, a conjecture of Wolfe about unimodality of some L_α distributions is disproved by giving a counterexample.     

Approximation ofk-Monotone Functions

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 inL_p, 0<p<1, metric, and also show that the rate of the best algebraic approximation ofk-monotone functions (with bounded (k−2)nd derivatives inL_p, 1<p<∞, iso(n^−k/p).