Bessel Functions - 10.29 Recurrence Relations and Derivatives

From testwiki
Revision as of 11:25, 28 June 2021 by Admin (talk | contribs) (Admin moved page Main Page to Verifying DLMF with Maple and Mathematica)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search


DLMF Formula Constraints Maple Mathematica Symbolic
Maple
Symbolic
Mathematica
Numeric
Maple
Numeric
Mathematica
10.29#Ex5 I 0 ( z ) = I 1 ( z ) diffop modified-Bessel-first-kind 0 1 𝑧 modified-Bessel-first-kind 1 𝑧 {\displaystyle{\displaystyle I_{0}'\left(z\right)=I_{1}\left(z\right)}}
\modBesselI{0}'@{z} = \modBesselI{1}@{z}
( 0 + k + 1 ) > 0 , ( 1 + k + 1 ) > 0 formulae-sequence 0 𝑘 1 0 1 𝑘 1 0 {\displaystyle{\displaystyle\Re(0+k+1)>0,\Re(1+k+1)>0}}
diff( BesselI(0, z), z$(1) ) = BesselI(1, z)
D[BesselI[0, z], {z, 1}] == BesselI[1, z]
Successful Successful - Successful [Tested: 7]
10.29#Ex6 K 0 ( z ) = - K 1 ( z ) diffop modified-Bessel-second-kind 0 1 𝑧 modified-Bessel-second-kind 1 𝑧 {\displaystyle{\displaystyle K_{0}'\left(z\right)=-K_{1}\left(z\right)}}
\modBesselK{0}'@{z} = -\modBesselK{1}@{z}

diff( BesselK(0, z), z$(1) ) = - BesselK(1, z)
D[BesselK[0, z], {z, 1}] == - BesselK[1, z]
Successful Successful - Successful [Tested: 7]