Related papers: Approximation with one-bit polynomials in Bernstei…

For various Hilbert spaces of analytic functions on the unit disk, we characterize when a function $f$ has optimal polynomial approximants given by truncations of a single power series. We also introduce a generalized notion of optimal…

In this work, we propose a method for minimizing non-convex functions with Lipschitz continuous $p$th-order derivatives, starting from $p \geq 1$. The method, however, only requires derivative information up to order $(p-1)$, since the…

We strengthen the Weierstrass approximation theorem by proving that any real-valued continuous function on an interval $I \subset \mathbb{R}$ can be uniformly approximated by a real-valued polynomial whose only (possibly complex) critical…

In this short note we have proved an enhanced version of a theorem of Lorentz [1] and its generalization to the multivariate case which gives a non- uniform estimate of degree of approximation by a polynomial with positive coefficients. The…

Let $\sigma>0$. For $1\le p\le \infty$, the Bernstein space $B^p_{\sigma}$ is a Banach space of all $f\in L^p(R)$ such that $f$ is bandlimited to $\sigma$; that is, the distributional Fourier transform of $f$ is supported in $[-\sigma,…

We show an equivalence between 1-query quantum algorithms and representations by degree-2 polynomials. Namely, a partial Boolean function $f$ is computable by a 1-query quantum algorithm with error bounded by $\epsilon<1/2$ iff $f$ can be…

We make the case for neural network objects and extend an already existing neural network calculus explained in detail in Chapter 2 on \cite{bigbook}. Our aim will be to show that, yes, indeed, it makes sense to talk about neural network…

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,…

The main purpose of this paper is to prove some density results of polynomials in Fock spaces of slice regular functions. The spaces can be of two different kinds since they are equipped with different inner products and contain different…

We give derivations of some basic results for the Bernstein approximation in $n$ variables that are useful in investigating copulas. It is shown that Bernstein approximations of copulas are again copulas. We exhibit a stochastic…

Let $x \in \mathbb{R}$ be arbitrary and consider the `greedy' approximation of $x$ by signed harmonic sums: given $a_n = \sum_{k \leq n} \varepsilon_k/k$ with $\varepsilon_k \in \left\{-1,1\right\}$, we set $\varepsilon_{n+1} = 1$ if $a_n…

Solutions to many important partial differential equations satisfy bounds constraints, but approximations computed by finite element or finite difference methods typically fail to respect the same conditions. Chang and Nakshatrala enforce…

We give direct and inverse theorems for the weighted approximation of functions with endpoint singularities by combinations of Bernstein operators.

This paper presents a polynomial-time $1/2$-approximation algorithm for maximizing nonnegative $k$-submodular functions. This improves upon the previous $\max\{1/3, 1/(1+a)\}$-approximation by Ward and \v{Z}ivn\'y~(SODA'14), where…

Polynomial approximation is studied in the Sobolev space $W_p^r(w_{\alpha,\beta})$ that consists of functions whose $r$-th derivatives are in weighted $L^p$ space with the Jacobi weight function $w_{\alpha,\beta}$. This requires…

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…

Trigonometric polynomials are widely used for the approximation of a smooth function $f$ from a set of nonuniformly spaced samples $\{f(x_j)\}_{j=0}^{N-1}$. If the samples are perturbed by noise, controlling the smoothness of the…

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…

Because of the high approximation power and simplicity of computation of smooth radial basis functions (RBFs), in recent decades they have received much attention for function approximation. These RBFs contain a shape parameter that…

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…