Skip to main content

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.

17 votes
1 answer
15k views

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)...
David Lin's user avatar
  • 173
15 votes
1 answer
452 views

Show that $\max _{x \in[-1,1]}|P(x)| \geq \frac{1}{2^{n-1}}$ without Chebyshev polynomials

For every monic polynomial $P$ of degree $n$ (with leading coefficient 1), it is well-known that $$\max _{x \in[-1,1]}|P(x)| \geq \frac{1}{2^{n-1}}.$$ A standard proof uses Chebyshev polynomials. Is ...
Nathan Portland's user avatar
9 votes
3 answers
2k views

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 $$ \...
Brusko651's user avatar
  • 843
9 votes
2 answers
5k views

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 ...
user33869's user avatar
  • 1,040
9 votes
2 answers
2k views

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 ...
Omicron_Persei_11's user avatar
9 votes
1 answer
156 views

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 ...
Noah Stephens-Davidowitz's user avatar
8 votes
1 answer
702 views

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 ...
draks ...'s user avatar
  • 18.6k
8 votes
1 answer
3k views

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 ...
Bob Tivnan's user avatar
8 votes
0 answers
188 views

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 ...
Ruslan's user avatar
  • 6,875
7 votes
3 answers
971 views

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.'s user avatar
  • 3,821
7 votes
1 answer
1k views

Chebyshev polynomials increase more quickly than any other polynomial outside $[-1,1]$

In Appendix C3 of Shewchuk's excellent notes on conjugate gradient, it is stated without proof that Chebyshev polynomials... increase in magnitude more quickly outside the range $[-1,1]$ than any ...
Benjamin Bray's user avatar
7 votes
3 answers
3k views

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 ...
Math137's user avatar
  • 1,849
7 votes
1 answer
253 views

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 ...
Involute's user avatar
  • 273
7 votes
1 answer
553 views

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 ...
user avatar
7 votes
1 answer
387 views

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 ...
draks ...'s user avatar
  • 18.6k

15 30 50 per page
1
2 3 4 5
25