Scribd
Upload
6 views9 pages

Chebyshev Polynomials - Presentation

The document provides an overview of Chebyshev Polynomials, including their definition, properties, and applications in numerical analysis, mathematics, and physics. It discusses the triple recursion relation that defines these polynomials and introduces a minimum size property. The document also presents specific polynomial forms for various degrees of n, illustrating their structure and behavior.

Uploaded by

Sam Alexander
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views9 pages

Chebyshev Polynomials - Presentation

The document provides an overview of Chebyshev Polynomials, including their definition, properties, and applications in numerical analysis, mathematics, and physics. It discusses the triple recursion relation that defines these polynomials and introduces a minimum size property. The document also presents specific polynomial forms for various degrees of n, illustrating their structure and behavior.

Uploaded by

Sam Alexander
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Chebyshev Polynomials

Thiti Virachvarin

Chulalongkorn University

September 16,2024
Overview
• Introduction to Chebyshev Polynomials
• The Triple Recursion Relation
• The Minimum Size Property
Introduction to Chebyshev Polynomials
We introduce a family of polynomials, the Chebyshev Polynomials

The application
• Numerical Analysis
• Mathematics
• Physics
Introduction to Chebyshev Polynomials
For an integer 𝑛 ≥ 0, define the function

𝑇𝑛 𝑥 = cos 𝑛𝑐𝑜𝑠 −1 𝑥 , −1 ≤ 𝑥 ≤ 1

𝑇𝑛 𝑥 may not appear as a polynomial equation, but we will show it is a polynomial of degree n.

Let 𝑇𝑛 𝑥 = cos 𝑛𝜃 , 𝜃 = cos −1 𝑥 𝑤ℎ𝑖𝑐ℎ 0 ≤ 𝜃 ≤ 𝜋

𝑛 = 0; 𝑇0 𝑥 = cos 0 ∙ 𝜃 = cos 0 = 1
𝑛 = 1; 𝑇1 𝑥 = cos 1 ∙ 𝜃 = cos 𝜃 = 𝑥
𝑛 = 2; 𝑇2 𝑥 = cos 2 ∙ 𝜃 = 2 cos 2 𝜃 − 1 = 2𝑥 2 − 1
𝑛 = 3; 𝑇3 𝑥 = cos 3 ∙ 𝜃
𝑇3 𝑥 = cos 𝜃 + 2𝜃
𝑇3 𝑥 = cos 𝜃 𝑐𝑜𝑠2𝜃 − sin 𝜃 sin 2𝜃
𝑇3 𝑥 = cos 𝜃 2cos 2 𝜃 − 1 − sin 𝜃 2 sin 𝜃 cos 𝜃
𝑇3 𝑥 = 2 cos3 𝜃 − cos 𝜃 − 2 1 − cos 2 𝜃 cos 𝜃
𝑇3 𝑥 = 4 cos3 𝜃 − 3 cos 𝜃 = 4𝑥 3 − 3𝑥
Introduction to Chebyshev Polynomials

𝑛 = 0; 𝑇0 𝑥 = cos 0 ∙ 𝜃 = cos 0 = 1
𝑛 = 1; 𝑇1 𝑥 = cos 1 ∙ 𝜃 = cos 𝜃 = 𝑥
𝑛 = 2; 𝑇2 𝑥 = cos 2 ∙ 𝜃 = 2 cos 2 𝜃 − 1 = 2𝑥 2 − 1
𝑛 = 3; 𝑇3 𝑥 = cos 3 ∙ 𝜃
𝑇3 𝑥 = cos 𝜃 + 2𝜃
𝑇3 𝑥 = cos 𝜃 𝑐𝑜𝑠2𝜃 − sin 𝜃 sin 2𝜃
𝑇3 𝑥 = cos 𝜃 2cos 2 𝜃 − 1 − sin 𝜃 2 sin 𝜃 cos 𝜃
𝑇3 𝑥 = 2 cos3 𝜃 − cos 𝜃 − 2 1 − cos 2 𝜃 cos 𝜃
𝑇3 𝑥 = 4 cos3 𝜃 − 3 cos 𝜃 = 4𝑥 3 − 3𝑥
The Triple Recursion Relation
Recall the trigonometric addition formulas
cos 𝛼 ± 𝛽 = cos 𝛼 cos 𝛽 ∓ sin 𝛼 sin 𝛽
For any 𝑛 ≥ 1, apply these identities to get

