bugAxiom 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 authentification level.

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

Submitted by:  Martin Rubey <kratt6>
Submitted on:  Fri 04 Jun 2004 08:18:34 AM UTC  
 
Category: NoneSeverity: 3 - Normal
Item Group: code bugStatus: transferred
Privacy: PublicAssigned to: None
Originator Name: kratt6Open/Closed: Open
Release: tla from may 2004Reproducibility: None
Fixed Release: 
Error message: 
Example of code trigerring the bug: 

eval(sum(f(i),i=a..b),f,x+->x)

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)

Fri 04 Jun 2004 08:18:34 AM UTC, original submission:

(6) -> eval(sum(f(i),i=a..b),f,x+->x)

b
--+
(6) > i
--+
i= a
Type: Expression Integer

Although axiom can evaluate this sum, it does not.

Martin Rubey <kratt6>

 

No files currently attached

 

Depends on the following items: None found

Items that depend on this one: None found

 

CC list is empty

 

Do you think this task is very important?
If so, you can click here to add your encouragement to it.
This task has 0 encouragements so far.

Only logged-in users can vote.

 

Please enter the title of George Orwell's famous dystopian book (it's a date):

 

 

Follow 2 latest changes.

Date Changed By Updated Field Previous Value => Replaced By
Mon 03 Oct 2005 06:08:56 AM UTCbillpage1StatusNone=>transferred
  Internal causefirst 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)

Back to the top


Powered by Savane 3.1-cleanup