Lines Matching refs:fX
83 double fX = fabs(x); in BesselJ() local
86 double fEstimateIteration = fX * 1.5 + N; in BesselJ()
87 bool bAsymptoticPossible = pow(fX,0.4) > N; in BesselJ()
91 return fSign * sqrt(f_2_DIV_PI/fX)* cos(fX-N*f_PI_DIV_2-f_PI_DIV_4); in BesselJ()
119 g_bar = - 2.0/fX; // k = 1.0, g = 0.0 in BesselJ()
134 g_bar = m_bar - 2.0*k/fX + g; in BesselJ()
143 g_bar = m_bar - 2.0*k/fX + g; in BesselJ()
155 g_bar = m_bar - 2.0*k/fX + g; in BesselJ()
341 double Bessely0( double fX ) throw( IllegalArgumentException, NoConvergenceException ) in Bessely0() argument
343 if (fX <= 0) in Bessely0()
346 if (fX > 5.0e+6) // iteration is not considerable better then approximation in Bessely0()
347 return sqrt(1/f_PI/fX) in Bessely0()
348 *(rtl::math::sin(fX)-rtl::math::cos(fX)); in Bessely0()
351 double alpha = log(fX/2.0)+EulerGamma; in Bessely0()
357 double g_bar = -2.0 / fX; in Bessely0()
378 g_bar = m_bar - (2.0*k)/fX + g; in Bessely0()
395 double Bessely1( double fX ) throw( IllegalArgumentException, NoConvergenceException ) in Bessely1() argument
397 if (fX <= 0) in Bessely1()
400 if (fX > 5.0e+6) // iteration is not considerable better then approximation in Bessely1()
401 return - sqrt(1/f_PI/fX) in Bessely1()
402 *(rtl::math::sin(fX)+rtl::math::cos(fX)); in Bessely1()
405 double alpha = 1.0/fX; in Bessely1()
411 alpha = 1.0 - EulerGamma - log(fX/2.0); in Bessely1()
413 double g_bar = -2.0 / fX; in Bessely1()
436 g_bar = m_bar - (2.0*k)/fX + g; in Bessely1()