|
[Date Index]
[Thread Index]
[Author Index]
Re: Simplify Expressions with Non commutative multiplication
- To: mathgroup at smc.vnet.net
- Subject: [mg60279] Re: Simplify Expressions with Non commutative multiplication
- From: David Bailey <dave at Remove_Thisdbailey.co.uk>
- Date: Sat, 10 Sep 2005 06:46:32 -0400 (EDT)
- References: <dfrgic$fpu$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Hello,
One problem with patterns of the form a___,something,b___ (or even more
complicated variants) is that they can work, but involve a combinatorial
explosion of possiblities - so things get hopelessly too slow when you
scale the code up to work on real problems.
A more efficient approach might be to treat the contents of your myDot
as a list and process it from left to right either recursively or even
indexing the terms explicitly using [[k]].
David Bailey
http://www.dbaileyconsultancy.co.uk
Prev by Date:
Re: Looking for n for which all 2-partitions are prime partitions.
Next by Date:
Timed Notebooks for Student Take-home examinations
Previous by thread:
Simplify Expressions with Non commutative multiplication
Next by thread:
Re: Simplify Expressions with Non commutative multiplication
|