Wolfram Library Archive

Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings

Automated simplification of large symbolic expressions

D. H. Bailey
Organization: Lawrence Berkeley National Laboratory
Jonathan Borwein
Organization: Univ. of Newcastle
Department: Centre for Computer Assisted Research Mathematics and its Applications (CARMA)
Alexander D. Kaiser
Organization: NewYorkUniversity
Department: CourantInstituteofMathematicalSciences
Journal / Anthology

Journal of Symbolic Computation
Year: 2014
Volume: 60
Page range: 120-136

We present a set of algorithms for automated simplification of symbolic constants of the formiαixi with α irational and xi complex. The included algorithms, called SimplifySum2 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 100000 characters in size enough to enable manual manipulation to one with just four simple terms.

*Science > Physics

Simplification, Computer algebra systems, Experimental mathematics, Error correction