ComplexityFunction

ComplexityFunction

is an option for Simplify and other functions which gives a function to rank the complexity of different forms of an expression.

Details

  • With the default setting ComplexityFunction->Automatic, forms are ranked primarily according to their LeafCount, with corrections to treat integers with more digits as more complex.
  • Simplify[expr,ComplexityFunction->f] applies f to each intermediate expression generated by Simplify, treating the one which yields the smallest numerical value as simplest.

Examples

open allclose all

Basic Examples  (2)

The default ComplexityFunction counts the subexpressions and digits of integers:

LeafCount counts only the number of subexpressions:

By default this expression is not simplified:

This complexity function makes ChebyshevT more expensive than other functions:

Scope  (1)

With the default ComplexityFunction, Abs[x] is simpler than the FullForm of -x:

This complexity function counts characters in the InputForm of the expression:

Now -x is simpler than Abs[x]:

Properties & Relations  (1)

The automatic complexity function:

Introduced in 1996
 (3.0)