[Date Index] [Thread Index] [Author Index]

Re: Simplifying expressions containing Bessel functions?

• To: mathgroup at smc.vnet.net
• Subject: [mg76855] Re: [mg76845] Simplifying expressions containing Bessel functions?
• From: Andrzej Kozlowski <akoz at mimuw.edu.pl>
• Date: Mon, 28 May 2007 05:09:50 -0400 (EDT)
• References: <200705280508.BAA15950@smc.vnet.net>

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

• References:
  • Simplifying expressions containing Bessel functions?
    • From: AES <siegman@stanford.edu>