I am not sure if this is the right community in which to ask this question, but I'm trying to understand symbolic matrix math better, and cannot find many resources about it online.
Specifically, does anyone know the complexity of the algorithms which perform symbolic matrix multiplications in packages such as Mathematica, Matlab, and Sympy? If not, can you speculate on their performance vs. normal matrix multiplication?
Thanks in advance.
Hint: Mathematica and Matlab are proprietary software systems, so you need to consult the documentation or contact the suppliers for information about the algorithms they use. Sympy is supplied under an open source licence, so you can read the source. If you have a practical interest in the performance of these systems, then I suggest you conduct your own experiments.