English
Related papers

Related papers: Boundary behavior of optimal polynomial approximan…

200 papers

Several new inequalities for moduli of smoothness and errors of the best approximation of a function and its derivatives in the spaces $L_p$, $0<p<1$, are obtained. For example, it is shown that for any $0<p<1$ and $k,\,r\in \mathbb{N}$ one…

Classical Analysis and ODEs · Mathematics 2016-12-26 Yurii Kolomoitsev

The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

Complex Variables · Mathematics 2016-08-25 Md. Firoz Ali , A. Vasudevarao

Given a polynomial function $f \colon \mathbb{R}^n \rightarrow \mathbb{R}$ and a unbounded basic closed semi-algebraic set $S \subset \mathbb{R}^n,$ in this paper we show that the conditions listed below are characterized exactly in terms…

Optimization and Control · Mathematics 2019-03-12 Tien-Son Pham

We present a new data structure to approximate accurately and efficiently a polynomial $f$ of degree $d$ given as a list of coefficients. Its properties allow us to improve the state-of-the-art bounds on the bit complexity for the problems…

Symbolic Computation · Computer Science 2021-11-30 Guillaume Moroz

The threshold degree of a function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p with f(x)=sgn p(x). We prove that the intersection of two halfspaces on {0,1}^n has threshold degree Omega(n), which matches the trivial upper…

Computational Complexity · Computer Science 2010-02-25 Alexander A. Sherstov

Let $T_n$ be the linear Hadamard convolution operator acting over Hardy space $H^q$, $1\le q\le\infty$. We call $T_n$ a best approximation-preserving operator (BAP operator) if $T_n(e_n)=e_n$, where $e_n(z):=z^n,$ and if $\|T_n(f)\|_q\le…

Complex Variables · Mathematics 2022-06-24 Fahreddin. G. Abdullayev , Viktor V. Savchuk , Maryna V. Savchuk

Given a porous compact $K \subset \mathbb{R}^d$ and a continuity modulus $\omega$, we prove a quantitative Jackson-Bernstein type theorem on harmonic approximation. That is, a function $f$ belongs to the class $\mathrm{Lip}_{\omega}(K)$ if…

Functional Analysis · Mathematics 2025-12-03 Nikolai A. Shirokov , Andrei V. Vasin

We provide a unified analysis of a posteriori and a priori error bounds for a broad class of discontinuous Galerkin and $C^0$-IP finite element approximations of fully nonlinear second-order elliptic Hamilton--Jacobi--Bellman and Isaacs…

Numerical Analysis · Mathematics 2021-03-24 Ellya L. Kawecki , Iain Smears

With any integer convex polytope $P\subset\midR^n$ we associate a multivariate hypergeometric polynomial whose set of exponents is $\midZ^{n}\cap P.$ This polynomial is defined uniquely up to a constant multiple and satisfies a holonomic…

Complex Variables · Mathematics 2016-12-05 D. V. Bogdanov , T. M. Sadykov

We give estimates for the approximation numbers of composition operators on $H^2$, in terms of some modulus of continuity. For symbols whose image is contained in a polygon, we get that these approximation numbers are dominated by $\e^{- c…

Functional Analysis · Mathematics 2012-06-07 Daniel Li , Hervé Queffélec , Luis Rodriguez-Piazza

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…

Algebraic Geometry · Mathematics 2010-11-09 Philippe Pebay , J. Maurice Rojas , David C. Thompson

Let $ D $ be a bounded Jordan domain and $ A $ be its complement on the Riemann sphere. We investigate the $ n $-th root asymptotic behavior in $ D $ of best rational approximants, in the uniform norm on $ A $, to functions holomorphic on $…

Complex Variables · Mathematics 2024-05-28 L. Baratchart , H. Stahl , M. Yattselev

We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…

Dynamical Systems · Mathematics 2023-08-15 Hans Oeri , David Goluskin

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

Combinatorics · Mathematics 2021-07-21 Gil Kalai , Leonard J. Schulman

For $p\ge 2$, and $\lambda>\max\{n|\tfrac 1p-\tfrac 12|-\tfrac12, 0\}$, we prove the pointwise convergence of cone multipliers, i.e. $$ \lim_{t\to\infty}T_t^\lambda(f)\to f \text{ a.e.},$$ where $f\in L^p(\mathbb R^n)$ satisfies $supp\…

Classical Analysis and ODEs · Mathematics 2024-05-07 Peng Chen , Danqing He , Xiaochun Li , Lixin Yan

We characterize functions of $d$-tuples of bounded operators on a Hilbert space that are uniformly approximable by free polynomials on balanced open sets.

Functional Analysis · Mathematics 2015-09-04 Jim Agler , John E. McCarthy

The $\epsilon$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this…

Computational Complexity · Computer Science 2014-03-25 Mark Bun , Justin Thaler

We show that if a polynomial $f\in \mathbb{R}[x_1,\ldots,x_n]$ is nonnegative on a closed basic semialgebraic set $X=\{x\in\mathbb{R}^n:g_1(x)\ge 0,\ldots,g_r (x)\ge 0\}$, where $g_1,\ldots,g_r\in\mathbb{R}[x_1,\ldots,x_n]$, then $f$ can be…

Algebraic Geometry · Mathematics 2015-07-23 Krzysztof Kurdyka , Stanisław Spodzieja

We consider a sequence $(p_n)_{n=1}^\infty$ of polynomials with uniformly bounded zeros and $\deg p_1\geq 1$, $\deg p_n\geq 2$ for $n\geq 2$, satisfying certain asymptotic conditions. We prove that the function sequence $\left(\frac{1}{\deg…

Complex Variables · Mathematics 2025-04-01 Marta Kosek , Malgorzata Stawiska

We consider discrete best approximation problems in the setting of tropical algebra, which is concerned with the theory and application of algebraic systems with idempotent operations. Given a set of input--output pairs of an unknown…

Numerical Analysis · Mathematics 2025-11-18 Nikolai Krivulin
‹ Prev 1 3 4 5 6 7 10 Next ›