Feature #682
PPMonoid: add fn to check for overflow in products
Description
I have recently added the fn PowerOverflowCheck
for PPs; implemented via mem fn myPowerOverflowCheck
. Currently this is called (as a heuristic) only when computing powers of sparse polynomials.
Consider adding a similar overflow check for products of PPs; then we could add a heuristic check (on LPPs) when multiplying sparse polys. This would avoid an anomalous situation for certain values of n
: namely x^(2*n)
gives exponent overflow, but (x^n)*(x^n)
currently gives no error.
History
#1 Updated by John Abbott about 9 years ago
- Priority changed from Normal to Low
- Estimated time set to 3.00 h
Perhaps we will need two overflow check fns:
myMulOverflowCheck
myMulByIndetPowerOverflowCheck
MulOverflowCheck
MulByIndetPowerOverflowCheck