Related papers: Iterated Bernstein polynomial approximations
We develop a theory of Bernstein-Sato polynomials for meromorphic functions and we use it to study the analytic continuation of Archimedian local zeta functions in this setting. We also introduce both an analytic and an algebraic theory of…
Given a submodular capacity space, we prove the uniform convergence in capacity and also the uniform convergence in the Choquet-mean of order $p\ge1$ with a quantitative estimate, of the multivariate Bernstein polynomials associated to a…
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.
In this paper, we give new identities involving Phillips q-Bernstein polynomials and we derive some interesting properties of q-Berstein polynomials associated with q-Stirling numbers and q-Bernoulli polynomials.
This paper presents a novel method for generating a single polynomial approximation that produces correctly rounded results for all inputs of an elementary function for multiple representations. The generated polynomial approximation has…
In this article, the 2-iterated Sheffer polynomials are introduced by means of generating function and operational representation. Using the theory of Riordan arrays and relations between the Sheffer sequences and Riordan arrays, a…
The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…
This work introduces the nested-set Hessian approximation, a second-order approximation method that can be used in any derivative-free optimization routine that requires such information. It is built on the foundation of the generalized…
The convergence rates on polynomial interpolation in most cases are estimated by Lebesgue constants. These estimates may be overestimated for some special points of sets for functions of limited regularities. In this paper, by applying the…
Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.
We investigate random compact sets with random functions defined thereon, such as polynomials, rational functions, the pluricomplex Green function and the Siciak extremal function. One surprising consequence of our study is that randomness…
In this paper, we give direct theorems on point wise and global approximation by new variants of Bernstein-Durrmeyer operator, introduced by A.-M. et al.[1].
New differential-recurrence properties of dual Bernstein polynomials are given which follow from relations between dual Bernstein and orthogonal Hahn and Jacobi polynomials. Using these results, a fourth-order differential equation…
Baskakov operators and their inverses can be expressed as linear differential operators on polynomials. Recurrence relations are given for the computation of these coefficients. They allow the construction of the associated Baskakov…
We study a class of weight functions on $[-1,1]$, which are special cases of the general weights studied by Bernstein and Szeg\"o, as well as their extentions to the interval $[-a,1]$ for a continuous parameter $a>0$. These weights are…
Matrices resulting from the discretization of a kernel function, e.g., in the context of integral equations or sampling probability distributions, can frequently be approximated by interpolation. In order to improve the efficiency, a…
We investigate affine Berkovich spaces over maximally complete fields and prove that they may be approximated by simpler spaces when the only functions we need to evaluate are polynomials of bounded degree. We derive applications to…
The following work is written in easy language for college level students. It shows how the first digit probabilities of a group of continuous real-valued functions can be calculated. Thus, examples explaining how the probabilities are…