ChebyshevT
The Chebyshev polynomial of the first kind , defined by . Provided by @enumeratio/analytic.
✓ checked against that system · ! checked, with disagreements (hover a chip)Wikipedia
Chebyshev polynomialsMathWorldChebyshevPolynomialoftheFirstKindDLMF18.3FungrimChebyshevT✓Fungrim entryWolfram LanguageChebyshevT!ChebyshevT(n, x)the degree- Chebyshev polynomial of the first kind at , for an integer .Typed signatures
| Type | Package | Applies |
|---|---|---|
(integer, number) -> number | analytic | always |
Details
- , , and . The coefficients are integers and the leading one is for .
- , so on the polynomial oscillates between and , and , .
- Composition multiplies degrees: . Parity follows the degree: .
- A negative order folds as Wolfram does: .
- At an integer and a symbolic or exact the result is the expanded polynomial. At a floating-point or complex the recurrence runs directly on the number.
- A symbolic order stays unevaluated. The signature takes an integer order only; Wolfram continues to non-integer , and that is not implemented here.
Examples
7 more kept as data, checked against the oraclesScope #
Properties #
at infinity grows without bound
live ↗InOut
Known value · Wolfram MathematicalFunctionData, ChebyshevT:Polynomial
Likewise toward negative infinity
live ↗InOut
Known value · Wolfram MathematicalFunctionData, ChebyshevT:Polynomial
live ↗
InOut
Known value · Wolfram MathematicalFunctionData, ChebyshevT:Polynomial, ChristoffelâDarboux formula
live ↗
InOut
Known value · Wolfram MathematicalFunctionData, ChebyshevT:Polynomial, ChristoffelâDarboux formula
About
| Examples | 37 |
|---|---|
| Checked against | Wolfram Language 35 agree2 differ |
| Crosswalk | WikipediaMathWorldDLMFFungrimFungrim entry ×34Wolfram Language |
Implementation
primitive · kernela kernel — an algorithm over mutable state that would not be readable as a tree
nativeengine
typescriptpackages/symbols/analysis/analytic/src/chebyshev.tsmappedexternal
wolfram / mpmath / sympypackages/oracle/src/mappings.tsChebyshevT[n, x]; mpmath.chebyt(n, x); sympy.chebyshevt(n, x).
See also: ChebyshevU, LegendrePolynomial, Cos