OK, created this issue:
https://github.com/sympy/sympy/issues/18842
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sympy+unsubscr...@googlegroups.com.
To view this
The current evalf() is used to evaluate a numerical expression into a
floating-point number using an arbitrary precision library mpmath.
What I want to do is to get the best answer for different ranges that
varies from (-inf, inf) without increasing precision.
for example:
expr1 = (x + 1)**0.5
Yes, I just looked closer and what is written there is quite
confusing. The purpose of the convention is to define what happens
when the upper limit is less than the lower limit. I believe it also
defines what happens when the limits are nonintegral, but I could be
misremembering that. The
I couldn't find any examples in open issues which require the generating
function algorithm to solve. I will keep looking at the issues and the
codebase to better understand them.
As for the Karr Algorithm, thank you for the suggestion! I will split its
implementation to smaller pieces and
