On 8/28/22 21:51, Waldek Hebisch wrote:
Another things is "factored expressions". Currently expressions are rational functions of kernels, normalised so that algebraic kernels are reduced by their defining equations. Rational functions are fully expanded. I would like variant where rational functions are partially factored. If you look at Rubi testsuite many epressions are already in factored form. When input as Expression they get expanded. That in many cases leads to much bigger expressions later. At the input in many cases we could restore factored form and take advantage of known factors during computation. Of course, to recognize zero we need to expand. But I feel that there will be net gain.
I have thought about "factored expressions" as well. My rough idea is using "paren/box" to prevent expand, and adding checks for "paren/box" to expand when needed. Do you think this is a viable solution? Similar to "factored expressions", I think pattern matching, integration by part, heuristic algorithm also relies on "do not auto expand expression beyond recognition." - Qian -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/fricas-devel/900f2aba-8393-5d88-aeff-519a5e747304%40gmail.com.
