Note also that, for computing with residues, you don't need a precise
list of the poles, just a *superset*. Just as you don't need precise
knowledge of the growth of the function, just an upper bound (although
here you probably want to be tighter). So it might be best to look at
all parts of an expression in turn to determine the poles (i.e.
recursively apply poles(f+g) = poles(f) union poles(g), same for
multiplication etc.)
On 28.03.2012 12:05, Chris Smith wrote:
On Wed, Mar 28, 2012 at 4:42 PM, arpit goyal <agmp...@gmail.com
<mailto:agmp...@gmail.com>> wrote:
Aaron ,
I looked the code ,and then then tested the working
solve(x*cos(x),x) the answer was very accuraely given (not all x for
cos(x) was shown or general solutions was not shown ) but
solve(x**2*cos(x),x) , NotImplementedError: Unable to solve the
equation.
Be sure to get the current master since there,
>>> solve(x**2*cos(x),x)
[0, pi/2]
--
You received this message because you are subscribed to the Google
Groups "sympy" group.
To post to this group, send email to sympy@googlegroups.com.
To unsubscribe from this group, send email to
sympy+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/sympy?hl=en.
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sympy@googlegroups.com.
To unsubscribe from this group, send email to
sympy+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/sympy?hl=en.
