Representation and approximation of multivariate functions with mixed smoothness by hyperbolic wavelets

In this paper, we study the representation theorems of multivariate functions with mixed smoothness by wavelet basis formed by tensor products of univariate wavelets, we also study the best approximation in the metric for some function classes with mixed smoothness by hyperbolic wavelets and obtain some asymptotic estimates of approximating order.     

Polynomial approximation of functions with given order of thekth generalized modulus of smoothness

The problem of approximation by algebraic polynomials is considered on function classes characterized by the value of thekth generalized modulus of smoothness defined by the Jacobi generalized shift operator. Translated fromMatematicheskie Zametki, Vol. 63, No. 3, pp. 425–436, March, 1998.     

On approximation of smooth functions from null spaces of optimal linear differential operators with constant coefficients

For a real valued function f defined on a finite interval I we consider the problem of approximating f from null spaces of differential operators of the form Ln(ψ) = n ∑ k=0 akψ(k), where the constant coefficients ak ∈ R may be adapted to f . We prove that for each f ∈ C(n)(I), there is a selection of coefficients {a1, ,an} and a corresponding linear combination Sn( f ,t) = n ∑ k=1 bkeλkt of functions ψk(t) = eλkt in the nullity of L which satisfies the following Jackson’s type inequality: f (m) Sn(m )( f ,t) ∞≤ |an|2n|Im|1/1q/ep|λ|λn|n|I||nm1 Ln( f ) p, where |λn| = mka x|λk|, 0 ≤ m ≤ n 1, p,q ≥ 1, and 1p + q1 = 1. For the particular operator Mn(f) = f + 1/(2n) f(2n) the rate of approximation by the eigenvalues of Mn for non-periodic analytic functions on intervals of restricted length is established to be exponential. Applications in algorithms and numerical examples are discussed.     

An improved estimate of PSWF approximation and approximation by Mathieu functions

In this paper, an error estimate of spectral approximations by prolate spheroidal wave functions (PSWFs) with explicit dependence on the bandwidth parameter and optimal order of convergence is derived, which improves the existing result in [Chen et al., Spectral methods based on prolate spheroidal wave functions for hyperbolic PDEs, SIAM J. Numer. Anal. 43 (5) (2005) 1912-1933]. The underlying argument is applied to analyze spectral approximations of periodic functions by Mathieu functions, which leads to new estimates featured with explicit dependence on the intrinsic parameter.     

Decomposition of multivariate infinitely divisible characteristic functions with absolutely continuous Poisson spectral measures

We shall consider the decomposition problem of multivariate infinitely divisible characteristic functions which have no Gaussian component and have absolutely continuous Poisson spectral measures. Under the condition that A = {x;f(x) > 0} is open, where f is the density of spectral measure, we shall show that a known sufficient condition for the membership of the class I_0m (i.e., infinitely divisible characteristic functions having only infinitely divisible factors) is also necessary.     

On best rational approximation of analytic functions

This paper contains some theorems related to the best approximation ρ_n(f;E) to a function f in the uniform metric on a compact set by rational functions of degree at most n. We obtain results characterizing the relationship between ρ_n(f;K) and ρ_n(f;E) in the case when complements of compact sets K and E are connected, K is a subset of the interior Ω of E, and f is analytic in Ω and continuous on E.     

One-sided approximation of functions

The best one-sided approximation of periodic functions by trigonometric polynomials of classW _p ⁰ (K) in the metric ofL is obtained. Translated fromMatematicheskie Zametki, Vol. 67, No. 1, pp. 136–140, January, 2000.     

Nonlinear programming,approximation, and optimization on infinitely differentiable functions

A nonnegative, infinitely differentiable function defined on the real line is called a Friedrichs mollifier function if it has support in [0, 1] and ₀ ¹ (t)dt=1. In this article, the following problem is considered. Determine _k =inf ₀ ¹ |^(k)(t)|dt,k=1, 2, ..., where ^(k) denotes thekth derivative of and the infimum is taken over the set of all mollifier functions , which is a convex set. This problem has applications to monotone polynomial approximation as shown by this author elsewhere. The problem is reducible to three equivalent problems, a nonlinear programming problem, a problem on the functions of bounded variation, and an approximation problem involving Tchebycheff polynomials. One of the results of this article shows that _k =k!2^2k–1,k=1, 2, .... The numerical values of the optimal solutions of the three problems are obtained as a function ofk. Some inequalities of independent interest are also derived.This research was supported in part by the National Science Foundation, Grant No. GK-32712.     

An algorithm for determining the approximation orders of multivariate periodic spline spaces

We give an algorithm which computes the approximation order of spaces of periodic piece-wise polynomial functions, given the degree, the smoothness and tesselation. The algorithm consists of two steps. The first gives an upper bound and the second a lower bound on the approximation order. In all known cases the two bounds coincide.     

Modified Taylor approximation of functions with periodic behaviour

We approximate a function with periodic behaviour by means of a small modification of its Taylor polynomial. This modification is based on the work of Scheifele and will simplify the construction of special numerical methods for differential equations with near periodic solutions.     

