Skip to main content

All Questions

0 votes
0 answers
35 views

Best uniform approximation of complex exponential function $e^z$ over unit disc in complex plane

It is known that the best uniform approximation for a real function defined in interval $[1,-1]$ is via the Chebyshev polynomials. ([see optimal polynomials])1. Such polynomials are also called min-...
Manish Kumar's user avatar
2 votes
1 answer
52 views

Compute the correction of a Chebyshev approximation using the Clenshaw summation formula

Assume you have a Chebyshev approximation of a function $f(x)$ evaluated using the Clenshaw summation method, up to polynomial order $N$: $$ f(x) = \sum_{k=0}^{N-1} a_k T_k(x) = (a_0 - y_2)T_0(x) + ...
LladOS's user avatar
  • 21
0 votes
0 answers
43 views

Bounds of polynomial approximation of a function of many variables using Jackson inequality

There is an approximation of a multivariate function by a Chebyshev polynomial of degree n. One needs to understand how the approximation error behaves depending on the degree of the polynomial or ...
Masamune's user avatar
0 votes
0 answers
48 views

Chebyshev approximation for bivariate function

I read the paper. I am a litte bit confused regarding formulation of Chebyshev approximation for bivariate function(See photo). There is only one integral over variable x. Should it be in formula one ...
Masamune's user avatar
0 votes
1 answer
106 views

Convergence rate for Chebyshev polynomials to approximate $\text{erf}(x)$ on a subset of $\mathbb{R}$

Let $[-\alpha, \alpha] \subset \mathbb{R}$, and let \begin{equation} \text{erf}(x) = \frac{2}{\sqrt{\pi}}\int_{0}^x e^{-t^2}dt. \end{equation} given projections of $\text{erf}(x)$ onto the first $k$ ...
Cuhrazatee's user avatar
6 votes
2 answers
251 views

Polynomial that grows faster than any other polynomial outside $[−1,1]^n$

Consider this statement: "Chebyshev polynomials increase in magnitude more quickly outside the range $[−1,1]$ than any other polynomial that is restricted to have magnitude no greater than one ...
Mathews Boban's user avatar
0 votes
0 answers
158 views

Question on convergence of Chebyshev series

I have written a script that plots some function and its truncated Chebyshev expansion in $[-1,1]$, which is given by $$ \sum a_nT_n(x) \quad \text{with} \quad a_n = \int_{-1}^{1}T_n(x)f(x)/\sqrt{1-x^...
user210089's user avatar
0 votes
0 answers
202 views

Bounds for Chebyshev polynomials outside [-1,1]

It is well known that, for all $x\in [-1,1]$ and for all $j>0$, the Chebyshev polynomials of the first and second kind satisfy $$ |T_j(x)|\leq 1 ,\qquad |U_j(x)|\leq j+1. $$ I am wondering about ...
overfull hbox's user avatar
3 votes
0 answers
85 views

Chebyshev coefficients of Chebyshev interpolants

I am wondering whether there is a known closed form for the $k$th Chebyshev coefficient of a $n$th Chebyshev interpolant, that is, $$\int_{-1}^1T_k(x)L_{n,i}(x)\frac{dx}{\sqrt{1-x^2}}$$ where $T_k$ is ...
zjs's user avatar
  • 1,147
1 vote
0 answers
70 views

Chebyschev's Polynomials and its Application

Consider approximating the function $f(x)=x^{3}-x$ by a polynomial $P_{2}(x)=a_{2} x^{2}+$ $a_{1} x+a_{0}$ which minimizes $$ E_{2}\left(a_{0}, a_{1}, a_{2}\right)=\int_{0}^{1}\left[f(x)-P_{2}(x)\...
Snowball's user avatar
  • 1,023
4 votes
2 answers
1k views

The relationship between the best uniform approximation and chebyshev interpolant

I am learning Approximation Theory. I know one polynormial of degree at most $n$ is the best uniform approximation of the function $f \in \mathcal C[a,b]$ if and only if there is exist a set of $n+2$ ...
Hugo's user avatar
  • 705
3 votes
0 answers
257 views

Converting Chebyshev expansion into a regular polynomial

So I have a very very basic technique for converting shifted Chebyshev polynomials to regular polynomials but it seems to have a large issue with numerical stability and I don't completely understand ...
Jake's user avatar
  • 461
3 votes
0 answers
452 views

Error estimate of a Chebyshev polynomial approximation.

I am trying to approximate a function $f(x)$ on $[-1, 1]$ using Chebyshev's polynomial of the first kind. $$ f(x) \approx \sum_{i=0}^N a_iT_i(x) $$ What is the error of this approximation? Is it the ...
DubsVeer23's user avatar
1 vote
0 answers
498 views

How to Find the Coefficients For the Chebyshev Expansion of a Function

Find and building a Fourier series of a function $f(x)$ on an arbitrary interval $[a,b]$ is explained here. I know that for Chebyshev series, the expansion is $$f(x) \sim \sum_{i=0}^{N} c_i T_i(x)$$ ...
DUO Labs's user avatar
  • 788
0 votes
1 answer
37 views

Show that the sign of the sequence is alternating [closed]

I'm solving the following (numerical analysis) problem. Let $f(x)$ be a polynomial of degree $n$ such that there exist exactly $n+1$ distinct points $x_0,x_1\cdots,x_n$ in the interval $[-1,1]$ ...
Kim's user avatar
  • 451

15 30 50 per page