Subject: Re: [boost] [math] Chebyshev polynomial
From: Bjorn Reese (breese_at_[hidden])
Date: 2017-05-20 10:14:24
On 05/15/2017 02:29 PM, John Maddock via Boost wrote:
> However, the recurrence relation is trivial, likewise evaluation of an
> arbitrary Tn(x) in terms of trig functions? Even the roots have simple
They are indeed trivial, and I already have my own implementation.
I just thought it might be nice to have in Boost.Math as we already
have support for other polynomials.
> What did you want to do?
I am using it for function approximation:
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk