中文
相关论文

相关论文: Best $\ell_1$-approximation of nonnegative polynom…

200 篇论文

We show that every real nonnegative polynomial $f$ can be approximated as closely as desired by a sequence of polynomials $\{f_\epsilon\}$ that are sums of squares. Each $f_\epsilon$ has a simple et explicit form in terms of $f$ and…

代数几何 · 数学 2007-05-23 Jean B. Lasserre

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…

代数几何 · 数学 2015-07-23 Krzysztof Kurdyka , Stanisław Spodzieja

We show that every real polynomial $f$ nonnegative on $[-1,1]^{n}$ can be approximated in the $l_{1}$-norm of coefficients, by a sequence of polynomials $\{f_{\ep r}\}$ that are sums of squares. This complements the existence of s.o.s.…

代数几何 · 数学 2007-05-23 Jean B. Lasserre , Tim Netzer

Let $E_n(f)_\mu$ be the error of best approximation by polynomials of degree at most $n$ in the space $L^2(\varpi_\mu, \mathbb{B}^d)$, where $\mathbb{B}^d$ is the unit ball in $\mathbb{R}^d$ and $\varpi_\mu(x) = (1-\|x\|^2)^\mu$ for $\mu >…

经典分析与常微分方程 · 数学 2017-05-03 Miguel Pinar , Yuan Xu

Motivated by recent work on optimal approximation by polynomials in the unit disk, we consider the following noncommutative approximation problem: for a polynomial $f$ in $d$ freely noncommuting arguments, find a free polynomial $p_n$, of…

泛函分析 · 数学 2022-09-22 Palak Arora , Meric Augat , Michael Jury , Meredith Sargent

With every real polynomial $f$, we associate a family $\{f_{\epsilon r}\}_{\epsilon, r}$ of real polynomials, in explicit form in terms of $f$ and the parameters $\epsilon>0,r\in N$, and such that $\Vert f-f_{\epsilon r}\Vert_1\to 0$ as…

代数几何 · 数学 2007-05-23 Jean B. Lasserre

In this paper, exact rate of decrease of best approximations of non-integer numbers by polynomials with integer coefficients of the growing exponentials is found on a disk in complex plane, on a cube in $\mathbb{R}^d$, and on a ball in…

经典分析与常微分方程 · 数学 2020-01-01 R. M. Trigub

We study how well functions over the boolean hypercube of the form $f_k(x)=(|x|-k)(|x|-k-1)$ can be approximated by sums of squares of low-degree polynomials, obtaining good bounds for the case of approximation in $\ell_{\infty}$-norm as…

计算复杂性 · 计算机科学 2016-03-09 Troy Lee , Anupam Prakash , Ronald de Wolf , Henry Yuen

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…

经典分析与常微分方程 · 数学 2008-08-08 Alexandre Eremenko , Peter Yuditskii

We study best approximation to a given function, in the least square sense on a subset of the unit circle, by polynomials of given degree which are pointwise bounded on the complementary subset. We show that the solution to this problem, as…

泛函分析 · 数学 2017-10-31 L Baratchart , Juliette Leblond , Fabien Seyfert

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.

复变函数 · 数学 2012-02-07 Alexandre Eremenko , Peter Yuditskii

We consider the sum-of-squares hierarchy of approximations for the problem of minimizing a polynomial $f$ over the boolean hypercube $\mathbb{B}^{n}=\{0,1\}^n$. This hierarchy provides for each integer $r \in \mathbb{N}$ a lower bound…

最优化与控制 · 数学 2022-01-20 Lucas Slot , Monique Laurent

Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like…

数论 · 数学 2007-05-23 T. D. Browning

The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…

泛函分析 · 数学 2020-05-19 Malik Saad Al-Muhja , Habibulla Akhadkulov , Nazihah Ahmad

We obtain the best approximation in $L^1(\R)$, by entire functions of exponential type, for a class of even functions that includes $e^{-\lambda|x|}$, where $\lambda >0$, $\log |x|$ and $|x|^{\alpha}$, where $-1 < \alpha < 1$. We also give…

经典分析与常微分方程 · 数学 2011-06-06 Emanuel Carneiro , Jeffrey D. Vaaler

We provide explicit conditions for a real polynomial $f$ of degree 2d to be a sum of squares (s.o.s.), stated only in terms of the coefficients of $f$, i.e. with no lifting. All conditions are simple and provide an explicit description of a…

代数几何 · 数学 2007-05-23 Jean B. Lasserre

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$.…

经典分析与常微分方程 · 数学 2022-01-19 Peter D. Dragnev , Alan R. Legg , Ramon Orive

Let $E_n(f)_{\alpha,\beta,\gamma}$ denote the error of best approximation by polynomials of degree at most $n$ in the space $L^2(\varpi_{\alpha,\beta,\gamma})$ on the triangle $\{(x,y): x, y \ge 0, x+y \le 1\}$, where…

经典分析与常微分方程 · 数学 2019-02-01 Han Feng , Christian Krattenthaler , Yuan Xu

Schleischitz [arXiv:1701.01129] determined exponents of best approximations to a strong Liouville number by integer polynomials and algebraic numbers of precribed degree. In this note, we show that we cannot extend his result to arbitrary…

数论 · 数学 2018-08-28 Tomohiro Ooto

We derive a three-term recurrence relation for computing the polynomial of best approximation in the uniform norm to $x^{-1}$ on a finite interval with positive endpoints. As application, we consider two-level methods for scalar elliptic…

数值分析 · 数学 2012-05-24 Johannes K. Kraus , Panayot S. Vassilevski , Ludmil T. Zikatanov
‹ 上一页 1 2 3 10 下一页 ›