Question: Large Computation of 4x4 Matrices


I'm trying to use maple to caluclate the product of eight 4x4 matrices. I need to find all the different permutations of these matrices so that means that there are 8!=40320 in total (I am multiplying all the matrices together but in all thier different orders). I can write a simple program with loops to find the products of say three of the matrices but when I try to create a program that calculates the full product of all eight then maple stuggles (which is a little expected from the size of the computation). I was wondering if anyone knew how to code this more efficently of a better method than using the standard matrix multiplication operator.

I've attached my code.


Any thanks is greatly appreciated, thanks



Please Wait...