Re: [Maxima-discuss] e, pi, gamma, log(2), also mpfr, also sympy

[Barton W. <wi...@un...>]

For a speed advantage, binary splitting algorithms generally require multiplication that is faster than

O(n * m), I think.  As far as I know, Maxima doesn't have  fast integer multiplication.


An exception is the factorial function--the speed advantage for a splitting method comes from organizing the multiplications in a way that reduces the multiplication times (and leverage that multiplication by two is super fast). Maxima does have this method--I think Richard Fateman contributed it some years ago. Applied to fixed length integers, I think the splitting method for factorials doesn't have all that much advantage over a simple-minded approach?


Big Oh estimates that assume fixed length integers aren't sufficient to compare algorithms that use

non fixed length integers. Maybe Maxima needs fast integer multiplication to allow binary splitting methods to be viable?


--Barton