The first benchmark is dense up to the total degree and the staircase structure is bad for Kronecker substitution. The fastest method is probably sparse polynomial interpolation.
It can certainly be done much faster, even on that CPU. We'll eventually get around to that.
We have a lot of generic matrix stuff missing at present though, so that's the priority for now.
There's also things like Puiseux series and capped absolute power series and a few things like that which we can't do without.
It would be a hell of a lot of fun to optimise the hell out of both those polynomial benchmarks, but we have to be realistic and go for breadth first, rather than depth, I think.
Comments
The first benchmark is dense up to the total degree and the staircase structure is bad for Kronecker substitution. The fastest method is probably sparse polynomial interpolation.
It can certainly be done much faster, even on that CPU. We'll eventually get around to that.
We have a lot of generic matrix stuff missing at present though, so that's the priority for now.
There's also things like Puiseux series and capped absolute power series and a few things like that which we can't do without.
It would be a hell of a lot of fun to optimise the hell out of both those polynomial benchmarks, but we have to be realistic and go for breadth first, rather than depth, I think.