Related papers: Approximation by sequence of operators including D…
In this paper, we introduce the higher order generalization of Bernstein type operators defined by (p,q)-integers. We establish some approximation results for these new operators by using the modulus of continuity.
We propose an analytical approximation for the modified Bessel function of the second kind $K_\nu$. The approximation is derived from an exponential ansatz imposing global constrains. It yields local and global errors of less than one…
The real theory of the Dunkl operators has been developed very extensively, while there still lacks the corresponding complex theory. In this paper we introduce the complex Dunkl operators for certain Coxeter groups. These complex Dunkl…
Monotone inclusions have a wide range of applications, including minimization, saddle-point, and equilibria problems. We introduce new stochastic algorithms, with or without variance reduction, to estimate a root of the expectation of…
Dunkl operators are differential-difference operators on $\b R^N$ which generalize partial derivatives. They lead to generalizations of Laplace operators, Fourier transforms, heat semigroups, Hermite polynomials, and so on. In this paper we…
We first propose two conjectural estimates on Diophantine approximation of logarithms of algebraic numbers. Next we discuss the state of the art and we give further partial results on this topic.
Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is…
In this note we use the analogy between the Catalan sequence and the Rueppel sequence to derive a variety of conjectures surrounding the Hankel transforms of a number of sequences closely related to the Rueppel sequence. Use is made of the…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step…
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…
In this paper we study Appell polynomials by connecting them to random variables. This probabilistic approach yields, e.g., the mean value property which is fundamental in the sense that many other properties can be derived from it. We also…
A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…
Macdonald operators are well known as the 'commutative family' acting on the symmetric functions over Q(q,t). If we suppose that q=exp(h) and t=exp(beta h) and observe the Taylor expansion around h=0, we can see the second-degree Dunkl…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
Algebraic and analytic aspects of self-adjoint operators of order four or more with polynomial coefficients are investigated. As a consequence, a systematic way of constructing such operators is given. The procedure is applied to obtain…
The purpose of this paper is twofold. First, basic concepts such as Gamma function, almost convergence, fractional order difference operator and sequence spaces are given as a survey character. Thus, the current knowledge about those…
The paper explores connection between the generalized order and the generalized type of an entire function and the speed of the best polynomial approximation in the unit disk. The relations which define the generalized order and the…
We consider the numerical approximation for a class of radial Dunkl processes corresponding to arbitrary (reduced) root systems in $\mathbb{R}^{d}$. This class contains some well-known processes such as Bessel processes, Dyson's Brownian…
We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…