The input to optimize must be either a single algebraic expression, an array of algebraic expressions (for example a matrix of formulae), a list of equations of the form  name = algebraic  (meaning a "computation sequence"), or a Maple procedure.

If the input is not a Maple procedure, the output from optimize is a sequence of equations of the form  name = algebraic representing an "optimized computation sequence" for the input expression. Each equation in the sequence corresponds to an assignment. The global variables $\mathrm{t0},\mathrm{t1},\mathrm{t2},\dots$ are used for temporary (local) variables in the computation sequence.

If the input is a Maple procedure, the output is the optimized Maple procedure. Presently optimize can only optimize simple procedures which are "computation sequences" i.e. consist of a sequence of simple assignment statements -- they contain no if statements or for loops.

If the input is a computation sequence of the form

then this understood to be equivalent to the Maple procedure

So the names $\mathrm{s1},\mathrm{s2},...,\mathrm{sn}$ in the computation sequence are regarded as global variables which cannot be removed from the computation sequence. The optional arguments globals=[g1,g2,...,gm], parameters=[p1,p2,...,pm], and locals=[l1,l2,...,lm] may be used to specify otherwise.

The optimize function is designed to optimize only computation sequences

where x does not include any of $\mathrm{s1},\mathrm{s2},...,\mathrm{sn}$.  It is advised that the optimize function be used only when this condition is true; otherwise, unexpected results may be produced.

The optimize function makes use of Maple's option remember facility to identify common subexpressions in linear time and space. This means, however, that only those subexpressions which Maple has simplified to be identical are found. For example, the expression $x+y$ is not recognized as being common to  $x+y+z$. That is, optimize performs mainly "syntactic" optimizations.

If tryhard is given as an optional argument, a different algorithm is used which will give a better optimized output but will consume more time and memory.

Procedures containing calls to sum, add or piecewise must first be prepared for translation by calling codegen[prep2trans] and running optimize on the output.

The routine codegen[makeproc] can be used to create a Maple procedure from a single formula, an array of formulae, or a computation sequence.

The routine codegen[cost] can be used to give an operation count for the unoptimized and optimized input.

The command with(codegen,optimize) allows the use of the abbreviated form of this command.

$\mathrm{with}\left(\mathrm{codegen}\,\mathrm{optimize}\,\mathrm{makeproc}\,\mathrm{cost}\,\mathrm{prep2trans}\right)\:$

$f≔x^4-x^3$

$f≔x^4-x^3$

$\mathrm{optimize}\left(f\right)$

$\mathrm{t1}=x^2,\mathrm{t2}={\mathrm{t1}}^2,\mathrm{t4}=-\mathrm{t1}x+\mathrm{t2}$

$f≔x\ln \left(x\right)+2x^2\ln \left(x\right)+3x^3\ln \left(x\right)$

$f≔x\ln \left(x\right)+2x^2\ln \left(x\right)+3x^3\ln \left(x\right)$

$\mathrm{optimize}\left(f\right)$

$\mathrm{t1}=\ln \left(x\right),\mathrm{t3}=x^2,\mathrm{t9}=3\mathrm{t3}x\mathrm{t1}+2\mathrm{t3}\mathrm{t1}+\mathrm{t1}x$

$\mathrm{cost}\left(f\right)$

$2\mathrm{additions}+8\mathrm{multiplications}+3\mathrm{functions}$

$\mathrm{cost}\left(\mathrm{optimize}\left(f\right)\right)$

$\mathrm{functions}+3\mathrm{assignments}+7\mathrm{multiplications}+2\mathrm{additions}$

$\mathrm{cost}\left(f\right)-\mathrm{cost}\left(\mathrm{optimize}\left(f\right)\right)$

$\mathrm{multiplications}+2\mathrm{functions}-3\mathrm{assignments}$

F := makeproc(f,x);

$F≔\mathbf{proc}\left(x\right)x\*\ln \left(x\right)\+2\*x\^2\*\ln \left(x\right)\+3\*x\^3\*\ln \left(x\right)\mathbf{end\; proc}$

$\mathrm{optimize}\left(F\right)$

$\mathbf{proc}\left(x\right)\mathbf{local}\mathrm{t1}\,\mathrm{t3}\;\mathrm{t1}≔\ln \left(x\right)\;\mathrm{t3}≔x\^2\;3\*\mathrm{t1}\*\mathrm{t3}\*x\+2\*\mathrm{t1}\*\mathrm{t3}\+\mathrm{t1}\*x\mathbf{end\; proc}$

$\mathrm{cs}≔\left[t=x\,r\left[1\right]=t{\left(x-y\right)}^2\,r\left[2\right]=2{\left(y-x\right)}^2\right]\:$

$\mathrm{optimize}\left(\mathrm{cs}\right)$

$t=x,\mathrm{t1}=x-y,\mathrm{t2}={\mathrm{t1}}^2,r_1=\mathrm{t2}x,\mathrm{t4}={\mathrm{t1}}^2,r_2=2\mathrm{t4}$

$\mathrm{optimize}\left(\mathrm{cs}\,\mathrm{locals}=\left[t\right]\right)$

$\mathrm{t1}=x-y,\mathrm{t2}={\mathrm{t1}}^2,r_1=\mathrm{t2}x,\mathrm{t4}={\mathrm{t1}}^2,r_2=2\mathrm{t4}$

F := makeproc(cs,x);

$F≔\mathbf{proc}\left(x\right)\mathbf{local}t\;t≔x\;r\[1\]≔t\*\left(x-y\right)\^2\;r\[2\]≔2\*\left(y-x\right)\^2\mathbf{end\; proc}$

