I am working with some unpleasantly tedious polynomials, which need to be manipulated in various ways (integrate with respect to some variable, differentiate with respect to another). Since these will eventually be part of numeric routines, I'd like to pull out common subexpressions that I can reuse, e.g.
(G u^2 (6 p (2 h + p) - 8 (h + p) u + 3 u^2))/(12 h^2) (G (3 h + 3 p - 2 u) u^2)/(3 h^2)
should at least note that both have a common factor of
(G u^2)/(3 h^2)
Is there a convenient way to instruct Mathematica to look for this sort of computational-expense-reduction in pairs of expressions? Ideally it would notice even in the case where it's not just a factor multiplied by both, e.g. if I added
+ 1 to the second equation, I'd still like it to find that common subexpression.
Just for clarification, this is what I do by hand:
e1 = (G u^2)/(12 h^2) * (6 p (2 h + p) - 8 (h + p) u + 3 u^2)) e2 = (G u^2)/( 3 h^2) * (3 h + 3 p - 2 u) A = (G u^2)/(12 h^2) e1 = A * (6 p (2 h + p) - 8 (h + p) u + 3 u^2)) e2 = A * (12 (h + p) - 6 u) B = u^2 C = h + p A = (G B)/(12 h^2) e1 = A * (6 p (2 h + p) - 8 C u + 3 B) e2 = A * (12 C - 6 u)
to go from 6 additions, 20 multiplications, 2 divisions, and 2 assignments, to 5 additions, 14 multiplications, 1 division, and 5 assignments (the extra three of which are temporary so can be in registers and cost essentially nothing).
Simplifyet al. and then let your compiler do the CSE and other transformations: it's better placed to know what optimizations are possible at that stage and by doing it prematurely you may disrupt this process. $\endgroup$