Related papers: Uniform approximation of sgn(x) by polynomials and…
We aim to fill a gap in the proof of an inequality relating two exponents of uniform Diophantine approximation stated in a paper by Bugeaud. We succeed to verify the inequality in several instances, in particular for small dimension.…
We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…
There were established the exact-order estimations of the best uniform approximations by{\psi} the trigonometrical polynoms on the $C^{\psi}_{\beta,p}$ classes of $2\pi$-periodic continuous functions $f$, which are defined by the…
The paper explores connection between the order and the type of an entire function and the speed of the best polynomial approximation in the unit disk. The relations which define the order and the type of an entire function through the…
We study the Hausdorff measure and dimension of the set of intrinsically simultaneously $\psi$-approximable points on a curve, surface, etc., given as a graph of integer valued polynomials. We obtain complete answers to these questions for…
We find uniform with respect to parameter $p \ (1\leq p\leq\infty)$ upper estimations of best approximations by trigonometric polynomials of classes $C^{\psi}_{\beta,p}$ of periodic functions generated by sequences $\psi(k)$, that decrease…
For a function $f$ that is piecewise analytic on a quasi-smooth arc $\mathcal{L}$ and any $0<\sigma<1$ we construct a sequence of "near-best" polynomials that converge at a rate $e^{-n^{\sigma}}$ at each point of analyticity of $f$ and are…
We present one of the approaches to find the best approximation of the given function by trigonometric polynomials in $L^1$ metric and applied it to find the optimal constants in the Nikolsky's type inequality, concerning approximation of…
This note is a continuation of our papers [1,2], devoted to $L$-approximation of characteristic function of $(-h, h)$ by trigonometric polynomials. In the paper [1] the sharp values of the best approximation for the special values of $h$…
This note explores the applicability of unsupervised machine learning techniques towards hard optimization problems on random inputs. In particular we consider Graph Neural Networks (GNNs) -- a class of neural networks designed to learn…
This paper investigates the universal approximation capabilities of Hamiltonian Deep Neural Networks (HDNNs) that arise from the discretization of Hamiltonian Neural Ordinary Differential Equations. Recently, it has been shown that HDNNs…
Let $0<m<n$ be integers, and let $K_w$ denote the completion of a number field $K$ at a non-trivial place $w$. For each non-zero $\textbf{u}\in K_w^n$, let $\omega_{m-1}(\textbf{u})$ denote the exponent of best approximation to $\textbf{u}$…
The degrees of polynomials representing or approximating Boolean functions are a prominent tool in various branches of complexity theory. Sherstov recently characterized the minimal degree deg_{\eps}(f) among all polynomials (over the…
In this paper, we theoretically and numerically verify that the discontinuous Galerkin (DG) methods with central fluxes for linear hyperbolic equations on non-uniform meshes have sub-optimal convergence properties when measured in the…
We prove that several forms of the Bernstein polynomials with integer coefficients possess the property of simultaneous approximation, that is, they approximate not only the function but also its derivatives. We establish direct estimates…
In this paper we consider the approximation of a function by its interpolating multilinear spline and the approximation of its derivatives by the derivatives of the corresponding spline. We derive formulas for the uniform approximation…
Asymptotic approximations for the continuous Hahn polynomials and their zeros as the degree grows to infinity are established via their three-term recurrence relation. The methods are based on the uniform asymptotic expansions for…
We obtain an estimate for uniform approximation rate of bounded analytic in the unit disk functions by logarithmic derivatives of $C$-polynomials, i.e., polynomials, all of whose zeros lie on the unit circle $C:|z|=1$.
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…
The polynomial $f_{2n}(x)=1+x+\cdots+x^{2n}$ and its minimizer on the real line $x_{2n}=\operatorname{arg\,inf} f_{2n}(x)$ for $n\in\Bbb N$ are studied. Results show that $x_{2n}$ exists, is unique, corresponds to $\partial_x f_{2n}(x)=0$,…