Related papers: Optimal Polynomial Approximants in $L^p$

This paper studies best finitely supported approximations of one-dimensional probability measures with respect to the $L^r$-Kantorovich (or transport) distance, where either the locations or the weights of the approximations' atoms are…

A polynomial optimization problem (POP) consists of minimizing a multivariate real polynomial on a semi-algebraic set $K$ described by polynomial inequalities and equations. In its full generality it is a non-convex, multi-extremal,…

We give a sharp sufficient condition on the distribution function, $|\{x\in \Omega :\,p(x)\leq 1+\lambda\}|$, $\lambda>0$, of the exponent function $p(\cdot): \Omega \to [1,\infty)$ that implies the embedding of the variable Lebesgue space…

This paper deals with the fractional Sobolev spaces $W^{s, p}(\Omega)$, with $s\in (0, 1]$ and $p\in[1,+\infty]$. Here, we use the interpolation results in [4] to provide suitable conditions on the exponents $s$ and $p$ so that the spaces…

In this paper, we obtain several new classes of irreducible polynomials having integer coefficients whose zeros lie inside an open disk around the origin or outside a closed annular region in the complex plane. Such irreducible polynomials…

We approximate the d complex zeros of a univariate polynomial p(x) of a degree d or those zeros that lie in a fixed region of interest on the complex plane such as a disc or a square. Our divide and conquer algorithm of STOC 1995 supports…

We discuss $L^p(\mathbb R^n)$ boundedness for Fourier multiplier operators that satisfy the hypotheses of the H\"ormander multiplier theorem in terms of an optimal condition that relates the distance $|\frac 1p-\frac12|$ to the smoothness…

In this survey article, we review some results and conjectures related to orthogonal polynomials on Cantor sets. The main purpose of this paper is to emphasize the role of equilibrium measures in order to have a general theory of…

In this paper, we study the Dirichlet problem for Laplace's equation in an open disk. The uniqueness of solutions is ensured by the well-known weak maximum principle. We introduce a novel approach to demonstrate the existence of a solution…

We construct finite-dimensional approximations of solution spaces of divergence form operators with $L^\infty$-coefficients. Our method does not rely on concepts of ergodicity or scale-separation, but on the property that the solution space…

We prove locally uniform spacing for the zeros of orthogonal polynomials on the real line under weak conditions (Jacobi parameters approach the free ones and are of bounded variation). We prove that for ergodic discrete Schrodinger…

We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…

This paper details a methodology to transcribe an optimal control problem into a nonlinear program for generation of the trajectories that optimize a given functional by approximating only the highest order derivatives of a given system's…

We study optimal diagonal preconditioning using the classical worst-case $\kappa$-condition number and the averaging-based $\omega$-condition number. For the $\kappa$-optimal preconditioning problem, we derive an affine-based pseudoconvex…

We study maximal functions related to homogeneous polynomial hypersurfaces in $\mathbb{R}^3$. In a sense made precise in this paper, the region of $(p,q)$ for which we obtain $L^p\rightarrow L^q$ boundedness is optimal up to the endpoints…

Approximation by polynomials on a triangle is studied in the Sobolev space $W_2^r$ that consists of functions whose derivatives of up to $r$-th order have bounded $L^2$ norm. The first part aims at understanding the orthogonal structure in…

In this letter, an accelerated quadratic programming (QP) algorithm is proposed based on the proximal gradient method. The algorithm can achieve convergence rate $O(1/p^{\alpha})$, where $p$ is the iteration number and $\alpha$ is the given…

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that 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 generalize a classical result by A.Macintyre and W.Rogosinski on best $H^p$--approximation in $L^p$ of rational functions. For each inner function $\theta$ we give a description of $H^p$--badly approximable functions in $\bar \theta…