Approximation Orders of FSI Spaces in L 2 (R d )

A second look at the authors' [BDR1], [BDR2] characterization of the approximation order of a Finitely generated Shift-Invariant (FSI) subspace of L ₂(R ^d ) results in a more explicit formulation entirely in terms of the (Fourier transform of the) generators of the subspace. Further, when the generators satisfy a certain technical condition, then, under the mild assumption that the set of 1-periodizations of the generators is linearly independent, such a space is shown to provide approximation order k if and only if contains a (necessarily unique) satisfying for |j|<k , . The technical condition is satisfied, e.g., when the generators are at infinity for some >k+d. In the case of compactly supported generators, this recovers an earlier result of Jia [J1], [J2]. March 19, 1996. Dates revised: September 6, 1996, March 4, 1997.     

Interpolating them-th power ofx at the zeros of then-th Chebyshev-polynomial yields an almost best Chebyshev-approximation

LetX={x ₁,x ₂,..., _n }I=[–1, 1] and . ForfC ₁(I) definef* byf–p _f =f*, wherep _f denotes the interpolation-polynomial off with respect toX. We state some properties of the operatorf f*. In particular, we treat the case whereX consists of the zeros of the Chebyshev polynomialT _n (x) and obtain x ^m –p _x ^m8eE _n–1(x ^m ), whereE _n–1(f) denotes the sup-norm distance fromf to the polynomials of degree less thann. Finally we state a lower estimate forE _n (f) that omits theassumptionf ⁽ⁿ⁺¹⁾>0 in a similar estimate of Meinardus.     

The bestL 2-approximation by finite sums of functions with separable variables

Summary We consider the problem of the best approximation of a given functionh L ² (X × Y) by sums _k=1 ⁿ f _k f _k, with a prescribed numbern of products of arbitrary functionsf _k L ² (X) andg _k L ² (Y). As a co-product we develop a new proof of the Hilbert—Schmidt decomposition theorem for functions lying inL ² (X × Y).     

The Lebesgue constant for Lagrange interpolation on equidistant nodes

Summary Forn=1, 2, 3, ..., let _n denote the Lebesgue constant for Lagrange interpolation based on the equidistant nodesx _{k, n} =k, k=0, 1, 2, ...,n. In this paper an asymptotic expansion for log _n is obtained, thereby improving a result of A. Schönhage.     

Piecewise Monotone Pointwise Approximation

Let r, k, s be three integers such that , or We prove the following: Proposition. Let Y:={y _i } _i=1 ^s be a fixed collection of distinct points y _i ∈ (-1,1) and Π (x):= (x-y ₁ ). ... .(x-y _s ). Let I:=[-1,1]. If f ∈ C ^(r) (I) and f'(x)Π(x) ≥ 0, x ∈ I, then for each integer n ≥ k+r-1 there is an algebraic polynomial P _n =P _n (x) of degree ≤ n such that P _n '(x) Π (x) ≥ 0 and $$ \vert f(x)-P_n(x) \vert \le B\left(\frac{1}{n^2}+\frac{1}{n}\sqrt{1-x^2}\right)^r \omega_k \left(f^{(r)};\frac{1}{n^2}+\frac{1}{n}\sqrt{1-x^2}\right) \legno{(1)}$$ for all x∈ I, where ω _k (f ^(r) ;t) is the modulus of smoothness of the k -th order of the function f ^(r) and B is a constant depending only on r , k , and Y. If s=1, the constant B does not depend on Y except in the case (r=1, k=3). In addition it is shown that (1) does not hold for r=1, k>3. March 20, 1995. Dates revised: March 11, 1996; December 20, 1996; and August 7, 1997.     

A discrepancy theorem concerning polynomials of best approximation inL w p [−1, 1]

Letw be a suitable weight function,B _n,p denote the polynomial of best approximation to a functionf inL _w ^p [–1, 1],v _n be the measure that associates a mass of 1/(n+1) with each of then+1 zeros ofB _n+1,p–B _n,p and be the arcsine measure defined by . We estimate the rate at which the sequencev _n converges to in the weak-^* topology. In particular, our theorem applies to the zeros of monic polynomials of minimalL _w ^p norm.This author gratefully acknowledges partial support from NSA contract #A4235802 during 1992, AFSOR Grant 226113 during 1993 and The Alexander von Humboldt Foundation during both of these years.     

Approximation Orders of FSI Spaces in L 2 (R d )

