Approximation ofMH q r -class functions by Haar polynomials

The paper deals with approximations of functions with bounded mixed difference by Haar polynomials. Approximations of the following two different types are studied: the classical best approximation by Haar polynomials with indices lying in hyperbolic crosses and the bestm-term approximation by Haar polynomials. Translated fromMatematicheskie Zametki, Vol. 66, No. 3, pp. 323–335, September, 1999.     

Approximation of polynomials in the Haar system in weighted symmetric spaces

For weighted symmetric (or rearrangement-invariant) spaces with nontrivial Boyd indices and weights from suitable Muckenhoupt classes, the basis property of the Haar system in these spaces and two versions of the direct theorem on the approximation by polynomials in the Haar system are established.     

Approximation of functions of bounded p-variation by means of polynomials of the Haar and Walsh systems

Translated from Matematicheskie Zametki, Vol. 53, No. 6, pp. 11–21, June, 1993.     

Approximation by Chlodowsky-Taylor polynomials

The subject of this paper is to study the problem of the approximation of function of two variables by means of Chlodowsky-Taylor polynomials in a rectangular domain.     

Approximation of Haar distributed matrices and limiting distributions of eigenvalues of Jacobi ensembles

We develop a tool to approximate the entries of a large dimensional complex Jacobi ensemble with independent complex Gaussian random variables. Based on this and the author’s earlier work in this direction, we obtain the Tracy–Widom law of the largest singular values of the Jacobi emsemble. Moreover, the circular law, the Marchenko–Pastur law, the central limit theorem, and the laws of large numbers for the spectral norms are also obtained.     

Approximation by non-negative algebraic polynomials

Theorem 1 gives an estimate for the approximation of a continuous functionf by polynomials resulting from the convolution off with non-negative algebraic polynomialsp _n . Jackson's theorem can be deduced from it by choosing a particularp _n whose second Chebyshev-Fourier coefficient is sufficiently close to –1.Work supported in part by the Atomic Energy Commission under contract U.S. AEC AT (11-1) 1469, and in part by the National Science Foundation under grant NSF-GJ-812.     

Haar intervals for trigonometric polynomials

Intervals are specified on which generalized trigonometric polynomials satisfy the Haar condition.     

Approximation by polynomials with small coefficients

Translated from Matematicheskie Zametki, Vol. 57, No. 1, pp. 150–153, January, 1995.     

Approximation by polynomials with bounded coefficients

Let θ be a real number satisfying 1<θ<2, and let A(θ) be the set of polynomials with coefficients in {0,1}, evaluated at θ. Using a result of Bugeaud, we prove by elementary methods that θ is a Pisot number when the set (A(θ)−A(θ)−A(θ)) is discrete; the problem whether Pisot numbers are the only numbers θ such that 0 is not a limit point of (A(θ)−A(θ)) is still unsolved. We also determine the three greatest limit points of the quantities , where C(θ) is the set of polynomials with coefficients in {−1,1}, evaluated at θ, and we find in particular infinitely many Perron numbers θ such that the sets C(θ) are discrete.     

Approximation of high-dimensional kernel matrices by multilevel circulant matrices

Kernels are important in developing a variety of numerical methods, such as approximation, interpolation, neural networks, machine learning and meshless methods for solving engineering problems. A common problem of these kernel-based methods is to calculate inverses of kernel matrices generated by a kernel function and a set of points. Due to the denseness of these matrices, finding their inverses is computationally costly. To overcome this difficulty, we introduce in this paper an approximation of the kernel matrices by appropriate multilevel circulant matrices so that the fast Fourier transform can be applied to reduce the computational cost. Convergence analysis for the proposed approximation is established based on certain decay properties of the kernels.     

Approximation of bandlimited functions by trigonometric polynomials

Let σ > 0. For 1 ≦ p ≦ ∞, the Bernstein space B _σ ^p is a Banach space of all f ∈ L ^p (?) such that f is bandlimited to σ; that is, the distributional Fourier transform of f is supported in [?σ,σ]. We study the approximation of f ∈ B _σ ^p by finite trigonometric sums $$ P_\tau (x) = \chi _\tau (x) \cdot \sum\limits_{|k| \leqq \sigma \tau /\pi } {c_{k,\tau } e^{i\frac{\pi } {\tau }kx} } $$ in L ^p norm on ? as τ → ∞, where χ _τ denotes the indicator function of [?τ, τ].     

渐近于Hermite多项式的双正交系统

本文利用渐近于Gauss函数的函数类?,给出渐近于Hermite正交多项式的一类Appell多项式的构造方法,使得该序列与?的n阶导数之间构成了一组双正交系统.利用此结果,本文得到多种正交多项式和组合多项式的渐近性质.特别地,由N阶B样条所生成的Appell多项式序列恰为N阶Bernoulli多项式.从而,Bernoulli多项式与B样条的导函数之间构成了一组双正交系统,且标准化之后的Bernoulli多项式的渐近形式为Hermite多项式.由二项分布所生成的Appell序列为Euler多项式,从而,Euler多项式与二项分布的导函数之间构成一组双正交系统,且标准化之后的Euler多项式渐近于Hermite多项式.本文给出Appell序列的生成函数满足的尺度方程的充要条件,给出渐近于Hermite多项式的函数列的判定定理.应用该定理,验证广义Buchholz多项式、广义Laguerre多项式和广义Ultraspherical(Gegenbauer)多项式渐近于Hermite多项式的性质,从而验证超几何多项式的Askey格式的成立.     

Approximation of monomials by lower degree polynomials

Our topic is the uniform approximation ofx ^k by polynomials of degreen (n on the interval [–1, 1]. Our major result indicates that good approximation is possible whenk is much smaller thann ² and not possible otherwise. Indeed, we show that the approximation error is of the exact order of magnitude of a quantity,p _k,n , which can be identified with a certain probability. The numberp _k,n is in fact the probability that when a (fair) coin is tossedk times the magnitude of the difference between the number of heads and the number of tails exceedsn.     

Remarkable Haar spaces of multivariate piecewise polynomials

Some families of Haar spaces in \(\mathbb {R}^{d},~ d\ge 1,\) whose basis functions are d-variate piecewise polynomials, are highlighted. The starting point is a sequence of univariate piecewise polynomials, called Lobachevsky splines, arised in probability theory and asymptotically related to the normal density function. Then, it is shown that d-variate Lobachevsky splines can be expressed as products of Lobachevsky splines. All these splines have simple analytic expressions and subsets of them are suitable for scattered data interpolation, allowing efficient computation and plain error analysis.     

Approximation by matrices with restricted spectra

We investigate the properties of the approximation of a matrix by matrices whose spectra are in a closed convex set of the complex plane. We explain why the Khalil and Maher characterization of an approximant, which spectrum is in a strip, is not quite correct. We prove that their characterization is valid but for another kind of approximation. We formulate a conjecture which leads to some algorithm for computing approximants. The conjecture is motivated by numerical experiments and some theoretical considerations. Separately we consider the approximation of normal matrices.