> Well, general idea in FriCAS is that domain and conditional sections > can provide more efficient code in special cases.
Yes, I know, but then one has to test for every possible "coefficient" domain. That doesn't really scale well. Take for example, SUP. Once it is implemented, one has to add special code for any new coefficient domain (in case one wants that). Well we are luckily open source so that's not a big problem, but still, it's somewhat ugly. > However, design of PolynomialFactorizationExplicit has serious > efficiency problems. Virtue of PolynomialFactorizationExplicit is > simplicity. Yes simplicity is what I like in this idea. Now you say that there is an efficience panelty. Can you elaborate on that? I somehow don't quite see it. Is this because the compiler is not able to simple take the function from the coefficient domain (for example squareFreePolynomial$R) and inline it as squareFree$SUP(R)? Since such a design is also in Aldor's algebra library, maybe Peter Broadbery can say a few words how this is handled in Aldor. Ralf -- 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/eb9b86ba-a4b5-c91a-eab5-e0f62ce62304%40hemmecke.org.
