Talk:Chebyshev coefficients: Difference between revisions

Or alternatively, Clenshaw's recurrence might be added as a separate task, with the two tasks exchanging data and results. —[[User:Sonia|Sonia]] ([[User talk:Sonia|talk]]) 15:56, 21 August 2015 (UTC)

 

 

See https://en.wikipedia.org/wiki/Chebyshev_polynomials#Example_1. WP has that extra Kronecker delta that effectively divides the first term by 2, which, if I understand, gets the absolute value of that first coefficient <= 1. Am I reading that right? NR may have a pair of functions that generate and then evaluate an approximating polynomial, but if it's a variant of Chebychev, I'd prefer that we show the more mathematically correct functions. &mdash;[[User:Sonia|Sonia]] ([[User talk:Sonia|talk]]) 16:15, 21 August 2015 (UTC)

 

== What is this task about? ==