All Questions
Tagged with real-analysis approximation-theory
118 questions
1
vote
0
answers
42
views
Approximation of the function $f(z)=z^2/|z|$ by $C^1$ immersions
Let $D$ denote the unit disk in $\mathbb C=\mathbb R^2$. We consider the function $f:D\rightarrow\mathbb C $ defined by $$f(z):=\frac{z^2}{|z|}.$$ Then as proved in Global invertibility (p324 Remark 4)...
- 435
2
votes
0
answers
120
views
On mollifiers acting between $L^2$ and Sobolev spaces
(I'm reposting here this question from MSE as it didn't receive any answer for two weeks.)
Consider a sequence of finite lattices in $\mathbb{R}^n$ defined by
$$L_k= [-k,k]^n \cap 2^{-k}\cdot \mathbb{...
- 505
3
votes
1
answer
157
views
How can discrete Fourier transform approximation prove the completeness of complex exponentials in $L^2(T)$?
I have a question about the completeness of complex exponentials in function spaces.
For the discrete set $ S = \{1, 2, \ldots, n\} $, it is clear and intuitive that $ e^{2\pi ikx/n} $ for $ k = 0, 1, ...
- 807
1
vote
0
answers
100
views
Difference of two completely monotonic functions
We know by the Hausdorff-Bernstein-Widder theorem that any completely monotonic function on the positive half line $[0, \infty)$ is given by the Laplace transform of a positive Borel measure on $[0, \...
3
votes
0
answers
318
views
The curse of dimensionality of the Kolmogorov–Arnold neural network
The Kolmogorov–Arnold neural networks (KAN), Ziming Liu et al., KAN: Kolmogorov–Arnold Networks is inspired by the Kolmogorov–Arnold representation theorem (KA theorem). Though it is not proved in the ...
- 2,239
0
votes
0
answers
128
views
Lipschitz function approximated by smooth functions with zero a regular value
Consider a Lipschitz function $f:\mathbb{R}^n\to\mathbb{R}$. Then I want a family of smooth functions $f_\epsilon : \mathbb{R}^n\to\mathbb{R}$, such that $f_\epsilon\to f$ uniformly on compact sets, ...
- 1,090
0
votes
0
answers
96
views
Hilbert spaces that include algebraic polynomials
This question is motivated by a phrase I found in several books/papers about approximation theory, for example, M.J.D.Powell's Approximation Theory and Methods: ''Let $\mathcal{H}$ be a Hilbert space ...
- 1
1
vote
1
answer
127
views
approximating differentiable functions with double trigonometric polynomials
Let $Q = [0,1]^2$. For sake of notation, let
$$
f^{(i,j)}(x,\xi) = \frac{\partial^{i+j}}{\partial x^i \partial \xi^j}f(x,\xi).
$$
Fix some non-negative integer $k$. Moreover let $f\in C^k(Q)$ if
$$
\|...
- 171
0
votes
0
answers
28
views
Metric entropy of mixed norm spaces with exponent-free bounds
Suppose $\mathcal{F}\subset L^p([0,1]^d)$ is a subset with the following property: The $L^q$-covering number of $\mathcal{F}$ is independent of $q$, for all $1\le q\le\infty$. An example of $\mathcal{...
- 21
2
votes
0
answers
159
views
Upper bound of a product of sines
Consider the function
$$ f_n(t)= \prod_{1 \leq k \leq n-1,\\ \gcd(k,n)=1} \sin\Big(t-\frac{k \pi}{n}\Big),\quad t \in [0,\pi].$$
I wonder whether it is possible to compute some nontrivial upper ...
- 826
1
vote
1
answer
143
views
$L^1$ error between indicator function and smoothed out version
For a large parameter $r>0$, consider the indicator function $1_{[-r,r]}$ and its convolution with the (normalized) Gaussian $\frac{1}{\sqrt{\pi}}e^{-x^2}$, that is,
$$f_r(x) = \frac{1}{\sqrt{\pi}}\...
- 101
2
votes
1
answer
161
views
Smooth approximation of nonnegative, nondecreasing, concave functions
Let $f\colon [0, \infty)\to\mathbb{R}$ be nonnegative, nondecreasing, and concave. Prove the following claim or give a counter example: There is a sequence of functions $f_n\colon [0, \infty)\to\...
- 63
2
votes
1
answer
433
views
Stone-Weierstrass theorem: coefficients of approximating sequence bounded?
Let $X$ be a compact Hausdorff space and $\mathcal{A}$ be a subalgebra of $C(X;\mathbb{R})$.
The Stone-Weierstrass theorem asserts that if $\mathcal{A}$ contains the constants and separates the points ...
- 463
11
votes
1
answer
1k
views
New method to compute square roots [closed]
In 2011 when I was in school I created a formula to calculate square roots... For $x\in\mathbb{R}$ with $x>0$ the following holds:
$$\sqrt{x} = \sum_{n=0}^{\infty}\frac{\left(\prod_{k=1}^{n}\left(\...
- 53
0
votes
0
answers
107
views
$\log$-classes of irrationals
Let $\mathbb{N}$ denote the set of non-negative integers. For $A\subseteq \mathbb{N}$ we let the (upper) density of $A$ be defined by $d^+(A) = \lim\sup_{n\to\infty} \frac {|A\cap \{0,\ldots, n\}|}{n+...
- 48.9k
2
votes
0
answers
147
views
"Almost rational" irrational
This is a follow-up to an older question.
Let $r\in \mathbb{R}\setminus\mathbb{Q}$, let $\mathbb{N}$ denote the set of non-negative integers and let $\mathbb{N}_+=\mathbb{N}\setminus\{0\}$. For $n\in\...
- 48.9k
8
votes
1
answer
273
views
Smooth approximation of Hölder functions "from below"
We assume that we have a $\alpha$-Hölder continuous function $f$ on an interval $[0,1].$
I am wondering if there exists an explicit construction of a sequence $f_{n} \in C_c^{\infty}(\mathbb R)$ such ...
8
votes
3
answers
545
views
Approximation of pseudogeometric progression
Let $f_n(x)=1+x+x^{\sqrt{2}}+x^{\sqrt{3}}+x^{\sqrt{4}}+\cdots+x^{\sqrt{n}}$ be a sequence of functions on the interval $[0, 1]$. Is there a good closed form approximation for such a function ( ...
- 728
5
votes
2
answers
708
views
Approximation of Hölder continuous functions "from below"
We assume that we have a $\alpha$-Hölder continuous function $f$ on an interval $[0,1]$ with $f(0)=0$.
I am wondering if there exists an explicit construction of a sequence $f_{n} \in C_c^{\infty}(\...
4
votes
1
answer
642
views
Explicit and fast error bounds for approximating continuous functions
Main Question
This question is about finding explicit, calculable, and fast error bounds (no hidden constants) when approximating continuous functions with polynomials or simpler functions to a user-...
- 697
2
votes
1
answer
76
views
Zeros in $[0,1]$ of functions $f \in \mathrm{span} \{ p(x - \lambda_k)e^{\lambda_k x} : k=1,\dots, n \}$
Let $n \in \mathbb N$, let $p:\mathbb R \to \mathbb R$ be a real polynomial, and let $\lambda_1< \lambda_2 <\dots < \lambda_n$. Now let
$$
f \in \mathrm{span} \left \{ p(x - \lambda_k)e^{\...
- 190
2
votes
1
answer
215
views
Measuring how "close" $\alpha\in[0,1]\setminus\mathbb{Q}$ is to being rational
Let $\mathbb{N}_+$ denote the set of positive integers and let $\mathbb{N}_0 = \mathbb{N}_+\cup\{0\}$. Fix $\alpha\in[0,1]\setminus \mathbb{Q}$. For $n\in\mathbb{N}_+$ we let the approximation radius ...
- 48.9k
1
vote
2
answers
107
views
Measurability of Brjuno numbers
A positive irrational number $\alpha\in{\mathbb R}\setminus {\mathbb Q}$ is said to be a Brjuno number if $$\sum_{i=1}^\infty\frac{\log q_{i+1}}{q_i} < \infty$$ where $q_i>0$ is the denominator ...
- 48.9k
1
vote
0
answers
216
views
Is there an approximate formula for this summation function?
Consider the function $$\sum_{n=1}^\infty \frac{\cos(nx)}{n^r},$$ where $r\in\mathbb{N}$. Is there any approximate formula (closed form possibly avoiding this type of summation) for this function? I ...
- 59
2
votes
1
answer
276
views
Construction of the Lipschitz function with a given Lipschitz constant, given two values and with small Lipschitz norm
Let the function $f\colon [a,b] \to\mathbb{C}$ be Lipschitz and let $|f(a)| \geq c,$ $|f(b)| = c$ and $\varepsilon > 0.$
It is easy to see that if $\|f\|_{\infty}< \frac{\varepsilon}{2} =: \...
- 97
1
vote
1
answer
136
views
Construction of the Lipschitz function with a given Lipschitz constant and given two values
Let the function $f\colon [a,b] \to\mathbb{C}$ be Lipschitz and let $|f(a)| \geq c$ and $|f(b)| = c$. Is there a Lipschitz function $g$ such that $|g| \geq c,$ $g(a)=f(a),$ $ g(b)=f(b)$ and Lipschitz ...
- 97
1
vote
1
answer
185
views
Approximating a strictly increasing non-negative function on a non-negative domain by polynomials with non-negative coefficients
Let $f:[0,2]\rightarrow [0,\infty)$ be a strictly increasing smooth function. The Weierstrass approximation theorem says that we can uniformly approximate $f$ by polynomials. But my concern is
...
- 11
1
vote
1
answer
54
views
Can the second-order difference control the first-order difference for nowhere differentiable functions?
Suppose that $f$ is a continuous, nonconstant function on $[0,1]$. Fix some $0<a<1$. Is it possible to establish the following inequality
$$ |f(x+h)-f(x)| \leq C \left[ |h|^a + |2f(x)-f(x+h)-f(x-...
- 419
9
votes
2
answers
313
views
Average as a constant approximation in $L^p$
Let $I=[0,1]$. For $p\in[1,\infty]$ define $C_p$ as the best constant such that for all $f\in L^p(I)$
$$
\left\|f-\int_If\,\right\|_{L^p(I)}\leq C_p\inf_{c\in\mathbb{R}}\left\|f-c\,\right\|_{L^p(I)}.
$...
- 493
3
votes
0
answers
182
views
Rate of uniform approximation by piecewise constant functions
Definitions and Notation:
Fix a positive constant $M>0$ with positive integers $m,n$ and the standard orthonormal basis $e_1,\dots,e_n$ of $\mathbb{R}^n$.
For every positive integer $N$, define the ...
- 5,405
1
vote
0
answers
194
views
Uniform norm bounds for linear approximation of 1-Lipschitz functions
This problem seems like it should be quite easy/standard, but I've not found a solution written down anywhere.
Consider the set of 1-Lipschitz functions on the $[0,d]$ interval. Define the linear ...
- 181
0
votes
1
answer
104
views
Show that $\frac{1}{n} \sum_{i=1}^n a_i \operatorname{erf} \left( \frac{b_i-x}{\sqrt{2}} \right) \to x$ for some sequence $\{a_n\}$ and $\{b_n\}$
Consider the following function
\begin{align}
f_n(x)=\frac{1}{n} \sum_{i=1}^n a_i \operatorname{erf} \left( \frac{b_i-x}{\sqrt{2}} \right)
\end{align}
where $\operatorname{erf} $ is the error ...
- 671
1
vote
0
answers
48
views
Optimal regularity of polynomial interpolators
Definitions
We define the "complexity" of any polynomial function $p:\mathbb{R}^n\rightarrow \mathbb{R}^m$ as $m\binom{n+\deg(p)}{n}$ (i.e the dimension of $\oplus_{i=1}^m\,\mathbb{R}[X_1,\...
- 5,405
17
votes
2
answers
2k
views
Explicit and fast error bounds for polynomial approximation
Main Question
This question is about finding explicit, calculable, and fast error bounds when approximating continuous functions with polynomials to a user-specified error tolerance.
EDIT (Apr. 23): ...
- 697
1
vote
1
answer
61
views
Weak lower semicontinuity of a sequence of Riemann sums
Let us have a sequence of functions $\{f^K\}_{K \in \mathbb{N}} \in C([0,1],\mathbb{R})$ which is uniformly bounded in $L^2((0,1))$. We observe a sequence of Riemann sums
$$R^K=\frac{1}{K} \sum_{k=0}^{...
- 319
3
votes
1
answer
125
views
Relation between the local maxima and the local minima for approximating the generalized Laguerre polynomial
I have already asked my question in the link below:
Minima approximation for Laguerre polynomials
I have suggested to anyone to give me the approximations of the minima for the Laguerre polynomial, ...
3
votes
1
answer
761
views
Functions dense in $L^1[0,1]$ but not in $L^2[0,1]$
Is there a family of continuous functions $(f_n)_{n \in \mathbb{N}}$ on $[0,1]$ whose span is dense in $L^1[0,1]$ for the $L^1$-norm, but not dense in $L^2[0,1]$ for the $L^2$-norm?
Some preliminary ...
- 188
1
vote
0
answers
76
views
Error estimates for orthogonal polynomial approximation
tl;dr: Are there explicit bounds for the approximation error by orthogonal polynomials?
There are various ways to formulate this question more precisely, so want I emphasize up front that this is a ...
- 19
8
votes
0
answers
518
views
Concave and other bounded functions: Series representation and converging polynomials
Main Question
Suppose $f:[0,1]\to[0,1]$ is continuous, polynomially bounded, and belongs to a large class of functions (for example, the $k$-th derivative, $k\ge 0$, is continuous, Lipschitz ...
- 697
1
vote
1
answer
570
views
Convexification of difference of convex functions
I am looking for a reference/a hint to the following problem:
We are given $f_1(x),f_2(x)$ convex functions (say, on $\mathbb R^d$) such that $f_1(x) \to\infty$ for $\|x\|\to\infty$. Also there is an $...
- 375
1
vote
1
answer
92
views
Minimum norm polynomial subject to equality constraints
I had asked this question in the math stackexchange about a year ago. I did not get any response, so I am asking it here.
Given distinct points $x_1,\dots,x_m \in [0,1]^n$ and real numbers $y_1,\dots,...
- 549
6
votes
0
answers
405
views
Using the Lorentz operators to build polynomials that converge to a continuous function
Questions
Let $f(\lambda):[0,1]\to (0,1)$ have a $\beta-\lfloor\beta\rfloor$)-Hölder continuous $\lfloor\beta\rfloor$-th derivative, where $\beta>0$.
Find explicit bounds, with no hidden constants,...
- 697
1
vote
3
answers
768
views
Determining polynomial approximations of piecewise constant functions
Let $t_1 < t_2 < \cdots <t_m$ be real, and $X = \cup_{i=1}^{m-1} (t_i, t_{i+1})$ be a union of real open intervals. Let $f:X \rightarrow \{-1, 1\}$ be any piecewise constant function of form
...
- 1,087
5
votes
1
answer
561
views
Upper bound an integral with exponential function
I am working on my research about approximation a function. I come up with the following integral. I run some simulations and saw that the integral would converge to zero as n goes to infinty. Here is ...
- 87
3
votes
0
answers
161
views
Chebyshev Equioscillation Theorem in presence of extra conditions
Let $P_\ell$ be polynomials of degree $\ell$. For $f \in C[0,1]$, define the minimax error $E_\ell(f) = \min_{p \in P_\ell} \max_{x \in [0,1]} |f(x) - p(x)|$. We know that for the above scenario the ...
- 431
5
votes
2
answers
338
views
Approximation of analytic function by a fixed number of monomials
This question seems simple but I can't manage to disprove it. Let $N\in \mathbb{N}$. We know that by its analyticity that this precise linear combination of monomials
$
\sum_{n=0}^K \frac1{n!} x^n
$
...
0
votes
0
answers
84
views
Can convex functions on product space be approximated by product of convex functions?
I am working on a problem where I need the following property that I guess should be true but I am not able to prove it.
I have a bounded convex function $F(x, y)$ on $X\times Y$ (Think of $X=Y=\...
- 371
0
votes
1
answer
413
views
Uniform approximation of indicator function of a point
Fix $x \in \mathbb{R}$ and let $I_{[x]}$ be its indicator function. Does anyone know of a sequence of (obviously) discontinuous approximations $g_n$ to $I_{[x]}$ such that
$g_n$ converge uniformly ...
1
vote
0
answers
188
views
Best approximation of a Lipschitz function with a piecewise polynomial Lipschitz function
Let $g : [-1, 1] \to R$ be a $1$-Lipschitz function and $f_{k,d} : [-1, 1] \to R$ a $1$-Lipschitz function whose restriction to any subinterval $[h_i, h_{i+1}] \subset [-1, 1]$, $i = 0 ... (k-1)$ with ...
- 31
0
votes
1
answer
106
views
Existence of uniform approximator that also approximates derivative
Let $S$ be a subset of $C^1([0, 1], \mathbb{R})$. It is a well-known fact that given a function $f\in C^1([0, 1], \mathbb{R})$ and a sequence $\{f_n\}\subset C^1([0,1], \mathbb{R})$ such that $f_n\to ...
- 119