recursion - Chebyshev polynomials - Mathematica Stack Exchange
mathematica.stackexchange.com › questions › 237290Dec 29, 2020 · The way to use Nest [] for computing the Chebyshev polynomial of the first kind is to recognize that a three-term recurrence is equivalent to repeated multiplication by a certain 2 × 2 matrix. To wit, With [ {n = 5}, First [Nest [ { {2 x, -1}, {1, 0}}.# &, {x, 1}, n - 1]]] // Expand 5 x - 20 x^3 + 16 x^5 ChebyshevT [5, x] 5 x - 20 x^3 + 16 x^5 ...
Chebyshev polynomials of the second kind: Representations ...
functions.wolfram.com › Polynomials › ChebyshevUCell[BoxData[RowBox[List[RowBox[List["ChebyshevU", "[", RowBox[List["n", ",", "z"]], "]"]], "\[Equal]", RowBox[List[SqrtBox[FractionBox["\[Pi]", "2"]], FractionBox ...
MATHEMATICA tutorial, Part 2.5; Chebyshev expansions
www.cfm.brown.edu › people › dobrushNov 01, 2021 · There are two kinds of Chebyshev expansions for a function on the finite interval [-1, 1] depending which kind of Chebyshev function is used. The Chebyshev polynomials of first kind. T n ( x) are solutions of the differential equation. ( 1 − x 2) y ″ − x y ′ + n 2 y = 0, and they are orthogonal on the interval [-1, 1] with weight function.
MATHEMATICA tutorial, Part 2.5; Chebyshev expansions
01.11.2021 · There are two kinds of Chebyshev expansions for a function on the finite interval [-1, 1] depending which kind of Chebyshev function is used. The Chebyshev polynomials of first kind. T n ( x) are solutions of the differential …