I recently noticed that using
NewListOfMatrices := BaseChange * OldListOfMatrices;
it is a bit faster than the construct I had been using:
NewListOfMatrices := List(OldListOfMatrices, x -> BaseChange * x);
After extensive modifications to some code I'm working on, I noticed that
these two statements differ slightly in effect: notably when the list
happens to be empty. Should the behaviour of '*' be changed so that
SomeMatrix * [ ]; SomeScalar * [ ];
return empty lists?
Michael.
----------------------------------------------------------------------------- Michael.Smith@maths.anu.edu.au - Mathematics - Australian National University