| Bessel Functions and Numerical Recipes [message #23902] |
Mon, 26 February 2001 13:46  |
Brian Keating
Messages: 1
Registered: February 2001
|
Junior Member |
|
|
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
|
|
|
|
| Re: Bessel Functions and Numerical Recipes [message #23987 is a reply to message #23902] |
Thu, 01 March 2001 17:45  |
Michael Asten
Messages: 53
Registered: March 1999
|
Member |
|
|
Brian Keating wrote:
> Anyone have a robust algorithm to compute ordinary
> Bessel Functions of integer order, greater than order ~ 19
> (where IDL 5.4 currently cuts off).
You might try the website below; I have had some success in free translation
from the fortran original to idl, for a couple of the routines (but not
yours), without need to restructure the code.
Regards,
Michael Asten
;
; website http://iris-lee3.ece.uiuc.edu/~jjin/routines/routines.html
; Jianming Jin, Associate Professor
; Department of Electrical and Computer Engineering
; University of Illinois at Urbana-Champaign
>
>
> 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
|
|
|
|
| Re: Bessel Functions and Numerical Recipes [message #24008 is a reply to message #23902] |
Thu, 01 March 2001 09:25 |
Christopher W. O'Dell
Messages: 20
Registered: February 2001
|
Junior Member |
|
|
Brian Keating wrote:
> Anyone have a robust algorithm to compute ordinary
> Bessel Functions of integer order, greater than order ~ 19
> (where IDL 5.4 currently cuts off).
>
I don't think it exists yet. Mati Meron wrote what looks to be a good routine
for K-Bessel functions of arbitrary order, but not a BeselJ replacement.
Chris
|
|
|
|
comp.lang.idl-pvwave archive
Members
Search
Help
Login
Home
