|
Boost : |
From: John Maddock (jz.maddock_at_[hidden])
Date: 2021-06-16 08:14:26
On 15/06/2021 22:48, Joachim Wuttke via Boost wrote:
> Until v1.53, Boost Math had doc pages [1,2] on the Remez algorithm.
> This algorithm [3] computes the coefficents of the Chebyshev polynomial
> that approximates a given function. Page [2] refers to actual code
> in directory libs/math/minimax. This code can still be found on
> GitHub [4], but maintenance status and dependences are unclear.
>
> Anybody around who knows anything about this code?
>
It's still semi-documented in the last release:
https://www.boost.org/doc/libs/1_76_0/libs/math/doc/html/math_toolkit/internals/minimax.html
This code is/was an internal detail that I used to generate the rational
minimax approximations used in the library, the code should still be
working so far as I know.
What did you want to know?
Regards, John Maddock.
-- This email has been checked for viruses by Avast antivirus software. https://www.avast.com/antivirus
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk