## Axiom Computer Algebra System - Bugs: bug #9217, substituting for an operator in a...

You are not allowed to post comments on this tracker with your current authentication level.

*bug #9217*: substituting for an operator in a sum does not apply the summation algorithms

Follow 2 latest changes.

Date | Changed By | Updated Field | Previous Value | => | Replaced By |
---|---|---|---|---|---|

Mon 03 Oct 2005 06:08:56 AM UTC | billpage1 | Status | None | transferred | |

Internal cause | first the sum is evaluated. Since the argument -- f(x)-- is not a polynomial or rational function, using first iidsum, than idsum of COMBF. Afterwards the substitution is performed. Now the sum has the internal format %defsum [%A, %A, i, a, b], which is again evaluated with iidsum and idsum of COMBF. The function sum$InnerPolySum is never called, of course. A general solution is to call sum from within idsum, but in this case, care has to be taken that summation algorithms that can fail (such as Gosper's) do not produce an infinite loop. (In fact I think this is OK, I only did not have the time to check) | first the sum is evaluated. Since the argument -- f(x)-- is not a polynomial or rational function, using first iidsum, than idsum of COMBF. Afterwards the substitution is performed. Now the sum has the internal format %defsum [%A, %A, i, a, b], which is again evaluated with iidsum and idsum of COMBF. The function sum$InnerPolySum is never called, of course. A general solution is to call sum from within idsum, but in this case, care has to be taken that summation algorithms that can fail (such as Gosper's) do not produce an infinite loop. (In fact I think this is OK, I only did not have the time to check) |