Related papers: How much faster does the best polynomial approxima…

In the first part we have shown that, for $L_2$-approximation of functions from a separable Hilbert space in the worst-case setting, linear algorithms based on function values are almost as powerful as arbitrary linear algorithms if the…

A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…

We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…

In this paper, exact rate of decrease of best approximations of non-integer numbers by polynomials with integer coefficients of the growing exponentials is found on a disk in complex plane, on a cube in $\mathbb{R}^d$, and on a ball in…

Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…

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…

Polytrees are a subclass of Bayesian networks that seek to capture the conditional dependencies between a set of $n$ variables as a directed forest and are motivated by their more efficient inference and improved interpretability. Since the…

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 prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

BV functions cannot be approximated well by piecewise constant functions, but this work will show that a good approximation is still possible with (countably) piecewise affine functions. In particular, this approximation is area-strictly…

We propose a new modified primal-dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates…

In this short note we prove that, if (C[a,b],{A_n}) is an approximation scheme and (A_n) satisfies de La Vall\'ee-Poussin Theorem, there are instances of continuous functions on [a,b], real analytic on (a,b], which are poorly approximable…

We systematically investigate the farthest distance function, farthest points, Klee sets, and Chebyshev centers, with respect to Bregman distances induced by Legendre functions. These objects are of considerable interest in Information…

We study Min-Max affine approximants of a continuous convex or concave function $f:\Delta\subset \mathbb R^k\xrightarrow{} \mathbb R$ where $\Delta$ is a convex compact subset of $\mathbb R^k$. In the case when $\Delta$ is a simplex we…

We estimate the density and its derivatives using a local polynomial approximation to the logarithm of an unknown density $f$. The estimator is guaranteed to be nonnegative and achieves the same optimal rate of convergence in the interior…

We study approximation of functions by algebraic polynomials in the H\"older spaces corresponding to the generalized Jacobi translation and the Ditzian-Totik moduli of smoothness. By using modifications of the classical moduli of…

In this paper, we study the behavior of solutions of the ODE associated to Nesterov acceleration. It is well-known since the pioneering work of Nesterov that the rate of convergence $O(1/t^2)$ is optimal for the class of convex functions…

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 1996 N. Chevallier proved a beautiful lemma which connects Diophantine approximation and multidimensional generalizations of the famous Three Distance Theorem. Using this lemma we show how known results about multidimensional three…

One of the basic principles of Approximation Theory is that the quality of approximations increase with the smoothness of the function to be approximated. Functions that are smooth in certain subdomains will have good approximations in…