Kevin Ryde on Sat, 20 Dec 2014 01:01:31 +0100

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: polynomial partial fractions

Karim Belabas <> writes:
> In practice, the above implementation is quadratic. But it should still
> be an order of magnitude faster than matsolve().

Hmm.  Beaut.

Bill Allombert <> writes:
> the extended Euclid algorithm

I wrote a bit with gcdext() directly.
I'll post it if I get the quality up a touch.