[Date Index] [Thread Index] [Author Index]
Re: Simplifying expressions containing Bessel functions?
On 28 May 2007, at 14:08, AES wrote: > Is there any kind of Simplification procedure in Mathematica that will > somehow apply the recursion relations between Bessel functions of > orders > n-1, n and n+1 to eliminate the highest orders in an expression? > > I realize this is not a simple topic -- but it would be nice if > > D[x BesselJ[1, x], x] > > would yield > > x BesselJ[0, x] > > rather than > > BesselJ[1, x] + (x/2) ( BesselJ[0, x] - BesselJ[2, x] ) > FullSimplify[D[x*BesselJ[1, x], x]] x*BesselJ[0, x] ?????? Andrzej Kozlowski