Recently I was working on a problem where I expected to
decompose a matrix into components in such a way that I
need not depend on multiplication of these components to
get the original matrix, as multiplication is the operator
used by all decomposition techniques to revert.
I came up with slighly improvised echleon form method
that I have kept here "
I have also coded a small function to calculate it
available at "
It returns correct result. But the point to note here
is that just for 4-x-4 it takes 1 minute, 5-x-5 matrix takes
about 18 minutes to solve the equations constructed. In case
of 6-x-6 its just plain Maxima out of space. Its behaviour is somewhat same as exponential growth of subgroups problem.
Interesting thing to note is that on Mathematica 9, it took 3000
sec to complete the answer and return wrong results while maxima took 60 seconds for correct response !!
On sage it took 3 seconds. Sage solves it like magic for bigger matrices too.
The equations constructed are too long and intricate and lot
in number. The advantage I see is that there is no need to pre-fed
equations in test cases and on the fly equation can be developed
of any order using a baby small piece of code.Moreover it works
for square as well as rectangular matrix.
There is no other test needed other than comparing the input and
output matrix to check the validity of computing system.
This can also be used to test simplification, reduction of
equations. I think it can put quite a challenge to very efficient systems.
Using the code on git,
Can it be used as a bench mark in maxima ?