$\mathrm{optimize}\left(F\right)$

$\mathbf{proc}\left(x\right)\mathbf{local}\mathrm{t1}\,\mathrm{t2}\,\mathrm{t4}\;\mathrm{t1}≔x-y\;\mathrm{t2}≔\mathrm{t1}\^2\;r\[1\]≔\mathrm{t2}\*x\;\mathrm{t4}≔\mathrm{t1}\^2\;r\[2\]≔2\*\mathrm{t4}\mathbf{end\; proc}$

$A≔\mathrm{array}\left(\left[\left[x^3\,x^2\right]\,\left[x^2\,x^4\right]\right]\right)$

$A≔\left[\begin{array}{cc}{x}^3& x^2\\ x^2& x^4\end{array}\right]$

$\mathrm{optimize}\left(A\right)$

$\mathrm{t1}=x^2,\mathrm{t3}={\mathrm{t1}}^2,A_{1,1}=\mathrm{t1}x,A_{1,2}=\mathrm{t1},A_{2,1}=\mathrm{t1},A_{2,2}=\mathrm{t3}$

g := proc(x,A::array(1..2)) A[1] := y*sin(x); A[2] := x^2*sin(x); end proc;

$g≔\mathbf{proc}\left(x\,A::\left(\mathrm{array}\left(1..2\right)\right)\right)A\[1\]≔y\*\sin \left(x\right)\;A\[2\]≔x\^2\*\sin \left(x\right)\mathbf{end\; proc}$

$\mathrm{optimize}\left(g\right)$

$\mathbf{proc}\left(x\,A::\left(\mathrm{array}\left(1..2\right)\right)\right)\mathbf{local}\mathrm{t1}\,\mathrm{t2}\;\mathrm{t1}≔\sin \left(x\right)\;A\[1\]≔\mathrm{t1}\*y\;\mathrm{t2}≔x\^2\;A\[2\]≔\mathrm{t1}\*\mathrm{t2}\mathbf{end\; proc}$

h := proc(x) local s,t,r; s := 1; t := x; r := t^2; r*s end proc;

$h≔\mathbf{proc}\left(x\right)\mathbf{local}s\,t\,r\;s≔1\;t≔x\;r≔t\^2\;r\*s\mathbf{end\; proc}$

$\mathrm{optimize}\left(h\right)$

$\mathbf{proc}\left(x\right)\mathbf{local}r\;r≔x\^2\;r\mathbf{end\; proc}$

s := proc(a,b,c) local r,s; r := a*b+a*c; s := b*c+c^2;r-s;end proc;

$s≔\mathbf{proc}\left(a\,b\,c\right)\mathbf{local}r\,s\;r≔b\*a\+a\*c\;s≔b\*c\+c\^2\;r-s\mathbf{end\; proc}$

$\mathrm{optimize}\left(s\right)$

$\mathbf{proc}\left(a\,b\,c\right)\mathbf{local}\mathrm{t4}\;\mathrm{t4}≔c\^2\;b\*a\+a\*c-b\*c-\mathrm{t4}\mathbf{end\; proc}$

$\mathrm{optimize}\left(s\,'\mathrm{tryhard}'\right)$

$\mathbf{proc}\left(a\,b\,c\right)\mathbf{local}\mathrm{result}\,\mathrm{t1}\;\mathrm{t1}≔b\+c\;\mathrm{result}≔\mathrm{t1}\*a-c\*\mathrm{t1}\mathbf{end\; proc}$

p := proc(x,m,n)
  local i;
  add( i * f(x-i), i = m .. n ) / add( f(x-i), i = m .. n )
end proc:

$q≔\mathrm{prep2trans}\left(p\right)$

$q≔\mathbf{proc}\left(x\,m\,n\right)\mathbf{local}i\,\mathrm{i1}\,\mathrm{i2}\,\mathrm{s1}\,\mathrm{s2}\,\mathrm{t1}\,\mathrm{t2}\;\mathrm{s1}≔0\;\mathbf{for}\mathrm{i1}\mathbf{from}m\mathbf{to}n\mathbf{do}\mathrm{s1}≔\mathrm{s1}\+\mathrm{i1}\*f\left(x-\mathrm{i1}\right)\mathbf{end\; do}\;\mathrm{s2}≔0\;\mathbf{for}\mathrm{i2}\mathbf{from}m\mathbf{to}n\mathbf{do}\mathrm{s2}≔\mathrm{s2}\+f\left(x-\mathrm{i2}\right)\mathbf{end\; do}\;\mathrm{s1}\/\mathrm{s2}\mathbf{end\; proc}$

$\mathrm{optimize}\left(q\,'\mathrm{tryhard}'\right)$

$\mathbf{proc}\left(x\,m\,n\right)\mathbf{local}i\,\mathrm{i1}\,\mathrm{i2}\,\mathrm{s1}\,\mathrm{s2}\,\mathrm{t1}\,\mathrm{t2}\;\mathrm{s1}≔0\;\mathbf{for}\mathrm{i1}\mathbf{from}m\mathbf{to}n\mathbf{do}\mathrm{s1}≔\mathrm{s1}\+\mathrm{i1}\*f\left(x-\mathrm{i1}\right)\mathbf{end\; do}\;\mathrm{s2}≔0\;\mathbf{for}\mathrm{i2}\mathbf{from}m\mathbf{to}n\mathbf{do}\mathrm{s2}≔\mathrm{s2}\+f\left(x-\mathrm{i2}\right)\mathbf{end\; do}\;\mathrm{s1}\/\mathrm{s2}\mathbf{end\; proc}$