Talk:Chebyshev coefficients: Difference between revisions

Talk:Chebyshev coefficients (view source)

No change in size , 7 years ago

m

→‎What is this task about?: typo, confusion with markdown :)

Anonymous user

Revision as of 15:14, 9 October 2016 (view source) rosettacode>Arbautjc m (→‎What is this task about?) ← Older edit		Latest revision as of 20:40, 9 October 2016 (view source) rosettacode>Arbautjc m (→‎What is this task about?: typo, confusion with markdown :))
(One intermediate revision by one other user not shown)
Line 11: 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) == Wikipedia doesn't seem to agree with Numerical ~~Recipies~~Recipes == 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. —[[User:Sonia\|Sonia]] ([[User talk:Sonia\|talk]]) 16:15, 21 August 2015 (UTC) == What is this task about? == It's absolutely not clear what '''Chebyshev coefficients''' actually are. The name of Chebyshev is associated to many things in approximation theory * Coefficients of Chebyshev polynomials of first and second kind