The tag has no wiki summary.

learn more… | top users | synonyms

4
votes
1answer
120 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 ...
2
votes
0answers
190 views

Is there an absolutely continuous function $f$

Is there an absolutely continuous function $f$ satisfying $$ |f(x+\delta)+f(x-\delta)-2f(x)|\leq \mbox{const}\frac{|\delta|}{\log \frac{1}{|\delta|}},\,\,\, |\delta|<1, $$ which is not $C^{1}$?
6
votes
0answers
118 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$. ...
2
votes
0answers
39 views

Norms of B-spline coefficients

In Shumaker's book (Spline Functions: Basic Theory), we know that the $l^\infty$-norm of B-spline coefficients is bounded above and below by the $L^\infty$-norm of the spline itself. Are there similar ...
1
vote
1answer
174 views

What's the asymptotic behavior of this function at large distance? [closed]

This question is based on some Physics motivation. Define a distance function $f(\mathbf{r})=\int_{\Omega }d^2k\int_{\Omega }d^2q \cos[(\mathbf{k}-\mathbf{q})\cdot\mathbf{r}]$, where ...
1
vote
1answer
213 views

Approximation of a given function by rational functions

Given a function $1/\sqrt{x^2 -k^2}$ where k is a constant with a small imaginary part, how do you go about constructing a rational approximation? I am interested in the L_p (p=2 or $\infty$) norm of ...
4
votes
1answer
441 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] $$ ...
1
vote
0answers
78 views

The $d$-dimension extension of Bernoulli Polynomial

It is known that Bernoulli polynomial has the following Fourier expansion: \begin{equation*} B_{2n}(x) = \frac{(-1)^{n-1}2(2n)!}{(2\pi)^{2n}}\sum_{k=1}^{\infty}\frac{\cos(2k\pi x)}{k^{2n}}. ...
2
votes
0answers
128 views

Rational interpolation: Error bounds for coefficients

The following question was asked on MSE, but might be more suitable here. Assume there is a rational function $$ f:x\mapsto \frac{\sum_{i=0}^m{a_ix^i}}{1+\sum_{j=1}^n{b_jx^j}} $$ of type $(m,n)$ with ...
2
votes
2answers
145 views

Non-global oscillation of banded Fourier transform

Can we say something like monotonicity, growth rate and oscillation of the Fourier transform of a banded function $f$ with support $[0, N]$ $$\mathcal{F}f(\xi) = \int_{0}^N f(x)e^{-ix\xi}dx.$$ Of ...
2
votes
1answer
161 views

Approximation Runge's Theorem

Let $X$ be a Riemann Surface and $K$ a compact subset of $X$. Every holomorphic function in $K$ be uniformly approximable on $K$ by holomorphic functions on $X$ if $X-K$ have no connected component ...
2
votes
0answers
103 views

On Artin-Hironaka lemma and Galois theory

Let $A=k[[t]]$ Let $B$ a flat $A$-finite algebra which is etale and Galois at the generic point. Then by Artin lemma 3.12 (ii) in his IHES paper on approximation, we know that there exists an integer ...
0
votes
3answers
246 views

Approximating higher dimension step function

Let $s \in R^{n}$ (meaning $s$ is $n \times 1$ vector), where $n$ is the dimension of the vector. The ideal sliding term, $\nu$ is taken to be: \begin{equation} \nu = \frac{s}{\|s\|} ...
4
votes
1answer
297 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 ...
3
votes
1answer
506 views

Estimate on sum of squares of multinomial coefficients

I am interested in approximating the sum of the squares of the multinomial coefficients, i.e. $a_\ell^p := \sum_{k_0+\ldots+k_p = \ell} (\frac{\ell!}{k_0! \ldots k_p!})^2$ or more general, ...
1
vote
1answer
98 views

Approximating rational generating functions

Suppose we have a initial segment $x_1,\ldots,x_N$ (for reasonably large $N$) of a sequence of natural numbers $(x_i)$. We have reason to believe the generating function $\sum_{i=0}^\infty x_iX^i$ is ...
1
vote
0answers
63 views

Jackson inequality for a nonpolynomial basis

Hi everybody, this is my first question.$L^2$,$H^p$ are the standard Lebesgue,Sobolev spaces here, and I am deliberately omitting the domains because I'll accept an answer if it's on an interval or a ...
1
vote
0answers
103 views

Spectral norm for a truncated Hilbert matrix

Let $T_{N}$ be the (Hilbert) matrix defined by $T_{N}(m,n)=\frac{1}{m-n}$ if $1\leq m,n \leq N$ and $m\neq n$ , and $ T_{N}(n,n)=0$ if $1\leq n \leq N$ . It's well known that $\Vert T_{N}\Vert < ...
3
votes
1answer
183 views

Is the Binomial Expectation of a Multivariate Convex Function Convex in the Vector p?

Let $\mathbf{p}=(p_1,\dots,p_m)$ be a vector in $[0,1]^m$ and let $\mathbf{X}=(X_1,\dots,X_m)$ be a vector of independently-distributed binomial random variables such that $X_i\sim ...
0
votes
0answers
95 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 ...
5
votes
0answers
253 views

Approximation by polynomials

The following is a well-known theorem (see e.g. The Chebyshev Polynomial by Rivlin): If $p(x) = x^n + a_{n_1} x^{n-1} + \ldots + a_0$, then $\max_{-1\leq x \leq 1} |p(x)| \geq 2^{1-n}$ for $n \geq 1$ ...
14
votes
1answer
2k 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 ...
20
votes
1answer
370 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, ...
2
votes
1answer
219 views

Approximation theory under $L_1$-error

