The tag has no usage guidance.

learn more… | top users | synonyms

23
votes
1answer
474 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 1894, ...
21
votes
2answers
2k views

Accumulation of algebraic subvarieties: Near one subvariety there are many others (?)

Let's work over the field $\mathbb{C}$ of complex numbers, and let $X\subset \mathbb{P}^n$ be a projective variety. Let $\tilde{X}\subset \mathbb{P}^n$ be any small open neighborhood of $X$, in the ...
18
votes
1answer
4k views

The unreasonable effectiveness of Pade approximation

I am trying to get an intuitive feel for why the Pade approximation works so well. Given a truncated Taylor/Maclaurin series it "extrapolates" it beyond the radius of convergence. But what I can't ...
16
votes
1answer
1k views

Accumulation of algebraic subvarieties: Near one subvariety there are many others (?), 3

Part 3 of this series of questions. In the meantime, I realized that there is some very simple question that was left open in Accumulation of algebraic subvarieties: Near one subvariety there are many ...
13
votes
6answers
4k views

Solving NP problems in (usually) Polynomial time?

Just because a problem is NP-complete doesn't mean it can't be usually solved quickly. The best example of this is probably the traveling salesman problem, for which extraordinarily large instances ...
12
votes
4answers
604 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 ...
12
votes
5answers
902 views

Does this sequence span $L^2$?

