Am 14.03.2012 13:36, schrieb Alan Bromborsky:
One of the current deficiencies of sympy is trig simplification. I have
found the attached publication on such simplification. I have emailed
the authors in an attempt to obtain the C# code they wrote to implement
their system. If I can obtain the code my suggestion is for someone to
convert it to python and integrate it into sympy.
Huh. A paper that describes a system but remains vague about the
concrete heuristics that they were using, or how they arrived at the
heuristics. Nor do they say what textbook examples they tested it on, or
how many examples that were ("many"). Nor do they actually say how many
examples their system could solve, compared to Maple, Mathematica, etc.
In other words, the paper doesn't describe their approach well enough to
verify their claim, and that does ring an alarm bell.
That said, their approach *could* work well. It's certainly worth a shot.
Are there other approaches that could be considered?
A google search for "trigonometry simplification algorithm" (without the
quotes) turned up some links, of which I found the following interesting
(but haven't checked the quality of the papers):
http://rfdz.ph-noe.ac.at/fileadmin/Mathematik_Uploads/ACDCA/DESTIME2006/DES_contribs/Fu/simplification.pdf
http://stackoverflow.com/questions/4643935/open-source-trigonometric-equation-simplifiers-preferably-c-based
lists some possibly useful pages on the topic.
HTH
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sympy?hl=en.
