Mathematics Stack Exchange
Mathematics Stack Exchange

Questions tagged [chebyshev-polynomials]

In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev, are two sequences of orthogonal polynomials which are related to de Moivre's formula. These polynomials are also known for their elegant Trigonometric properties, and can also be defined recursively. They are very helpful in Trigonometry, Complex Analysis, and other branches of Algebra.

The Chebyshev polynomials, named after Pafnuty Chebyshev, are a sequence of orthogonal polynomials which are related to de Moivre's formula.

There are two kinds of these polynomials. The first kind $T_n$ is defined by the recurrence $$\begin{align} T_0(x)&=1\\ T_1(x)&=x\\ T_{n+1}(x)&=2xT_n(x)-T_{n-1}(x) \end{align}$$ The second kind $U_n$ is defined by the same recurrence, but with $U_1(x)=2x$.

These polynomials also satisfy the trigonometric identities $$T_n(\cos\theta)=\cos(n\theta)\qquad U_n(\cos\theta)\sin\theta=\sin(n+1)\theta.$$

345 questions
16
votes
1 answer

How to use Chebyshev Polynomials to approximate $\sin(x)$ and $\cos(x)$ within the interval $[−π,π]$?

I have approximated $\sin(x)$ and $\cos (x)$ using the Taylor Series (Maclaurin Series) with the following results: $$f(x)=f(0)+\frac{f^{(1)}(0)}{1!}(x-0)+\frac{f^{(2)}(0)}{2!}(x-0)^2+\frac{f^{(3)}(0)}{3!}(x-0)^3+\cdots$$ $$\begin{align}\implies…
David Lin
  • 163
  • 1
  • 1
  • 12
9
votes
3 answers

Chebyshev's Theorem regarding real polynomials: Why do only the Chebyshev polynomials achieve equality in this inequality?

In the book Proofs from The Book by Aigner and Ziegler there is a proof of 'Chebyshev's Theorem' which states that if $p(x)$ is a real polynomial of degree n with leading coefficient $1$ then $$ \max_{-1 \leq x \leq 1} |p(x)| \geq…
Brusko651
  • 843
  • 4
  • 13
9
votes
2 answers

Numerical evaluation of polynomials in Chebyshev basis

I have high order (15 and higher) polynomials defined in Chebyshev basis and need to evaluate them (for plotting) on some intervals inside the canonical interval $[1,\,-1]$. A good accuracy near 1 and -1, where Chebyshev polynomials change rapidly,…
Omicron_Persei_11
  • 227
  • 1
  • 7
9
votes
2 answers

How to best approximate higher-degree polynomial in space of lower-degree polynomials?

My question is: Find the best 1-degree approximating polynomial of $f(x)=2x^3+x^2+2x-1$ on $[-1,1]$ in the uniform norm(NOT in the least square sense please)? Orginially, as the title of the post suggests, I'm asking the general problem: given an…
user33869
  • 965
  • 1
  • 8
  • 16
9
votes
1 answer

Polynomials with minimal variation and a fixed root---looking for a variant of Chebyshev polynomials (motivated by probability)

Recall that the Chebyshev polynomial $T_n(x)$ for a positive integer $n$ is, in a formal sense, the polynomial of degree $n$ that "varies the least" over an interval. Specifically, (a suitable scaling of) $T_n(x)$ is the monic polynomial $p$ of…
Noah Stephens-Davidowitz
  • 443
  • 2
  • 11
8
votes
1 answer

How to get from Chebyshev to Ihara?

I have competing answers on my question about "Returning Paths on Cubic Graphs Without Backtracking". Assuming Chris is right the following should work. Up to one thing: The number of returning paths on 3-regular graphs of length $r$ without…
draks ...
  • 18,089
  • 8
  • 62
  • 183
8
votes
0 answers

Is there something like "associated" Chebyshev polynomials?

When I was experimenting with orthogonalization of polynomials $$p_n(x)=\begin{cases} 1-x^n&\text{if }n\equiv0\; (\operatorname{mod}2),\\ x-x^n&\text{otherwise}, \end{cases}$$ i.e. simplest binomials vanishing at $x=-1$ and $x=1$, with respect to…
Ruslan
  • 6,485
  • 2
  • 23
  • 52
7
votes
3 answers

Existence of polynomial such that $P_n(\cos\theta)=\cos(n\theta)$

Is there a way of proving existence of a polynomial $P_n(x)$ such that $\cos{(n\theta)}=P_n(\cos{\theta})$ without knowing the Chebyshev polynomials a priori?
Kal S.
  • 3,703
  • 1
  • 16
  • 39
7
votes
1 answer

Combinatorial Interpretation of Graph Theoretical Relation Involving Chebyshev Polynomials

Given a graph $G$ and its adjacency matrix $A$. The $(i,j)$-th element of $A^r$ gives the number of ways to get from vertex $i$ to $j$ in $r$ steps (including backtracking). Now, the number of reduced paths on cubic graphs of length $n$ (without…
draks ...
  • 18,089
  • 8
  • 62
  • 183
7
votes
1 answer

Monte-Carlo integration

Let a function $f$ to be $x\in \left[a,b\right],\:0\le f\left(x\right)\le c$. We want to calculate the approximation of the definite integral of the function in the range $[a,b]$, we can suppose that the exact integral is very difficult to calculate…
user869856
7
votes
1 answer

Prove that $\int_1^a \frac{T_n(x) T_n(x/a)}{\sqrt{a^2 - x^2} \sqrt{x^2 - 1^2}} \frac{a}{x} \mathrm{d}x = \frac{\pi}{2}$

In the paper, Representation of a Function by Its Line Integrals, with Some Radiological Applications, A. M. Cormack, Journal of Applied Physics 34, 2722 (1963), an integral identity is expressed which can be reduced to: $$I_n(a) = \int_1^a…
Involute
  • 263
  • 3
  • 12
7
votes
3 answers

Roots of the Chebyshev polynomials of the second kind.

It is known that the roots of the Chebyshev polynomials of the second kind, denote it by $U_n(x)$, are in the interval $(-1,1)$ and they are simple (of multiplicity one). I have noticed that the roots of $U_n{(x)}+U_{n-1}(x)$ (by looking at the law…
Math137
  • 1,833
  • 16
  • 26
7
votes
1 answer

What is the connection between Taylor series and Chebyshev polynomials?

Can somebody help me find some historical references for the connection between Chebyshev polynomials and the Taylor series for sine and cosine functions? We know that Chebyshev polynomials are used to represent multiple angle identities for sine…
Bob Tivnan
  • 411
  • 3
  • 12
7
votes
1 answer

Extending a Chebyshev-polynomial determinant identity

The following $n\times n$ determinant identity appears as eq. 19 on Mathworld's entry for the Chebyshev polynomials of the second kind: $$U_n(x)=\det{A_n(x)}\equiv \begin{vmatrix}2 x& 1 & 0 &\cdots &0\\ 1 & 2x &1 &\cdots &0 \\ 0 & 1 & 2x &\cdots…
Semiclassical
  • 15,277
  • 4
  • 35
  • 86
6
votes
2 answers

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 inside the range $[−1,1]$." In the multivariate case, is…
Mathews Boban
  • 479
  • 1
  • 12
1
2 3
…
22 23