A second look at the authors' [BDR1], [BDR2] characterization of the approximation order of a Finitely generated Shift-Invariant subspace S(Φ) of L ₂ (R ^d ) results in a more explicit formulation entirely in terms of the (Fourier transform of the) generators of the subspace. Further, when the generators satisfy a certain technical condition, then, under the mild assumption that the set of 1-periodizations of the generators is linearly independent, such a space is shown to provide approximation order k if and only if contains a ψ (necessarily unique) satisfying . The technical condition is satisfied, e.g., when the generators are at infinity for some ρ>k+d . In the case of compactly supported generators, this recovers an earlier result of Jia [J1], [J2]. March 19. 1996. Date revised: September 6, 1996.     

On construction ofk-wise independent random variables

A 0–1probability space is a probability space (, 2,P), where the sample space -{0, 1} ⁿ for somen. A probability space isk-wise independent if, whenY _i is defined to be theith coordinate or the randomn-vector, then any subset ofk of theY _i 's is (mutually) independent, and it is said to be a probability spacefor p ₁,p ₂, ...,p _n ifP[Y _i =1]=p _i .We study constructions ofk-wise independent 0–1 probability spaces in which thep _i 's are arbitrary. It was known that for anyp ₁,p ₂, ...,p _n , ak-wise independent probability space of size always exists. We prove that for somep ₁,p ₂, ...,p _n [0,1],m(n,k) is a lower bound on the size of anyk-wise independent 0–1 probability space. For each fixedk, we prove that everyk-wise independent 0–1 probability space when eachp _i =k/n has size (n _k ). For a very large degree of independence —k=[n], for >1/2- and allp _i =1/2, we prove a lower bound on the size of . We also give explicit constructions ofk-wise independent 0–1 probability spaces.This author was supported in part by NSF grant CCR 9107349.This research was supported in part by the Israel Science Foundation administered by the lsrael Academy of Science and Humanities and by a grant of the Israeli Ministry of Science and Technology.     

On the Degree of Approximation by Manifolds of Finite Pseudo-Dimension

The pseudo-dimension of a real-valued function class is an extension of the VC dimension for set-indicator function classes. A class of finite pseudo-dimension possesses a useful statistical smoothness property. In [10] we introduced a nonlinear approximation width = which measures the worst-case approximation error over all functions by the best manifold of pseudo-dimension n . In this paper we obtain tight upper and lower bounds on ρ _n (W ^r,d _p , L _q ) , both being a constant factor of n ^-r/d , for a Sobolev class W ^r,d _p , . As this is also the estimate of the classical Alexandrov nonlinear n -width, our result proves that approximation of W ^r,d _p by the family of manifolds of pseudo-dimension n is as powerful as approximation by the family of all nonlinear manifolds with continuous selection operators. March 12, 1997. Dates revised: August 26, 1997, October 24, 1997, March 16, 1998, June 15, 1998. Date accepted: June 25, 1998.     

Expectation of random polytopes

A random polytopeP _n in a convex bodyC is the convex hull ofn identically and independently distributed points inC. Its expectation is a convex body in the interior ofC. We study the deviation of the expectation ofP _n fromC asn→∞: while forC of classC ^k+1,k≥1, precise asymptotic expansions for the deviation exist, the behaviour of the deviation is extremely irregular for most convex bodiesC of classC ¹. Dedicated to my teacher and friend Professor Edmund Hlawka on the occasion of his 80^th birthday     

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     

Padé approximations to certain power series

