I have just fixed the bug that Waldek found in CliffordAlgebra and all the tests that I have done indicate that it now works correctly for the non-diagonal case.
I have put the working pamphlet file here: http://github.com/martinbaker/multivector/ and here: http://www.euclideanspace.com/maths/standards/program/clifford/clifford.spad.pamphlet In addition to checking that the Clifford multiplication results are associative, as required, I have also added these commands to help with debugging and give additional confidence: setMode("orthogonal",false) The "orthogonal" flag is set to true if the non-diagonal terms in the matrix are zero. This allows a optimised Clifford multiplication for this case. The above setMode command can now turn that optimisation off forcing all multiplications to be done by the more general algorithm. This allows the output of the two algorithms to be compared. The two methods produce the same result in the diagonal case as required. setMode("debug",true) This "debug" flag causes the internal working of the algorithms to be displayed during calculations. Martin Baker
-- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/fricas-devel?hl=en.
