These are chat archives for symengine/symengine

Feb 2015
Shivam Vats
Feb 11 2015 03:44
@certik Ok! I get it now. So we let the user adjust 'n' so that he gets the desired number of terms.
I was wondering if we'd want to have lazy series expansion. Sympy's lseries uses nseries repeatedly so it is slow. Perhaps we can implement lseries in CSympy only for functions that have a closed form.
I benchmarked hash comparisons for symbols here
It seems to be the fastest. It'd be great if someone else could benchmark it too.
Ondřej Čertík
Feb 11 2015 19:14
I don't like the hash comparison, as two different symbols with the same hash will compare equal.
As to series, I am experimenting with the series design here:
Essentially, the series are just polynomials, and so fast polynomial arithmetic must be used.
Read also the docstring of FormalPowerSeries in the branch.