Related papers: Converse estimates for the simultaneous approximat…
Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…
The Bernstein polynomials with integer coefficients do not generally preserve monotonicity and convexity. We establish sufficient conditions under which they do. We also observe that they are asymptotically shape preserving.
This paper proposes a robust approximation method for solving chance constrained optimization (CCO) of polynomials. Assume the CCO is defined with an individual chance constraint that is affine in the decision variables. We construct a…
Boltzmann sampling is commonly used to uniformly sample objects of a particular size from large combinatorial sets. For this technique to be effective, one needs to prove that (1) the sampling procedure is efficient and (2) objects of the…
We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…
We study nonparametric estimation of univariate cumulative distribution functions (CDFs) pertaining to data missing at random. The proposed estimators smooth the inverse probability weighted (IPW) empirical CDF with the Bernstein operator,…
Let $(X_1,\ldots,X_n)$ be an i.i.d. sequence of random variables in $\mathbb{R}^d$, $d\geq 1$. We show that, for any function $\varphi :\mathbb{R}^d\rightarrow\mathbb{R}$, under regularity conditions, \[n^…
This expository article proves some results of Ferguson, on the approximation of continuous functions on a compact subset of R by polynomials with integral coefficients.
In our recent publication [1] we presented an exponential series approximation suitable for highly accurate computation of the complex error function in a rapid algorithm. In this Short Communication we describe how a simplified…
This paper offers a newly created integral approach for operators employing the orthogonal modified Laguerre polynomials and P\u{a}lt\u{a}nea basis. These operators approximate the functions over the interval $[0,\infty)$. Further, the…
This paper deals with Lavrentiev regularization for solving linear ill-posed problems, mostly with respect to accretive operators on Hilbert spaces. We present converse and saturation results which are an important part in regularization…
For a sample of absolutely bounded i.i.d. random variables with a continuous density the cumulative distribution function of the sample variance is represented by a univariate integral over a Fourier series. If the density is a polynomial…
The purpose of this paper is to study some new concrete approximation processes for continuous vector-valued mappings defined on the infinite dimensional cube or on a subset of a real Hilbert space. In both cases these operators are…
We discuss approximation of extremal functions by polynomials in the weighted Bergman spaces $A^p_\alpha$ where $-1 < \alpha < 0$ and $-1 < \alpha < p-2$. We obtain bounds on how close the approximation is to the true extremal function in…
The article is devoted to the estimation of the rate of convergence of integral functionals of a Markov process. Under the assumption that the given Markov process admits a transition probability density which is differentiable in $t$ and…
We obtain the asymptotic equalities for the least upper bounds of approximations by interpolation trigonometric polynomials with the equidistant nodes $x_k^{(n-1)}=\frac{2k\pi}{2n-1},\ k\in\mathbb{Z},$ in metrics of the spaces $L_p$ on…
The purpose of this paper is to prove a weak convergence result for empirical processes indexed in general classes of functions and with an underlying $\alpha$-mixing sequence of random variables. In particular the uniformly boundedness…
We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the…
We derive a simple and precise approximation to probability density functions in sampling distributions based on the Fourier cosine series. After clarifying the required conditions, we illustrate the approximation on two examples: the…
Stein's method is used to approximate sums of discrete and locally dependent random variables by a centered and symmetric Binomial distribution. Under appropriate smoothness properties of the summands, the same order of accuracy as in the…