Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2006
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2006

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: efficient term collection algorithm

  • To: mathgroup at smc.vnet.net
  • Subject: [mg69186] Re: [mg69155] efficient term collection algorithm
  • From: Michael Jensen <michaeljensen at mac.com>
  • Date: Fri, 1 Sep 2006 06:41:22 -0400 (EDT)
  • Sender: owner-wri-mathgroup at wolfram.com

Here is a function thats makes it

In[26]:=
f[exp_]:=Module[{denoms},
     denoms=Variables[Denominator/@exp];
     denoms,Collect[exp,denoms]
     ]

IIn[31]:=
f[a/i+b/j+c/i+d/j]//InputForm

Out[31]//InputForm=
(a + c)/i + (b + d)/j



--

         Michael Jensen
         Hollandsvej 21 st. tv.
         DK-2800 Lyngby
         Danmark
         Tel.:       +45 4593 9482
         Mobil:    +45 2046 1169
	email: michaeljensen at mac.com
         http://homepage.mac.com/michaeljensen



  • Prev by Date: Re: Problems with NMaximize.
  • Next by Date: How to identify "intersections" between to data sets?
  • Previous by thread: Re: Problems with NMaximize.
  • Next by thread: Re: efficient term collection algorithm