Related papers: Uniform approximation of sgn(x) by polynomials and…
In this work we produce a framework for constructing universal function approximators on graph isomorphism classes. We prove how this framework comes with a collection of theoretically desirable properties and enables novel analysis. We…
We obtained order estimations for the best uniform approximations by trigonometric polynomials and approximations by Fourier sums of classes of $2\pi$-periodic continuous functions, which $(\psi,\beta)$-derivatives $f_{\beta}^{\psi}$ belong…
We propose efficient techniques for generating independent identically distributed uniform random samples inside semialgebraic sets. The proposed algorithm leverages recent results on the approximation of indicator functions by polynomials…
We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, "shape" refers to (finitely many changes of) monotonicity, convexity,…
We investigate asymptotic polynomial approximation for a class of weighted Bloch functions in the unit disc. Our main result is a structural theorem on asymptotic polynomial approximation in the unit disc, in the flavor of the classical…
Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…
Our objective in this paper is to present the sequence of Stancu type operators including generalized Brenke polynomials. We answer the problem of uniform approximation of continuous functions on closed bounded interval and the problem of…
This work investigates the asymptotic behaviour of the gradient approximation method called the generalized simplex gradient (GSG). This method has an error bound that at first glance seems to tend to infinity as the number of sample points…
In this survey, we use (more or less) elementary means to establish the well-known result that for any given smooth multivariate function, the respective multivariate Bernstein polynomials converge to that function in all derivatives on…
In Mergelyan type approximation we uniformly approximate functions on compact sets K by polynomials or rational functions or holomorphic functions on varying open sets containing K. In the present paper we consider analogous approximation,…
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 study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions…
In this work we design graph neural network architectures that capture optimal approximation algorithms for a large class of combinatorial optimization problems, using powerful algorithmic tools from semidefinite programming (SDP).…
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…
This paper introduces the Simultaneous assignment problem. Let us given a graph with a weight and a capacity function on its edges, and a set of its subgraphs along with a degree upper bound function for each of them. We are also given a…
Considering simultaneous approximation to three numbers, we study the geometry of the sequence of best approximations. We provide a sharper lower bound for the ratio between ordinary and uniform exponent of Diophantine approximation,…
In this work, we introduce new families of nonconforming approximation methods for reconstructing functions on general polygonal meshes. These methods are defined using degrees of freedom based on weighted moments of orthogonal polynomials…
This work is a continuation of the recent study by the authors on approximation theory over the sphere and the ball. The main results define new Sobolev spaces on these domains and study polynomial approximations for functions in these…
The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…
We show that on separable Banach spaces admitting a separating polynomial, any uniformly continuous, bounded, real-valued function can be uniformly approximated by Lipschitz, analytic maps on bounded sets.