]> gitweb.michael.orlitzky.com - sage.d.git/commit
projects / sage.d.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 99c9d21) | patch
mjo/polynomial.py: improve multidiv performance a bit.
authorMichael Orlitzky <michael@orlitzky.com>
Mon, 18 Feb 2019 16:05:53 +0000 (11:05 -0500)
committerMichael Orlitzky <michael@orlitzky.com>
Mon, 18 Feb 2019 16:05:53 +0000 (11:05 -0500)
commit4e4efc9eff5c77a2ca19002b1dfa45598e974c54
treeeab9d18808daa692338ac2cae59c52e2bff3604ctree | snapshot
parent99c9d21e53ac687000811b614214e6a083eb8b63commit | diff
mjo/polynomial.py: improve multidiv performance a bit.

We don't need to re-check earlier "denominators" after division has
occurred, even though we *do* need to re-check the current one. This
makes the algorithm closer in practice to the one given in the text.
mjo/polynomial.py diff | blob | history
My personal library of Sage code.