Waldek Hebisch <[email protected]> writes: > I have now code which mostly avoids this problem: it moves > all algebraics into numerator and then normal GCD is enough > to remove common factors. But approach has its own problems: > many expression get bigger after moving algebraics into > numerator and moving algebraics into numerator may be quite > time consuming too. The effect is that with new code FriCAS > can do in few seconds the nasty examples that would otherwise > take weeks or months or run out of memory. But on average > FriCAS got slower (probably about two times slower) and there > is an example which works well with old code but did not finish > in few hours with new one.
do you happen to know how others (eg sympy) deal with the problem? Martin -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" 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/fricas-devel?hl=en.
