Chebyshev nodes
Builds on Chebyshev polynomialsInterval
Definition
Let be an integer. The Chebyshev nodes of order in are the numbers They are the zeros of the Chebyshev polynomial of the first kind. For an interval with , the Chebyshev nodes of order in are the numbers , .
Remarks
Example: for the nodes are , that is , and . Check: vanishes exactly there.
Non-example: the equally spaced points are not the Chebyshev nodes of order , since .
The node polynomial is , whose maximum on is , the least possible for a monic polynomial of degree . Hence, if has continuous derivatives and interpolates at these nodes, then . The points , , where , are the Chebyshev extreme points, also called Chebyshev–Lobatto points.
Reading path
To understand this page from the ground up, read these 11 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Chebyshev polynomials object
- Construction of the reals from Cauchy sequences concept
- Integers object
- Ordered field definition
- Rational numbers object
- Ring of integers statement
- The rationals form a field statement
- The rationals form an ordered field statement
- Order on the reals definition
- Interval definition
- Chebyshev nodes definition
Further reading
About this page
| Tag | YWTXGDC427 |
|---|---|
| URI | m2://YWTXGDC427 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65D05, 41A05, 33C45 |
| Defines | Chebyshev nodes |
| Uses | Chebyshev polynomials, Interval |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.