Optimal uniform approximation on angles by entire functions

The paper discusses the best or optimal uniform approximation problem by entire functions on a closed angle Δ. This problem has been studied by M.V. Keldysch in [4], under the assumption that the functions ? subject to approximation are holomorphic in a larger angle containing Δ and there is no restriction on the growth of ? at infinity. In [8], the problem was investigated for a wider class of functions ? continuously complex differentiable on Δ, with sharper estimates on the growth of approximating entire functions, linked with the growth of ? on Δ and the differential properties of ? on the boundary of Δ. In this paper, we improve some of the results on entire approximation on angles, using new approximation ideas partially presented in [9] and [10].     

Approximation of discrete functions and Chebyshev polynomials orthogonal on the uniform grid

Let _N+2m ={−m, −m+1, …, −1, 0, 1, …,N−1,N, …,N−1+m}. The present paper is devoted to the approximation of discrete functions of the formf : _N+2m → ℝ by algebraic polynomials on the grid Ω _N ={0, 1, …,N−1}. On the basis of two systems of Chebyshev polynomials orthogonal on the sets Ω _N+m and Ω _N , respectively, we construct a linear operatorY _{n+2m, N} =Y _{n+2m, N} (f), acting in the space of discrete functions as an algebraic polynomial of degree at mostn+2m for which the following estimate holds (x ε Ω _N ):

On strong approximation applied to post-widder operators

We introduce modified Post-Widder operators in polynomial weighted spaces of differentiable functions and we study strong approximation for them.     

On the continuity of the multivariate Padé operator

Continuity of the univariate Padé operator was proved in [5,6]. We discuss the limitations of a multivariate generalization and prove a multivariate analogon of the continuity property.     

Best uniform approximation to a class of rational functions

We explicitly determine the best uniform polynomial approximation to a class of rational functions of the form 1/²(x−c)+K(a,b,c,n)/(x−c) on [a,b] represented by their Chebyshev expansion, where a, b, and c are real numbers, n−1 denotes the degree of the best approximating polynomial, and K is a constant determined by a, b, c, and n. Our result is based on the explicit determination of a phase angle η in the representation of the approximation error by a trigonometric function. Moreover, we formulate an ansatz which offers a heuristic strategies to determine the best approximating polynomial to a function represented by its Chebyshev expansion. Combined with the phase angle method, this ansatz can be used to find the best uniform approximation to some more functions.     

Interpolation of functions by the least squares method

We study the norm of a best quadratic trigonometric approximation operator on a finite uniform grid. Dedicated to the memory of my scientific adviser, Professor S. B. Stechkin Translated fromMatematicheskie Zametki, Vol. 66, No. 3, pp. 372–379, September, 1999.     

Weak and quasi-polynomial tractability of approximation of infinitely differentiable functions

We comment on recent results in the field of information based complexity, which state (in a number of different settings), that the approximation of infinitely differentiable functions is intractable and suffers from the curse of dimensionality. We show that renorming the space of infinitely differentiable functions in a suitable way allows weakly tractable uniform approximation by using only function values. Moreover, the approximating algorithm is based on a simple application of Taylor’s expansion about the center of the unit cube. We discuss also the approximation on the Euclidean ball and the approximation in the _L1$L_1$-norm.     

On the optimal approximation rates for criss-cross finite element spaces

Let Δ denote the triangulation of the plane obtained by multi-integer translates of the four lines x=0, y=0, x=y and x=?y. By $\text{l}{}_{\mathrm{k,\; h}}{}^{\mathrm{\mu }}$ we mean the space of all piecewise polynomials of degree ?k with respect to the scaled triangulation hΔ having continuous partial derivatives of order $\text{?μ}\text{on}\text{R}{}^2$. We show that the approximation properties of $\text{l}{}_{\mathrm{k,\; h}}{}^{\mathrm{\mu }}$ are completely governed by those of the space spanned by the translates of all so called box splines contained in $\text{l}{}_{\mathrm{k,h}}{}^{\mathrm{\mu }}$. Combining this fact with Fourier analysis techniques allows us to determine the optimal controlled approximation rates for the above subspace of box splines where μ is the largest degree of smoothness for which these spaces are dense as h tends to zero. Furthermore, we study the question of local linear dependence of the translates of the box splines for the above criss-cross triangulations.     

Estimation of multivariate binary density using orthogonal functions

In this paper, the authors studied certain properties of the estimate of Liang and Krishnaiah (1985, J. Multivariate Anal. 16, 162–172) for multivariate binary density. An alternative shrinkage estimate is also obtained. The above results are generalized to general orthonormal systems.     

Uniform and tangential approximation in a stripe by meromorphic functions of optimal growth

The paper discusses the problem of approximation of functions continuous on a closed stripe S _h = {z: |Imz| ≤h} and holomorphic in its interior. The results relate to the uniform and tangential approximation of such functions f by meromorphic functions g with minimal growth in terms of Nevanlinna characteristic T (r, g). The growth depends on the growth of f in S _h and certain differential properties of f on ?S _h . It is assumed that the possible poles of g are restricted to the imaginary axis.