Generates MinMax polynomial approximations of functions. Stable implementation of the Remez Algorithm using multi-precision arithmetic. Also does C/C++ code generation!
By setting the first and last points in the extremum array to the start and end of the bound, the minimax polynomial will only be produced in cases where the maximum error in this region is the start and end of the bound:
In cases like the one below, the minimax polynomial will not be generated.
By setting the first and last points in the extremum array to the start and end of the bound, the minimax polynomial will only be produced in cases where the maximum error in this region is the start and end of the bound:
In cases like the one below, the minimax polynomial will not be generated.