Clenshaw Algorithm

From GM-RKB
Revision as of 21:55, 18 December 2023 by Gmelli (talk | contribs) (Text replacement - "----↵Category:Concept" to "---- __NOTOC__ Category:Concept")
Jump to navigation Jump to search

A Clenshaw Algorithm is a Polynomial Evaluation Algorithm that is a recursive algorithm that evaluates a linear combination of Chebyshev polynomials.



References

2021

  1. Note that this paper is written in terms of the Shifted Chebyshev polynomials of the first kind [math]\displaystyle{ T^*_n(x) = T_n(2x-1) }[/math] .
  2. Tscherning, C. C.; Poder, K. (1982), "Some Geodetic applications of Clenshaw Summation" (PDF), Bolletino di Geodesia e Scienze Affini, 41 (4): 349–375,

2002

1982