Ctadel: Symbolic Simplification

Generation of efficient codes for numerical problems requires extensive simplification of commuting operators (through operator commuting diagrams).

For example, the rule


B

I = A 
X
+
B

I = A 
Y
B

I = A 
(X+Y)
is specified in Ctadel as
sum(X,I=A..B) + sum(Y,I=A..B) => sum(X+Y,I=A..B)
can be applied on the expression

m

j = 1 

n

i = 1 
uij

+
n

i = 1 
vi
resulting in
n

i = 1 


m

j = 1 
uij
+vi
because the sum operation is ``self-commuting''.

This means that LHS of transformation rules can be specified independently of the operator commuting properties.

Next


File translated from TEX by TTH, version 2.21.
On 8 Oct 1999, 14:27.