Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2005
*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 2005

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

Search the Archive

Re: Transformation rule problem

  • To: mathgroup at smc.vnet.net
  • Subject: [mg58167] Re: Transformation rule problem
  • From: Oliver Buerschaper <groo137vy at yahoo.co.uk>
  • Date: Tue, 21 Jun 2005 06:02:40 -0400 (EDT)
  • References: <d8u623$84e$1@smc.vnet.net>
  • Sender: owner-wri-mathgroup at wolfram.com

> f //. {a^(x_)*b -> a^(x - 1)*d, a^(x_)*b^(y_) ->
>     a^(x - 1)*b^(y - 1)*d, a*b^(x_) -> b^(x - 1)*d}

I was wondering how well this solution performs... after all 
Mathematica calls this rule recursively, doesn't it? Does this affect 
the performance when compared to the single pass rule suggested by 
Roland?

Oliver



  • Prev by Date: mathematica bench mark and hp c8000?
  • Next by Date: Re: Transformation rule problem
  • Previous by thread: Re: Transformation rule problem
  • Next by thread: Re: Transformation rule problem