Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #11238 > unrolled thread
| Started by | wimmer.mike@googlemail.com |
|---|---|
| First post | 2012-08-06 08:38 +0000 |
| Last post | 2012-08-06 08:38 +0000 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.soft-sys.math.mathematica
Simplifying expressions using rules with recursion wimmer.mike@googlemail.com - 2012-08-06 08:38 +0000
| From | wimmer.mike@googlemail.com |
|---|---|
| Date | 2012-08-06 08:38 +0000 |
| Subject | Simplifying expressions using rules with recursion |
| Message-ID | <jvnvpr$cda$1@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?
Back to top | Article view | comp.soft-sys.math.mathematica
csiph-web