Related papers: Converse estimates for the simultaneous approximat…
In generalized Lebesgue spaces L^{p(.)} with variable exponent p(.) defined on the real axis, we obtain several inequalities of approximation by integral functions of finite degree. Approximation properties of Bernstein singular integrals…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
We present an efficient method to solve the problem of the constrained least squares approximation of the rational B\'{e}zier curve by the B\'{e}zier curve. The presented algorithm uses the dual constrained Bernstein basis polynomials,…
It is be shown that the sequence of Bernstein polynomials for a function of several variables converges to this function uniformly along with every partial derivative of any order, provided that the latter derivative is well defined and…
For a class of stochastic models with Gaussian and rough mean-reverting volatility that embeds the genuine rough Stein-Stein model, we study the weak approximation rate when using a Euler type scheme with integrated kernels. Our first…
For functions belonging to the classes $C^{2}[0, 1]$ and $C^{3}[0, 1]$, we establish the lower estimate with an explicit constant in approximation by Bernstein polynomials in terms of the second order Ditzian-Totik modulus of smoothness.…
The aim of this article is to introduce a bivariate extension of Shurer-Stancu operators based on (p q)integers. We prove uniform approximation by means of Bohman Korovkin type theorem rate of convergence using total modulus of smoothness…
In this paper we study convergence results and rate of approximation for a family of linear integral operators of Mellin type in the frame of $BV^{\varphi}(\mathbb{R}^N_+)$. Here $BV^{\varphi}(\mathbb{R}^N_+)$ denotes the space of functions…
We introduce appropriate computable moduli of smoothness to characterize the rate of best approximation by multivariate polynomials on a connected and compact $C^2$-domain $\Omega\subset \mathbb{R}^d$. This new modulus of smoothness is…
The order of smoothness chosen in nonparametric estimation problems is critical. This choice balances the tradeoff between model parsimony and data overfitting. The most common approach used in this context is cross-validation. However,…
In this article, I provide significant mathematical evidence in support of the existence of short-time approximations of any polynomial order for the computation of density matrices of physical systems described by arbitrarily smooth and…
The Bernstein approximation problem is to determine whether or not the space of all polynomials is dense in a given weighted $C_0$-space on the real line. A theorem of L. de Branges characterizes non--density by existence of an entire…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
Suppose A is a finite set equipped with a probability measure P and let M be a ``mass'' function on A. We give a probabilistic characterization of the most efficient way in which A^n can be almost-covered using spheres of a fixed radius. An…
We introduce appropriate computable moduli of smoothness to characterize the rate of best approximation by multivariate polynomials on a connected and compact $C^2$-domain $\Omega\subset \mathbb{R}^d$. This new modulus of smoothness is…
Let $d\in \mathbb{N}$ and let $\gamma_i\in [0,\infty)$, $x_i\in (0,1)$ be such that $\sum_{i=1}^{d+1} \gamma_i = M\in (0,\infty)$ and $\sum_{i=1}^{d+1} x_i = 1$. We prove that \begin{equation*} a \mapsto \frac{\Gamma(aM +…
In this paper, we present a new iterative approximate method of solving boundary value problems. The idea is to compute approximate polynomial solutions in the Bernstein form using least squares approximation combined with some properties…
We consider a sequence of composite Bernstein operators and the quadrature formulae associated with them. Upper bounds for the approximation error of continuous functions and for the approximation of integrals of continuous functions are…
In this paper, we consider the alleviation of the boundary problem when the probability density function has bounded support. We apply Robbins-Monro's algorithm and Bernstein polynomials to construct a recursive density estimator. We study…
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral…