Clenshaw Recurrence Formula
The downward Clenshaw recurrence formula evaluates a sum of products of indexed Coefficients byfunctions which obey a recurrence relation. If
and
where the
s are known, then define |  |  | |
 | |  |
for
and solve backwards to obtain 
and 
.
 | |  | |
|  | ||
 |  | ||
|  | ||
|  | ||
|  | ||
|  | ||
|  | ||
|  | ||
|  | ||
|  |
The upward Clenshaw recurrence formula is
for
.
References
Press, W. H.; Flannery, B. P.; Teukolsky, S. A.; and Vetterling, W. T. ``Recurrence Relations and Clenshaw's Recurrence Formula.'' §5.5 in Numerical Recipes in FORTRAN: The Art of Scientific Computing, 2nd ed. Cambridge, England: Cambridge University Press, pp. 172-178, 1992.
- Thue-Morse Sequence
- Thue Sequence
- Thue-Siegel-Roth Theorem
- Thue-Siegel-Schneider-Roth Theorem
- Thue's Theorem
- Thurston's Geometrization Conjecture
- Thwaites Conjecture
- Ticktacktoe
- Tic-Tac-Toe
- Tight Closure
- Tightly Embedded
- Tiling
- Tiling Theorem
- Times
- Titanic Prime
- Titchmarsh Theorem
- Tit-for-Tat
- Tits Group
- Toeplitz Matrix
- Togliatti Surface
- Tomography
- Tooth Surface
- Topological Basis
- Topological Completion
- Topological Dimension