Related papers: Iterated Bernstein polynomial approximations

We study the generalized continued fraction expansions of complex numbers in term of elements from Euclidean subrings, especially Gaussian or Eisenstein integers, in a general framework as pursued in [3] and [1]. We introduce a common…

Bayesian probabilistic numerical methods are a set of tools providing posterior distributions on the output of numerical methods. The use of these methods is usually motivated by the fact that they can represent our uncertainty due to…

We present an iterative method to obtain approximations to Bessel functions of the first kind $J_p(x)$ ($p>-1$) via the repeated application of an integral operator to an initial seed function $f_0(x)$. The class of seed functions $f_0(x)$…

We study the q-analogue of Euler-Maclaurin formula and by introducing a new q-operator we drive to this form. Moreover, approximation properties of q-Bernoulli polynomials is discussed. We estimate the suitable functions as a combination of…

The study of iterations of functions over a finite field and the corresponding functional graphs is a growing area of research with connections to cryptography. The behaviour of such iterations is frequently approximated by what is know as…

The aim of this paper is to give a new approach to modified q-Bernstein polynomials for functions of two variables. By using these type polynomials, we derive recurrence formulas and some new interesting identities related to the second…

Orthogonal polynomials have very useful properties in the solution of mathematical problems, so recent years have seen a great deal in the field of approximation theory using orthogonal polynomials. In this paper, we characterize the…

We propose a general formalism of iterated random functions with semigroup property, under which exact and approximate Bayesian posterior updates can be viewed as specific instances. A convergence theory for iterated random functions is…

This paper introduces a new approach to the study of rates of convergence for posterior distributions. It is a natural extension of a recent approach to the study of Bayesian consistency. In particular, we improve on current rates of…

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…

Composite optimization problems, where the sum of a smooth and a merely lower semicontinuous function has to be minimized, are often tackled numerically by means of proximal gradient methods as soon as the lower semicontinuous part of the…

The vector space of all polynomial functions of degree $k$ on a box of dimension $n$ is of dimension ${n \choose k}$. A consequence of this fact is that a function can be approximated on vertices of the box using other vertices to higher…

We construct polynomial approximations of Dzjadyk type (in terms of the k-th modulus of continuity, $k \ge 1$) for analytic functions defined on a continuum E in the complex plane, which simultaneously interpolate at given points of E.…

We approximate the Riemann Zeta-Function by polynomials and Dirichlet polynomials with restricted zeros.

We consider the pointwise weighted approximation by Bernstein operators with inner singularities. The related weight functions are weights $\bar{w}(x)=|x-\xi|^\alpha(0<\xi<1,\ \alpha>0).$ In this paper we give direct and inverse results of…

We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…

Unlike the classical polynomial case there has not been invented up to very recently a tool similar to the Bernstein-Bezier representation which would allow us to control the behavior of the exponential polynomials. The exponential analog…

In approximation theory classical discrete operators, like generalized sampling, Sz\'{a}sz-Mirak'jan, Baskakov and Bernstein operators, have been extensively studied for scalar functions. In this paper, we look at the approximation of…

In this paper we present a convergence rate analysis of inexact variants of several randomized iterative methods. Among the methods studied are: stochastic gradient descent, stochastic Newton, stochastic proximal point and stochastic…