Approximation Properties of the Operators ⋎n+2r(f) and of Their Discrete Analogs

This paper is devoted to the study of the approximation properties of linear operators which are partial Fourier--Legendre sums of order n with 2r terms of the form _k=1 ^2r a_kP_n+k(x) added; here P _m(x) denotes the Legendre polynomial. Due to this addition, the linear operators interpolate functions and their derivatives at the endpoints of the closed interval [-1,1], which, in fact, for r= = 1 allows us to significantly improve the approximation properties of partial Fourier--Legendre sums. It is proved that these operators realize order-best uniform algebraic approximation of the classes of functions and A _q (B). With the aim of the computational realization of these operators, we construct their discrete analogs by means of Chebyshev polynomials, orthogonal on a uniform grid, also possessing nice approximation properties.     

On the Denseness of Rational Systems

This note characterizes the denseness of rational systems

Full-size image

in C[−1, 1], where the nonreal poles in {a_k}^∞_k=1 \[−1, 1] are paired by complex conjugation. This extends an Achiezer's result.     

Weak Copositive and Intertwining Approximation

It is known that shape preserving approximation has lower rates than unconstrained approximation. This is especially true for copositive and intertwining approximations. ForfL_p, 1p<∞, the former only has rateω(f, n⁻¹)_p, and the latter cannot even be bounded byC f_p. In this paper, we discuss various ways to relax the restrictions in these approximations and conclude that the most sensible way is the so-calledalmostcopositive/intertwining approximation in which one relaxes the restriction on the approximants in a neighborhood of radiusΔ_n(y_j) of each sign changey_j.     

Complex Zeros of Algebraic Polynomial with Non-Zero Mean Random Coefficients

In this paper we obtain a formula for the average density of the distribution of complex zeros of an algebraic polynomial with random coefficients. The coefficients are assumed independent identical normally distributed random variables with mean and variance ². The value of the average density for the case of =0 and ²=1 was obtained previously. Some limits of the distribution of the complex zeros are provided using the presented formula.     

Elements of provable high orders in finite fields

A method is given for constructing elements in whose orders are larger than any polynomial in when becomes large. As a by-product a theorem on multiplicative independence of compositions of polynomials is proved.

     

Some rapidly converging series for

For a natural number , the author derives several families of series representations for the Riemann Zeta function . Each of these series representing converges remarkably rapidly with its general term having the order estimate:

Relevant connections of the results presented here with many other known series representations for are also pointed out.

     

A Hahn-Banach theorem for integral polynomials

We study the problem of extendibility of polynomials over Banach spaces: when can a polynomial defined over a Banach space be extended to a polynomial over any larger Banach space? To this end, we identify all spaces of polynomials as the topological duals of a space spanned by evaluations, with Hausdorff locally convex topologies. We prove that all integral polynomials over a Banach space are extendible. Finally, we study the Aron-Berner extension of integral polynomials, and give an equivalence for non-containment of .

     

Irregular sampling, Toeplitz matrices, and the approximation of entire functions of exponential type

In many applications one seeks to recover an entire function of exponential type from its non-uniformly spaced samples. Whereas the mathematical theory usually addresses the question of when such a function in can be recovered, numerical methods operate with a finite-dimensional model. The numerical reconstruction or approximation of the original function amounts to the solution of a large linear system. We show that the solutions of a particularly efficient discrete model in which the data are fit by trigonometric polynomials converge to the solution of the original infinite-dimensional reconstruction problem. This legitimatizes the numerical computations and explains why the algorithms employed produce reasonable results. The main mathematical result is a new type of approximation theorem for entire functions of exponential type from a finite number of values. From another point of view our approach provides a new method for proving sampling theorems.

     

Convergence of Appell Polynomials of Long Range Dependent Moving Averages in Martingale Differences

We study limit distribution of partial sums S_N,k(t) = _{s = 1} ^{[N t]} A_k(X_s) of Appell polynomials of the long-range dependent moving average process X_t> = _{i t} b_{t - i i}, where {_i} is a strictly stationary and weakly dependent martingale difference sequence, and b_i i^{d - 1} (0 < d < 1/2). We show that if k(1-2 d)<1, then suitably normalized partial sums S_N,k(t) converge in distribution to the kth order Hermite process. This result generalizes the corresponding results of Surgailis, and Avram and Taqqu obtained in the case of the i.i.d. sequence { _i}.     

Harmoniques Sphériques et Représentations Irréductibles de O ( ∞ )

We build an irreducible unitary representation of SO( ) from the usual one of SO( n ) in the space of harmonic homogeneous polynomials of degree m of ⁿ . We give a characterization of these new representations which extends in a natural way the finite dimensional characterization. In the particular case of SO( ), we thus get some results of Olshanskii (cf. [12]). This leads to a new proof of McKean conjecture about irreducible representations of ( infin ) (cf. [10]).