Related papers: Exact and approximate solutions to the minimum of …
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…
We study the best uniform approximation by polynomials of fixed degree of the function sgn(x) on the union of two intervals symmetric with respect to the origin. We obtain precise asymptotics, with explicit constants, for the error of the…
Let $F_n$ denote the distribution function of the normalized sum $Z_n = (X_1 + \dots + X_n)/\sigma\sqrt{n}$ of i.i.d. random variables with finite fourth absolute moment. In this paper, polynomial rates of convergence of $F_n$ to the normal…
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…
We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…
We study the polynomial approximation problem in $L^2(\mu_1)$ where $\mu_1(dx) = e^{-|x|}/2 dx$. We show that for any absolutely continuous function $f$, $$ \sum_{k=1}^{\infty} \log^2(e+k) \langle f, P_k \rangle^2 \ \leq C \left(…
We establish a novel upper bound for the real solutions of the equation specified in the title, employing a generalized derivation-division algorithm. As a consequence, we also derive a new set of Chebyshev functions adapted specifically…
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…
We describe polynomials of the best uniform approximation to sgn(x) on the union of two intervals in terms of special conformal mappings. This permits us to find the exact asymptotic behavior of the error of this approximation.
We investigate singularly perturbed nonlinear complex differential systems of the form $\hbar \partial_x f = F (x, \hbar, f)$ where $\hbar$ is a small complex perturbation parameter. Under a geometric assumption on the eigenvalues of the…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
The best uniform polynomial approximation of the checkmark function $f(x)=|x-\alpha |$ is considered, as $\alpha$ varies in $(-1,1)$. For each fixed degree $n$, the minimax error $E_n (\alpha)$ is shown to be piecewise analytic in $\alpha$.…
In this article, we consider a simple representation for real numbers and propose top-down procedures to approximate various algebraic and transcendental operations with arbitrary precision. Detailed algorithms and proofs are provided to…
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…
Let $F \in \R[X_1,\ldots,X_n]$ and the zero set $V=\zero(\mathcal{P},\R^n)$, where $\mathcal{P}:=\{P_1,\ldots,P_s\} \subset \R[X_1,\ldots,X_n]$ is a finite set of polynomials. We investigate existence of critical points of $F$ on an…
When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…
Novel sequences of approximants to solutions of Painlev\'e II on finite intervals of the real line, with Neumann boundary conditions, are constructed. Numerical experiments strongly suggest convergence of these sequences in a surprisingly…
Let $f(x)$ be a polynomial of degree $n \ge 1$ with real coefficients and let $X \ge 2$ and $\delta \ge 0$ be real numbers. Let $\|\cdot\|$ be the distance to the nearest integer. We obtain upper bounds for the number of solutions to the…
A classification theorem for linear differential equations in two variables (one real and one Grassmann) having polynomial solutions(the generalized Bochner problem) is given. The main result is based on the consideration of the eigenvalue…
Denoting by $E_{n}^{(+2)}(f)$ the best uniform approximation of $f$ by convex polynomials of degree $\le n$, there is an open question if there exists the limit $\lim_{n\to \infty}n^{\lambda}E_{n}^{(+2)}(|x|^{\lambda})$ for $\lambda \ge 1$.