Consider the following sequence of functions in $L^2[0,\infty)$: $$f_n(x)=e^{-x/n}x^n,\;\;n\geq 1$$ Does this sequence span $L^2[0,\infty)$ (that is, is the set of finite linear combinations of these ...
11
votes
4answers
805 views

Using Quotient of Prime Numbers to Approximation Reals

We know a positive rational number can be uniquely written as $m/n$ where $m$ and $n$ are coprime positive integers. Particularly, we can pick out those numbers with $m$ and $n$ both prime. Question ...
10
votes
2answers
705 views

A “better” rational approximation of pi?

$355/113$ is a good fractional approximation of $\pi$, because we use six digits to produce seven correct digits of $\pi$. $$\frac{355}{113} = 3.1415929\ldots$$ Let $R$ be the ratio of the number of ...
10
votes
1answer
740 views

Accumulation of algebraic subvarieties: Near one subvariety there are many others (?), 2

This is a sequel to the question Accumulation of algebraic subvarieties: Near one subvariety there are many others (?) . Let $Y$ be some projective variety, over $\mathbb{C}$. Let $X\subset Y$ be ...
10
votes
1answer
674 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. ...
10
votes
0answers
390 views

Functions approximated by rolling epicycle curves

Imagine a decreasing sequence of (positive) radii $r_1 > r_2 > r_3 > \cdots$ and a series of nested circles $C_1 \supset C_2 \supset C_3 \supset \cdots$ with these radii, initially each ...
9
votes
2answers
196 views

A generalization of Chebyshev polynomials

What is the monic polynomial $p(x)$ of degree $n$ which minimizes $\max_{x \in [-1,1]} |p(x)|$? The answer is the Chebyshev polynomial, and its largest value on $[-1,1]$ is $1/2^{n-1}$. Now suppose ...
9
votes
1answer
708 views

Approximating a convex function by a piecewise linear function

Suppose I have a Lipschitz-continuous convex function $f:\mathbb{R}^n\rightarrow \mathbb{R}$. I wish to approximate it on the unit ball by a piecewise-linear function $g:\mathbb{R}^n\rightarrow ...
8
votes
2answers
629 views

Approximation by polynomials

Let $f:[a,b] \rightarrow \mathbb{R}$ be of class $C^n$. Let $ x_0, ..., x_m$ be different numbers from $[a,b]$. Does for each $\varepsilon >0$ there exist a polynom $P$ such that ...
8
votes
3answers
643 views

Approximating with translated Gaussians and low-frequency trig functions

Defining the translated Gaussians by $f_t(x)=\exp(-(x-t)^2)$ for $t,x\in\Bbb{R}$, we showed that the linear span of $\{f_t \mid 0 \le t < \epsilon\}$ is dense in $L^2(\Bbb{R})$, for any ...
8
votes
3answers
481 views

Degree necessary of a polynomial?

Given $-1<a<b<0$, I want to find a polynomial $f(x)\in\Bbb R[x]$ such that $f(x)\in[a,b]$ at every $x\in[b^2,a^2]$ and $f(0)=0$. What is minimum degree that is needed and maximum degree that ...
8
votes
0answers
376 views

Padé approximations of $e$

The following question came up in the analysis of some algorithm. Let $R_{s,t}(z)$ be the Padé approximants of $e^z$, and define $r_{s,t} = R_{s,t}(1)$. Using the explicit expression for the error ...
7
votes
3answers
1k views

Kronecker Approximation theorem and Fibonacci numbers

There is a famous old theorem by Kronecker that for every positive real $\alpha$ and $\epsilon>0$ there exists a positive integer n such that $\alpha n$ is within $\epsilon$ of an integer. ...
7
votes
3answers
945 views

Uniform approximation of $x^n$ by a degree $d$ polynomial: estimating the error

The answer to this question should be well known, but it's a hard question to search for online. Suppose we want to approximate the function $x^n$ by a polynomial of degree $d$ in the $L_\infty$ norm ...
7
votes
4answers
4k views

Approximation with continuous functions

Is it true that for every function $\mathbb{R} \to \mathbb{R}$ there exists a sequence of continuous functions $f_n(x): \mathbb{R} \to \mathbb{R}$ such that for any $x \in \mathbb{R}$ $f_n(x)$ ...
7
votes
4answers
960 views

A senseful meaning of 'approximation of manifolds'?

Any continuous function can be uniformly approximated by smooth functions. I would like to have something similar - in what-ever sense - for continuous manifolds. For example, by Whitney's theorem, ...
7
votes
2answers
473 views

polynomials with minimal $L_\infty$ norm on multiple disjoint intervals

It is well-known that Chebyshev polynomials are the polynomials of minimal $L_\infty$ norm on [-1,1] with leading coefficient 1. But what if you want the minimal $L_\infty$ polynomial on two disjoint ...
7
votes
2answers
3k views

approximate a probability distribution by moment matching

Suppose we want to approximate a real-valued random variable $X$ by a discrete random variable $Z$ with finitely many atoms. Suppose all moments of $X$ is finite. We want to match the moments of $X$ ...
7
votes
1answer
205 views

Approximation theory on the disc

Chebyshev theory provides a very effective method for approximating continuous real valued functions on the unit interval. Is there something similar for continuous real valued functions on the ...
7
votes
0answers
119 views

On derivatives of polynomials majorized by $\max(1,|x|^d)$

In the course of generalizing the Bernstein-Markov theorem to normed space, Harris came up with the following question. Suppose that $p$ is a real polynomial satisfying $|p(x)| \leq (1+|x|)^d$. ...
6
votes
5answers
2k 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 ...
6
votes
2answers
947 views

Approximating erf by tanh

It appears to be well-known that $\tanh(x)\le \mathrm{erf}(x)$ on $[0,\infty)$. It's off-handedly mentioned here, for example. Where can I find a formal proof? On the one hand, it's hard to imagine ...
6
votes
1answer
473 views

Stone-Weierstrass analogue for $L^p$

Let $A$ be a complex algebra of bounded measurable functions on the measure space $(X,\mu)$ (case of $[0,1]$ with Lebesgue measure is enough for me) closed under conjugation. Assume that $A$ separates ...
6
votes
2answers
1k views

Efficient approximation of a matrix and its inverse

Assume that $ A $ is a real $ n\times n $ matrix whose rows constitute an orthonormal basis of $ \mathbb R^n $. Informal statement of question: Assume we want to approximate $ A $ by a rational ...
6
votes
1answer
192 views

Approximating an iteratively defined function

Let $f_0,f_1,\ldots$ be a sequence of functions $f_n : [0,1] \rightarrow R$ defined as follows: $$f_0(x) =1+2x$$ $$f_{n}(x) := \left\{\frac{5+t}{2} : \text{ where t solves } ...
6
votes
2answers
880 views

Non-linear “Fourier analysis”

Call a function of the following form a beep: $e^{-(\frac{x-\alpha}{\beta})^2}\sin(\rho x+\theta)$. Given a real-valued function $f\in L^2(R)$ and a number $n$, I'm interested in the approximating ...
6
votes
1answer
151 views

$W^{1,1}$ simplicial approximation

Let $f$ be a continuous real-valued function defined on an $n$ dimesional simplex $\Sigma\subset \mathbb{R}^n $. The classical simplicial approximation scheme provides a sequence $f_k$ of piecewise ...
6
votes
1answer
49 views

Polynomial interpolation of binary word signal

Let consider a binary word $x_1 \ldots x_n$ (finite sequence of elements of $\{0,1\}$. I want to construct a polynomial $P$ that interpolates the points $(i, x_i)$ for $i \in \{1\ldots n\}$ , such ...
6
votes
0answers
200 views

Approximating Lie groups by finite groups

How can one approximate compact Lie groups by finite groups? My wish is something like this: Let $G$ be a compact Lie group. There is a sequence of nested finite subgroups $G_n$ so that $G_n\to ...
6
votes
0answers
219 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} ...
6
votes
0answers
434 views

convergence rate in Wiener's approximation theorem

Wiener has the following fantastic results about approximations using translation families: Given a function $h: \mathbb{R} \to \mathbb{R}$, the set $\{\sum a_i h(\cdot - x_i): a_i, x_i \in ...
5
votes
6answers
818 views

best approximation to the LambertW(x) or exp(LambertW(x))

what is the best available approximation ( say up to 10 digits ) for LambertW(x) or exp(LambertW(x)) for x > 2000
5
votes
4answers
2k views

Approximation by exponential polynomials

Let $u(t) = \Sigma_{k=1}^n c_k e^{\lambda_k t} (c_k \in \mathbb C, \lambda_k \in \mathbb C) $ be an exponential polynomial of $\underline{order}$ $n$. Define $E_n$ to be the collection of all ...
5
votes
1answer
487 views

Is there a continuous function $f$ satisfying the following Zygmund condition but not differentiable.

Suppose that a continuous function $f$ on the line and satisfies $$ |f(x+2h)−2f(x+h)+f(x)|\leq const \frac{|h|}{(\log\frac{1}{|h|})^{\beta}}\,\,\,\,\,\,\text{where}\,\,\,\, \beta \in(0, 1] $$ ...
5
votes
2answers
650 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 ...
5
votes
1answer
178 views

Jackson's theorem for partial sum of Fourier series

There is a classical theorem of Jackson stating that the $N$-th partial sum $S_N f$ of the Fourier series of a Lipschitz continuous function $f$ (which is periodic with period 1) satisfies $$ |f(x) - ...
5
votes
1answer
312 views

Are piecewise linear curves dense among Hölder curves?

Consider for some $0 < \alpha \leq 1$ the space functions $x:[0,1] \to \mathbb{R}^n$ such that $x(0) = 0$ and $\sup_{s,t} \frac{\|f(t)-f(s)\|}{|t-s|^{\alpha}}$ is finite. There are at least two ...
5
votes
2answers
649 views

Polynomial approximation in L^p norms

Hello, I am very new to the field of approximation theory, and since an extended search on the Internet did not provide answers for two rather basic questions, I decided to ask them here. 1) From ...
5
votes
1answer
298 views

Sparse approximate representation of a collection of vectors

Suppose I have a collection of $n$ vectors $C \subset \mathbb{F}_2^n$. They are of course spanned by the canonical set of $n$ basis vectors. What I would like to find is a much smaller (~ $\log n$) ...
5
votes
2answers
84 views

Accuracy of the truncated Hausdorff moment problem

For a sequence of real numbers $s = (s_i)_{i \in n}$ let $M_s$ be the collection of functions $f:[0,1] \to [0,1]$ such that $$(\forall i \leq n) \int_0^1 x^i f(x) dx = s_i$$ In other words, $M_s$ ...
5
votes
1answer
176 views

Are polynomials dense in holomorphic $L^p(\mathrm{Gauss})$ for $p < 1$?

Let $\mu$ be standard Gaussian measure on $\mathbb{C}^n$, i.e. $d\mu = \frac{1}{(2 \pi)^n} e^{-|z|^2/2}\,dz$, and fix $0 < p < 1$ (note carefully). Suppose $g$ is holomorphic on ...
5
votes
1answer
117 views

Simultaneous approximation of arbitrary functions in Hölder space and in $L^2(\mu)$ by a smooth function and its derivative

Let $\mu$ be a probability measure on the circle $S^1=\mathbb{R}/\mathbb{Z}$ which is singular with respect to the Lebesgue measure $\lambda$. Consider the functions spaces $L^2(\mu)$ on the one hand, ...
5
votes
2answers
899 views

L1 distance from a trigonometric susbspace

How to check, whether the $L^{1}$ distance between a finite exponential sum $S_{F}(x)=\sum\limits_{n\in F} \exp(inx)$ and the $L^{1}$-closure of subspace $\mathrm{span}\left(\exp(inx): n\in ...
5
votes
0answers
168 views

Degree of Chebyshev polynomial necessary

In general, given $0<a<1$, I want to find a polynomial $f(x)\in\Bbb R[x]$ such that $f(x)\in[1-\frac{a}2,1+\frac{a}2]$ at every $x\in[1-a,1+a]$ and $f(0)=0$. What is minimum degree that is ...