Summary An explicit identity involvingQ _n (q ⁱ z) (i = 0, 1,, 4) is shown, whereQ _n (z) is the denominator of thenth Padé approximant to the functionf(z) = _k=0 q ^1/2k(k–1 Z ^k . By using the Padé approximations, irrationality measures for certain values off(z) are also given.

     

Approximation by Faber-Laurent rational functions in the mean of functions of callsL p(Γ) with 1

Çavu§  A.  Israfilov  D. M. 《分析论及其应用》1995,11(1):105-118

Regarding thep-norms of radial basis interpolation matrices

A radial basis function approximation has the form where:R ^d R is some given (usually radially symmetric) function, (y _j ) ₁ ⁿ are real coefficients, and the centers (x _j ) ₁ ⁿ are points inR ^d . For a wide class of functions , it is known that the interpolation matrixA=((x _j –x _k )) _j,k=1 ⁿ is invertible. Further, several recent papers have provided upper bounds on ||A ^–1||₂, where the points (x _j ) ₁ ⁿ satisfy the condition ||x _j –x _k ||₂,jk, for some positive constant . In this paper we calculate similar upper bounds on ||A ^–1||₂ forp1 which apply when decays sufficiently quickly andA is symmetric and positive definite. We include an application of this analysis to a preconditioning of the interpolation matrixA _n = ((j–k)) _j,k=1 ⁿ when (x)=(x ²+c ²)^1/2, the Hardy multiquadric. In particular, we show that sup _n ||A _n ^–1 || is finite. Furthermore, we find that the bi-infinite symmetric Toeplitz matrix enjoys the remarkable property that ||E ^–1|| _p = ||E ^–1||₂ for everyp1 when is a Gaussian. Indeed, we also show that this property persists for any function which is a tensor product of even, absolutely integrable Pólya frequency functions.Communicated by Charles Micchelli.     

The number of connected sparsely edged graphs. IV large nonseparable graphs

The number of nonseparable graphs on n labeled points and q lines is u(n, q). In the second paper of this series an exact formula for u(n, n + k) was found for general n and successive (small) k. The method would give an asymptotic approximation for fixed k as n → ∞. Here an asymptotic approximation to u(n, n + k) is found when k = O(n^1/2) and an approximation to logu(n, n + k) when k < (1 - ?)(1/3 n)1/2. The problem of finding an approximation to u(n, q) when (q - n)/n1/2 → + → and q/n - 1/2 logn - 1/2 log logn → - ∞ is open.     

The number of connected sparsely edged graphs. III. Asymptotic results

The number of connected graphs on n labeled points and q lines (no loops, no multiple lines) is f(n,q). In the first paper of this series I showed how to find an (increasingly complicated) exact formula for f(n,n+k) for general n and successive k. The method would give an asymptotic approximation to f(n,n+k) for any fixed k as n → ∞. Here I find this approximation when k = o(n^1/3), a much more difficult matter. The problem of finding an approximation to f(n,q) when q > n + Cn^1/3 and (2 q/n) - log n → - ∞ is open.     

Finite and p-adic Polylogarithms

The finite nth polylogarithm li _n (z) /p(z) is defined as _k=1 ^p–1 z ^k /k ⁿ . We state and prove the following theorem. Let Li _k : _{p p} be the p-adic polylogarithms defined by Coleman. Then a certain linear combination F _n of products of polylogarithms and logarithms, with coefficients which are independent of p, has the property that p ^1–n DF _n (z) reduces modulo p>n+1 to li _n–1((z)), where D is the Cathelineau operator z(1–z)d/dz and is the inverse of the p-power map. A slightly modified version of this theorem was conjectured by Kontsevich. This theorem is used by Elbaz-Vincent and Gangl to deduce functional equations of finite polylogarithms from those of complex polylogarithms.     

The Central Approximation Theorems for the Method of Left Gamma Quasi-Interpolants in L p spaces

The optimal degree of approximation of the method of Gammaoperators G _n in L _p spaces is O(n ^-1). In order to obtain much faster convergence, quasi-interpolants G _n ^(k) of G _n in the sense of Sablonnière are considered. We show that for fixed k the operator-norms G _n ^(k) _p are uniformly bounded in n. In addition to this, for the first time in the theory of quasi-interpolants, all central problems for approximation methods (direct theorem, inverse theorem, equivalence theorem) could be solved completely for the L _p metric. Left Gamma quasi-interpolants turn out to be as powerful as linear combinations of Gammaoperators [6].     

Bivariate hermite interpolation and applications to Algebraic Geometry

Summary We try to solve the bivariate interpolation problem (1.3) for polynomials (1.1), whereS is a lower set of lattice points, and for theq-th interpolation knot,A _q is the set of orders of derivatives that appear in (1.3). The number of coefficients |S| is equal to the number of equations |A _q |. If this is possible for all knots in general position, the problem is almost always solvable (=a.a.s.). We seek to determine whether (1.3) is a.a.s. An algorithm is given which often gives a positive answer to this. It can be applied to the solution of a problem of Hirschowitz in Algebraic Geometry. We prove that for Hermite conditions (1.3) (when allA _q are lower triangles of orderp) andP is of total degreen, (1.3) is a.a.s. for allp=1, 2, 3 and alln, except for the two casesp=1,n=2 andp=1,n=4.Dedicated to R. S. Varga on the occasion of his sixtieth birthdayThis work has been partly supported by the Texas ARP and the Deutsche Forschungsgemeinschaft     

Comportement moyen du cardinal de certains ensembles de facteurs premiers

Letn be a positive integer andS _n a particular set of prime divisors ofn. We establish the average order off(n) wheref(n) stands for the cardinality ofS _n . Thek-ary,k-free, semi-k-ary prime factors ofn are some of the classes of prime divisors studied in this paper.