Related articles |
---|
Advanced expression simplification ichudov@algebra.com (2005-07-11) |
Re: Advanced expression simplification marcov@stack.nl (Marco van de Voort) (2005-07-11) |
Re: Advanced expression simplification haberg@math.su.se (2005-07-12) |
Re: Advanced expression simplification eugene.ressler@frontiernet.net (Gene) (2005-07-17) |
Advanced expression simplification drikosv@otenet.gr (Evangelos Drikos) (2005-07-17) |
Re: Advanced expression simplification liekweg@ipd.info.uni-karlsruhe.de (F. Liekweg) (2005-07-17) |
From: | haberg@math.su.se (Hans Aberg) |
Newsgroups: | comp.compilers |
Date: | 12 Jul 2005 05:13:18 -0400 |
Organization: | Mathematics |
References: | 05-07-040 |
Keywords: | optimize, analysis |
Posted-Date: | 12 Jul 2005 05:13:18 EDT |
ichudov@algebra.com (Igor Chudov) wrote:
> Are there any good treatises on expression simplification.
I think you might check out Maple, because its algorithms at least used to
be open (ten years ago). Andre Heck wrote a book "Introduction to Maple".
In general though there is nothing such a general principle of
simplification. Expanding (x^n -1)/(x - 1) may sometimes be a good idea,
at other times not. If you represent polynomials as functions N -> set of
coefficient values, then expanding can take place also for large N. And so
on. There is a newsgroup sci.math.symbolic, which can perhaps provide more
info.
--
Hans Aberg
Return to the
comp.compilers page.
Search the
comp.compilers archives again.