It is only a suspicion, because FriCAS is generally very fast because it essentially compiles code, and python is generally rather slow. However, I (and Travis Scrimshaw, who wrote that code with me), took some care to make it reasonable.
In any case, I'd like to play with it. Best wishes, Martin On Saturday 27 July 2024 at 19:53:02 UTC+2 [email protected] wrote: > On 7/27/24 19:06, 'Martin R' via FriCAS - computer algebra system wrote: > > I'd be very interested in the actual computation. I suspect that the sage > > implementation is much slower, but I'd be curious to know! > > Hi Martin, > > I would bet that Fredrik Johansson has something faster, but that would > be for truncated power series. > > Why do you claim that the sage implementation is slower? Did you mean > the pure-python implementation of infinite power series in python that > you (or your student) did? > > Ralf > -- You received this message because you are subscribed to the Google Groups "FriCAS - computer algebra system" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/fricas-devel/b7b2d646-2f68-4d54-9b38-60d237b5951dn%40googlegroups.com.