From 𝑇𝑛 𝑥 = cos 𝑛𝜃
𝑇𝑛+1 𝑥 = cos 𝑛 + 1 𝜃
𝑇𝑛+1 𝑥 = cos 𝑛𝜃 + 𝜃
𝑇𝑛+1 𝑥 = cos 𝑛𝜃 cos 𝜃 − sin 𝑛𝜃 sin 𝜃

And 𝑇𝑛−1 𝑥 = cos 𝑛 − 1 𝜃


𝑇𝑛+1 𝑥 = cos 𝑛𝜃 − 𝜃
𝑇𝑛+1 𝑥 = cos 𝑛𝜃 cos 𝜃 + sin 𝑛𝜃 sin 𝜃

Then 𝑇𝑛+1 𝑥 + 𝑇𝑛−1 𝑥 = 2 cos 𝑛𝜃 cos 𝜃


𝑇𝑛+1 𝑥 + 𝑇𝑛−1 𝑥 = 2 cos 𝑛𝜃 cos 𝜃
𝑇𝑛+1 𝑥 + 𝑇𝑛−1 𝑥 = 2 𝑇𝑛 𝑥 𝑥

This equation is called the triple recursion relation for the Chebyshev polynomials.
The Triple Recursion Relation
From the triple recursion relation For an integer 𝑛 ≥ 0, define the function

𝑇𝑛+1 𝑥 + 𝑇𝑛−1 𝑥 = 2 𝑇𝑛 𝑥 𝑥 𝑇𝑛 𝑥 = cos 𝑛𝑐𝑜𝑠 −1 𝑥 , −1 ≤ 𝑥 ≤ 1


𝑇𝑛+1 𝑥 = 2 𝑇𝑛 𝑥 𝑥 − 𝑇𝑛−1 𝑥
𝑇𝑛 𝑥 may not appear as a polynomial equation, but we
𝑛 = 0; 𝑇0 𝑥 = cos 0 ∙ 𝜃 = cos 0 = 1 will show it is a polynomial of degree n.
𝑛 = 1; 𝑇1 𝑥 = cos 1 ∙ 𝜃 = cos 𝜃 = 𝑥
𝑛 = 2; 𝑇2 𝑥 = 2 𝑇1 𝑥 𝑥 − 𝑇0 𝑥 Let 𝑇𝑛 𝑥 = cos 𝑛𝜃 , 𝜃 = cos −1 𝑥 𝑤ℎ𝑖𝑐ℎ 0 ≤ 𝜃 ≤ 𝜋
𝑇2 𝑥 =2 𝑥 𝑥 −1
𝑇2 𝑥 = 2𝑥 2 − 1 𝑛 = 0; 𝑇0 𝑥 = cos 0 ∙ 𝜃 = cos 0 = 1
𝑛 = 3; 𝑇3 𝑥 = 2 𝑇2 𝑥 𝑥 − 𝑇1 𝑥 𝑛 = 1; 𝑇1 𝑥 = cos 1 ∙ 𝜃 = cos 𝜃 = 𝑥
𝑇3 𝑥 = 2 2𝑥 2 − 1 𝑥 − 𝑥 𝑛 = 2; 𝑇2 𝑥 = cos 2 ∙ 𝜃 = 2 cos 2 𝜃 − 1 = 2𝑥 2 − 1
𝑇3 𝑥 = 4𝑥 3 − 3𝑥 𝑛 = 3; 𝑇3 𝑥 = cos 3 ∙ 𝜃
𝑛 = 4; 𝑇4 𝑥 = 2 𝑇3 𝑥 𝑥 − 𝑇2 𝑥 𝑇3 𝑥 = cos 𝜃 + 2𝜃
𝑇4 𝑥 = 2 4𝑥 3 − 3𝑥 𝑥 − 2𝑥 2 − 1 𝑇3 𝑥 = cos 𝜃 𝑐𝑜𝑠2𝜃 − sin 𝜃 sin 2𝜃
𝑇4 𝑥 = 8𝑥 4 − 8𝑥 2 + 1 𝑇3 𝑥 = cos 𝜃 2cos 2 𝜃 − 1 − sin 𝜃 2 sin 𝜃 cos 𝜃
𝑇3 𝑥 = 2 cos3 𝜃 − cos 𝜃 − 2 1 − cos 2 𝜃 cos 𝜃
𝑇3 𝑥 = 4 cos3 𝜃 − 3 cos 𝜃 = 4𝑥 3 − 3𝑥
The Minimum Size Property
From the triple recursion relation
𝑇𝑛+1 𝑥 = 2 𝑇𝑛 𝑥 𝑥 − 𝑇𝑛−1 𝑥
𝑛 = 0; 𝑇0 𝑥 = 1
𝑛 = 1; 𝑇1 𝑥 = 20 𝑥 1
𝑛 = 2; 𝑇2 𝑥 = 2𝑥 2 − 1
𝑛 = 3; 𝑇3 𝑥 = 4𝑥 3 − 3𝑥
𝑛 = 4; 𝑇4 𝑥 = 8𝑥 4 − 8𝑥 2 + 1
Then 𝑇𝑛 𝑥 = 2𝑛−1 𝑥 𝑛 + 𝑙𝑜𝑤𝑒𝑟 − 𝑑𝑒𝑔𝑟𝑒𝑒 𝑡𝑒𝑟𝑚𝑠 , 𝑛 ≥ 1