Is there a reference for results in approximation theory of bounded functions of one (and multiple) variables under $L_1$-error? Formal definitions for functions of one variable are below. Let $C$ ...
3
votes
1answer
318 views

Lebesgue constant as condition number of polynomial interpolation

Let $T = \{ x_0,\ldots,x_n \}$ be a set of $n+1$ different points in the real interval $[a,b]$. Let $X_T$ be the associated interpolation operator on $C[a,b]$: it takes a function $f \in C[a,b]$ into ...
-1
votes
2answers
440 views

Approximating a subspace by sampling a base without replacement

Let $X$ be a $p \times n$ matrix, with $p > n$. Now, suppose I sample $m < n$ columns from $X$ at random, without replacement. I would like to characterize the distance between the subspace ...
6
votes
2answers
786 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 ...
11
votes
4answers
711 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 ...
2
votes
2answers
346 views

Convex upper bound on a linear-fractional function

I have a function of the form $f(x,y) = \frac{x}{c+y}$ where $c$ is a positive constant, $c \ge x \ge 0$, and $y \ge 0$. I would like to find a convex upper-bound for this function. Is there a ...
4
votes
4answers
892 views

When we use Bernstein polynomials in application

When it is preferable to use Bernstein polynomials to approximate a continuous function instead of using the only following preliminary Numerical Analysis methods: "Lagrange Polynomials", "Simple ...
2
votes
1answer
164 views

Approximation power of wavelets

The Wikipedia article on Wavelet Transform states that: Wavelet compression is not good for all kinds of data: transient signal characteristics mean good wavelet compression, while smooth, ...
0
votes
0answers
66 views

approximation in Lie algebras

Let $x_{1}$, $x_{2}$, $x_{3}$ three disctinct closed points of a curve $X$ over an algebraically closed field k. Let G a connected reductive group and $\mathfrak{g}$ his Lie algebra. I fix a Borel ...
1
vote
0answers
128 views

Decay rate of the singular values of functions

Suppose a function $f:[-1,1]^2\rightarrow \mathbb{C}$ has a singular value decomposition: $$ f(x,y) = \sum_{k=1}^\infty \sigma_k u_k(y) v_k(x), \qquad \sum_{k=1}^\infty \sigma_k^2 <\infty, $$ ...
2
votes
0answers
120 views

A.G. Vitushkin's “Easily representable families of functions” - can it be generalized?

Background In his monograph "Estimation of the complexity of the tabulation problem" (translated into English as "Theory of the Transmission and Processing of Information") Vitushkin studies ...
2
votes
0answers
146 views

Worst-case error and Cramer-Rao Lower Bound - is there any mathematical relation between them?

I would like to understand the relation (if any) between the Cramer-Rao Lower Bound of estimation theory and the following simple definition of "reconstruction accuracy" which doesn't use any ...
2
votes
2answers
391 views

Sampling without replacement until hitting a subset

I randomly sample uniformly from $ \{1,..,N \}$ without replacement until drawing a number $ \leq k$. Denote the expected number of draws by $R(N,k)$. I want a good approximation for $\sum_{k=1}^N ...
2
votes
2answers
465 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 ...
8
votes
1answer
598 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 ...
2
votes
1answer
208 views

Bound on trigonometric sum

I want to show that there is some $\gamma(n)=o(n^{-1})$ and some $C(n) \to -\infty$ such that for $\gamma \leq \theta \leq \pi$ we have $\sum_{k=1}^n -1+\cos(k\theta) \leq C(n)$. If we rewrite this ...
1
vote
2answers
232 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 ...
0
votes
0answers
165 views

A differentiable approximation to the minimum function over a vector of reals

In A differentiable approximation to the minimum function, a differentiable approximation of the minimum function is given, but it seems it only works for positive reals. Is there an ...
1
vote
1answer
153 views

Approximating $\prod_{i=1}^{n-1} (1-ai)$ for large $n$

I have a function of the form: $f(n) = \prod_{i=1}^{n-1} (1-ai)$ Here, $a \geq 0$ and $(a*i) < 1$. For $n > 10^5$ or $10^6$, what is the best possible analytic approximation for $f(n)$ that ...
1
vote
3answers
200 views

Algebraic curve approximation

I am wondering wether it exists a theorem that any continuous path on the plane one can approximate with algebraic curve $P(x,y)=0$ ($P$- is a polynom)?
1
vote
1answer
109 views
6
votes
1answer
147 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 ...
4
votes
3answers
410 views

Approximation theory reference for a bounded polynomial having bounded coefficients

Let $P(x)$ be a real polynomial of degree at most $d$. Assume $|P(x)| \leq 1$ for $|x| \leq 1$. I would like a bound saying that each coefficient of $P(x)$ is at most $C^d$ in magnitude, for some ...
6
votes
1answer
459 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 ...
5
votes
0answers
144 views

what books to read to quickly understand adiabatic approximation

Hi group, I'm a theoretical ecologist with fairly adequate training in applied math (ODE, linear algebra, applied probability, some PDEs). In my current work, I've encountered the use of adiabatic ...
2
votes
1answer
373 views

A question about the Beurling-Selberg majorant

Beurling's majorant is defined as the unique entire function $B(z)$ such that the Fourier transform of $B(x)$ is compactly supported in the interval $[-1;1]$, $B(x) \geq \text{sgn}(x)$ and $B(x)$ ...
2
votes
2answers
154 views

approximation of holomorphic functions on a halfplane.

Let $\mathbb {C} _ + $ denote the right halfplane and $A$ the algebra $$ A = \{ f \in H^\infty({\mathbb C} _ +) \cap C(\overline{{\mathbb C} _ +}): \; |f(z)| \le M (1+|z|)^{-\epsilon} \text{ ...