Abstract. We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, the problem of factoring matrices with non-polynomial entries is studied. Gaussian Elimination is used. Results on the complexity of the approach together with benchmark calculations are given. Key Words: Hierarchical Representation, Veiling Strategy, Signature, Zero Test, Large Expression Management, Symbolic LU Decomposition, Time Complexity
Wenqin Zhou, Jacques Carette, David J. Jeffrey, Mi