Services & ResourcesWolfram ForumsMathGroup Archive

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

Simplifying expressions using rules with recursion

• To: mathgroup at smc.vnet.net
• Subject: [mg127599] Simplifying expressions using rules with recursion
• From: wimmer.mike at googlemail.com
• Date: Mon, 6 Aug 2012 04:36:48 -0400 (EDT)
• Delivered-to: l-mathgroup@mail-archive0.wolfram.com
• Delivered-to: l-mathgroup@wolfram.com
• Delivered-to: mathgroup-newout@smc.vnet.net
• Delivered-to: mathgroup-newsend@smc.vnet.net

I would like to use Mathematica to simplify a long expression consisting of tems of products of matrices. These matrices obey equations of the form A = A.B.A, and I would like Mathematica to use these identities to simplify my expression.
How can I tell Mathematica to do that? Just entering

[1]: A = A.B.A

does not work, as Mathematica will complain about too man recursions (which I understand). But how do 
I do it properly?

• Follow-Ups:
  • Re: Simplifying expressions using rules with recursion
    • From: Bob Hanlon <hanlonr357@gmail.com>