2
votes
1answer
74 views

using polynomials as lower / upper bound?

I'm interested in the question of given a differentiable and bounded function $f(\vec{x})$ (over a single variable or multiple variables, over a bounded domain $D$), finding a pair of polynomials ...
1
vote
0answers
32 views

Truncation error in Padè approximants

Suppose only the following data are known about a rational function $R(x)=P(x)/Q(x)$ (for $P,Q$ polynomials): (a) the degree of $P$ is $\leq m$ and the degree of $Q$ is $\leq n$; (b) the first $k$ ...
4
votes
0answers
107 views

The closures in $C^0(\mathbb C,\mathbb C)$ of the set of integer valued polynomials

This question is closely related to the thread The closures in $C^0(\mathbb R,\mathbb R)$ of the set of integer valued polynomials, resp, of polynomials with integer coefficients. (Recall that a ...
1
vote
1answer
80 views

Polynomials are dense in $A_{B(0,1)}$

Let $D(0,1)$ be the disk of center 0 and radius 1 and call $A_{D(0,1)}= \{ f:\overline{D(0,1)} \rightarrow \mathbb{C} : f \text{ is continuous and } f|_{D(0,1)} \text{ is holomorphic} \}$. Can ...
0
votes
0answers
31 views

Threshold approximation with positive coefficients polynomials

Consider the family of polynomials $\{p_n\}$, each of degree $n$, such that for every polynomial $p = \sum_{i}c_{i}x^{i}$, $c_i \ge 0$ for every $i$ and $\sum_{i}c_i = 1$. Let $T$ be the ...
4
votes
1answer
113 views

Do interpolation nodes have to be dense?

Let $f(x) = \exp(x)$ and $(\xi_i)_{i=0}^\infty, \, \xi_i \in (0,1)$ be a sequence of points from the unit interval. For $n \in \mathbb{N}$ let $P_n$ be a polynomial of degree $n$ that interpolates ...
3
votes
1answer
253 views

Multivariate polynomial approximation of smooth functions

Let $f$ be a function defined on $[-1,1]^d$. Assume that all partial derivatives of $f$ up to order $r$ are continuous; and the $\infty$-norm of these partial derivatives are uniformly upper bounded ...
0
votes
0answers
91 views

Two Different Representations of Multivariate Bernstein Polynomials

In the literature the multivariate Bernstein polynomial of a function $f:[0,1]^m\rightarrow\mathbb{R}$ is often defined as the following: $$B_{f,n}(x_1,\dots,x_m)=\sum_{\mathbf{k}\in ...
11
votes
0answers
156 views

Hilbert's Theorem on $L_2$ norm of polynomials in $\mathbb{Z}[X]$ - Explicit construction and a converse?

Consider the set of polynomials with real coefficients as a vector space with the following inner-product: $\langle f, g \rangle = \int_{a}^{b} f(x)g(x) dx$. Hilbert showed, in a paper from 1893, ...
2
votes
2answers
439 views

Multivariate Bernstein polynomials for approximation of derivatives.

If I have a $C^\infty$ function $f: [0,1]^n \to \mathbb{R}$ then its Bernstein polynomials $$ B_m(x) = \sum_{k_1,\dots,k_n=0}^m f\left(\frac{k_1}{m}, \dots, \frac{k_m}{m}\right) \prod_{i=1}^n ...
1
vote
2answers
220 views

Approximation by polynom 1) with respect to supremum-norm 2) I need F_{approx} > F_{exact}

Given a function F, how to find polynom which is best/good approximate with respect supreremum-norm, i.e. minimize over P_{approx} sup|F-P_{approx}| ? I am intersted in polynoms in two variables of ...
5
votes
5answers
1k views

Application of polynomials with non-negative coefficients

Question 1: Are there any deeper applications (in any field of mathematics) of polynomials (with possibly more than one variable) over the real numbers whose coefficients are non-negative? So far I ...
5
votes
2answers
563 views

Stone-Weierstrass for monotone functions

Let $\; f : [0,1] \to \mathbb{R} \;$ be continuous and non-decreasing. $\;\;$ Let $\epsilon$ be a real number such that $\; 0 < \epsilon \;$. Does it follow that that there exists a real ...
2
votes
0answers
170 views

Markov-type inequalities with arbitrary exponents

By a Markov-type inequality I mean an inequality of the form $$ \| p^{(k)} \| \leq \lambda_{k,n} \| p \|,\quad \forall p \in U_n, $$ for some $\lambda_{k,n} > 0$, where $U_n \subset L^\infty[-1,1]$ ...
4
votes
1answer
408 views

Low degree polynomial approximation for the entropy function

Let $X$ be a discrete random variable with possible values $\{x_1,\ldots,x_n\}$, and let $p$ denote the probability mass function of $X$. In addition, denote $p_i=p(x_i)$. The entropy of $X$ is ...
0
votes
1answer
191 views

Low degree approximation of the polynomial extension of the logical-or function

Let $x\in\{0,1\}^n$ be a binary vector of dimension $n$, and let $OR(x)$ be the "logical or" function (i.e., returns $1$ if at least one of the coordinates is $1$ and otherwise returns $0$). Consider ...
9
votes
1answer
649 views

The closures in $C^0(\mathbb{R}, \mathbb{R})$ of the set of integer valued polynomials, resp, of polynomials with integer coefficients

This is a follow up of an interesting recent question on the topic. The answer given there by fedia shows that the matter is rich and complicated, and I can't resist to submit here a further question. ...
5
votes
0answers
211 views

Polynomial upper approximation with respect to the Gaussian measure

Let $f = 1_{[a,+\infty)}$ be the indicator function of a half-line. Does there exist a sequence $(P_n)$ of polynomials such that $f(x) \leq P_n(x)$ for every real $x$ and $$ \lim_{n\to \infty} ...
2
votes
5answers
1k views

Relative error approximation by polynomials

For given continuous real functions $f$ and $g$ defined on $[-1,1]$, let's define $$ D(f,g) = \sup_{x \in [-1,1]} \left|{\frac{f(x)-g(x)}{f(x)}}\right| $$ (in this context, let's take $0/0$ to be $0$ ...
10
votes
4answers
506 views

Finite interpolation by a nondecreasing polynomial

Let $x_1 < x_2 < \ldots < x_n$ and $y_1 < y_2 < \ldots < y_n$ be two sequences of $n$ real numbers. It is well known that there are polynomials that "interpolate" in that ...