Automated simplification of large symbolic expressions. We present a set of algorithms for automated simplification of symbolic constants of the form ∑ i α i x i with α i rational and x i complex. The included algorithms, called SimplifySum and implemented in Mathematica, remove redundant terms, attempt to make terms and the full expression real, and remove terms using repeated application of the multipair PSLQ integer relation detection algorithm. Also included are facilities for making substitutions according to user-specified identities. We illustrate this toolset by giving some real-world examples of its usage, including one, for instance, where the tool reduced a symbolic expression of approximately 100 000 characters in size enough to enable manual manipulation to one with just four simple terms.2Available from https://github.com/alexkaiser/SimplifySum.
Keywords for this software
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Bailey, D.H.; Borwein, J.M.: Computation and theory of Mordell-Tornheim-Witten sums. II. (2015)
- Bailey, David H.; Borwein, Jonathan M.; Kaiser, Alexander D.: Automated simplification of large symbolic expressions (2014)