Automated Simplification of Large Symbolic Expressions

Bailey, David H. and Borwein, Jonathan M. and Kaiser, Alexander D. (2014) Automated Simplification of Large Symbolic Expressions. J. Symbolic Computation (60). pp. 120-136.

Other (Automated Simplification ) - Submitted Version
Download (433Kb) | Preview
    [img] Archive (ZIP) (Associated Code)
    Download (56Kb)


      We present a set of algorithms for automated simplification of constants of the form $\sum_a_i x_i$i with $a_i$ rational and $x_i$ complex. The included algorithms, called SimplifySums and implemented in Mathematica, remove redundant terms, attempt to make terms and the full expression real, and remove terms using repeated application of the integer relation detection algorithm PSLQ. 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.

      Item Type: Article
      Subjects: 68-xx Computer science > 68Uxx Computing methodologies and applications
      Faculty: UNSPECIFIED
      Depositing User: Jonathan Borwein
      Date Deposited: 10 Nov 2012 08:57
      Last Modified: 19 Nov 2014 22:23

      Actions (login required)

      View Item