Dear Martin, Thank you for the details.
Sebastian On Jan 5, 4:55 pm, Martin Rubey <martin.ru...@math.uni-hannover.de> wrote: > Martin Rubey <martin.ru...@math.uni-hannover.de> writes: > > Sebastian Pancratz <s...@pancratz.org> writes: > > >> I am wondering whether there is a good reason for doing this. > > >> Typically, assuming that (or even on the spot enforcing that!) a/b and > >> c/d are in lowest terms, it would be much faster to compute GCD(a,d) > >> and GCD(c,b) and to then divide out appropriately. If all elements > >> involved are of "size" n, say, this way all operations take inputs of > >> size at most n, as opposed to 2n as in the current implementation. > > > At least FriCAS does precisely that, so you cannot be completely wrong > > :-) > > Sorry, I should have looked closer. FriCAS uses what I just learned to > be called ALgorithm by Brown and Henrici, > > http://delivery.acm.org/10.1145/810000/804903/p108-horowitz.pdf?key1=... > > Please excuse. > > Martin
-- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
