exponential polynomial approximation #1346
Open
+95
−16
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.
This pull request introduces new implementations of
glm::fastPow,
glm::fastExp,
glm::fastExp2,
glm::fastLog,
glm::fastLog2.
that are numerically stable, even for large values.ALGORITHM
In this approximation I used Horner's method for polynomial evaluation
((((C0 * x + C1) * x + C2) * x + C3) * x + C4)
where
C0
-Cn
are coefficents calculated using the Remez Algorithm.exp2()
interval [0, 1] (exp2
works more efficiently in IEEE 754 float)log()
interval[1, 2]SPECIAL CASES
These are not included in the code for performance reasons
• glm::fastPow
If y is negative
1 / glm::fastPow(x, abs(-y));
If x is less than 1 (e.g 0.4, 0.5...)
1 / glm::fastPow(1 / x, y);
• glm::fastExp, glm::fastExp2
If x is negative
1 / glm::fastExp(abs(-x));
• glm::fastLog, glm::fastLog2
If x is less than 1 (e.g 0.7, 0.8...)
-glm::fastLog(1 / x);
NEED MORE ACCURACY?
Accurate up to
1e-4
0.0001% error, (you can optionally use this if needed)ERROR
• glm::fastPow
• glm::fastExp
• glm::fastExp2
• glm::fastLog
• glm::fastLog2
PERFORMANCE TEST