[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Bessel Functions and Numerical Recipes



Anyone have a robust algorithm to compute ordinary
Bessel Functions of integer order, greater than order ~ 19
(where IDL 5.4 currently cuts off).

Another question:

Has anyone converted a substantial portion of
Numerical Recipes [e.g., Fortran], to IDL? Are there public libraries for
this sort of thing? Numerical Recipes algorithms seem much more
stable/reliable than those in IDL and I have the complete Fortran code for
most Numerical Recipes but find it tedious to manually convert between
languages each time I want a program.

Thanks!

-Brian

Thanks,

-Brian