feat(PolyEqvSpline), perf: Changed polynomial shift algorithm #70
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Types of changes
Related: #45
Description
Changed polynomial shift algorithm (expansion in powers of (x-x0)) from binomials to Horner's scheme.
New solution is much simpler, several times faster, and far more precise.
Added new constructor for
PolyEqvSplinewithOptimizationTypeargument.Updated
test_polyeqv.cppto test the accuracy ofPolyEqvSplinewithSPEEDoptimization type.Additionally
I have confirmed that the precision is drastically improved in the graphical application and in tests.
However, I couldn't observe it with benchmarks.
You can find these benchmarks here: https://github.com/pasabanov/test.ALFI/tree/bench-horner/benches/horner.
results-2025.04.30-03:49.txt: