May 25, 2019 Re: Performance of tables slower than built in? | ||||
---|---|---|---|---|
| ||||
Posted in reply to Ola Fosheim Grøstad | On Saturday, 25 May 2019 at 14:58:25 UTC, Ola Fosheim Grøstad wrote: > On Saturday, 25 May 2019 at 12:51:20 UTC, NaN wrote: >> I used an evolutionary optimisation algorithm on the table all at once. So you do a weighted sum of max deviation, and 1st and 2nd order discontinuity at the joins. And minimise that across the table as a whole. It seemed you could massively overweight the discontinuities without really affecting the curve fitting that much. So perfect joins only cost a little extra deviation in the fit of the polynomial. > > Wow, it is pretty cool that you managed to minimize 2nd order discontinuity like that! Is there a paper describing the optimisation algorithm you used? Its differential evolution, you can pretty much optimise anything you can quantify. http://www1.icsi.berkeley.edu/~storn/code.html |
May 25, 2019 Re: Performance of tables slower than built in? | ||||
---|---|---|---|---|
| ||||
Posted in reply to NaN | On Saturday, 25 May 2019 at 20:07:19 UTC, NaN wrote:
> Its differential evolution, you can pretty much optimise anything you can quantify.
>
> http://www1.icsi.berkeley.edu/~storn/code.html
Thanks, they even have Python example code. Nice.
|
Copyright © 1999-2021 by the D Language Foundation