Introduce a modified version of 𝑇𝑛 𝑥 which highest-degree term has a coefficient of 1


𝑛 = 1; 𝑇෨1 𝑥 = 𝑥 1
1 1
𝑛 = 2; 𝑇෨2 𝑥 = 2 2𝑥 2 − 1 = 𝑥 2 − 2
1 3
𝑛 = 3; 𝑇෨3 𝑥 = 4𝑥 3 − 3𝑥 = 𝑥 3 − 𝑥
4 4
1 1
𝑛 = 4; 𝑇෨4 𝑥 = 8𝑥 4 − 8𝑥 2 + 1 = 𝑥4 − 𝑥2 + 8
8
1
Then 𝑇෨𝑛 𝑥 = 2𝑛−1 2𝑛−1 𝑥 𝑛 + 𝑙𝑜𝑤𝑒𝑟 − 𝑑𝑒𝑔𝑟𝑒𝑒 𝑡𝑒𝑟𝑚𝑠 , 𝑛 ≥ 1
1
𝑇෨𝑛 𝑥 = 2𝑛−1 𝑇𝑛 𝑥 = 𝑥 𝑛 + 𝑙𝑜𝑤𝑒𝑟 − 𝑑𝑒𝑔𝑟𝑒𝑒 𝑡𝑒𝑟𝑚𝑠 , 𝑛 ≥ 1
The Minimum Size Property
Introduce a modified version of 𝑇𝑛 𝑥 which highest-degree term has a coefficient of 1
𝑛 = 1; 𝑇෨1 𝑥 = 𝑥 1
1 1
𝑛 = 2; 𝑇෨2 𝑥 = 2 2𝑥 2 − 1 = 𝑥 2 − 2
1 3
𝑛 = 3; 𝑇෨3 𝑥 = 4𝑥 3 − 3𝑥 = 𝑥 3 − 𝑥
4 4
1 1
𝑛 = 4; 𝑇෨4 𝑥 = 8𝑥 4 − 8𝑥 2 + 1 = 𝑥 4 − 𝑥 2 + 8
8
1
Then 𝑇෨𝑛 𝑥 = 𝑛−1 2𝑛−1 𝑥 𝑛 + 𝑙𝑜𝑤𝑒𝑟 − 𝑑𝑒𝑔𝑟𝑒𝑒 𝑡𝑒𝑟𝑚𝑠 , 𝑛 ≥ 1
2
1
𝑇෨𝑛 𝑥 = 2𝑛−1 𝑇𝑛 𝑥 = 𝑥 𝑛 + 𝑙𝑜𝑤𝑒𝑟 − 𝑑𝑒𝑔𝑟𝑒𝑒 𝑡𝑒𝑟𝑚𝑠 , 𝑛 ≥ 1
1
Then 𝑇෨𝑛 𝑥 ≤ 𝑛−1 𝑓𝑜𝑟 − 1 ≤ 𝑥 ≤ 1 𝑎𝑛𝑑 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛 ≥ 1
2
We call the polynomial which the highest-degree term has a coefficient of 1 as a monic polynomial
1
The monic polynomial 𝑇෨𝑛 𝑥 has size 2𝑛−1 on [-1,1]. Also, it becomes smaller as the degree n increases.
But 𝑥 𝑛 is a monic polynomial whose size does not change with increasing n.

Theorem: Let 𝑛 ≥ 1 be integer, and consider all possible monic polynomials of degree n. Then the degree
n monic polynomial with the smallest maximum absolute value on [-1,1] is the modified Chebyshev
1
polynomial 𝑇෨𝑛 𝑥 , and its maximum value on [-1,1] is 2𝑛−1

You might also like