I implemented a multivariable psr GCD algorithm in Julia and now the timings are as follows:
* if z or x is the main variable, it takes a long time (too long to wait for) * if t or y is the main variable it takes 0.1 - 0.2s on average, depending on the exact ordering, with the one exception below * for variables in the order y, x, z, t with y the main variable, it takes 1.1s I have to admit this was about my fourth attempt at implementing the psr algorithm. I settled on a sparse univariate format for the main variable and sparse distributed format for the remaining variables. Of course there are much better algorithms for sparse gcds like this. Funnily enough, Magma takes 4s, though its timings presumably don't depend on the ordering, since they are proper sparse gcd algorithms. Bill. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
