11/15/2022 0 Comments Fortran zeros of bessel function![]() ![]() ![]() It will not become faster by including a hardcoded table for the intervals. ![]() On my iMac this code takes about 2 µs per iteration. This is no production code but I thought maybe it provides a starting point for you. Of course you need to work on the convergence detection and error checking. From this result we can see that any Bessel function of any order had an innitey of zeros. That is in most cases relatively stable and if the integrand is approaching zero reasonable fast easy to do.Īs a starting point for playing around I´ve included a bit of code. Last time I had to do with such things, it was state of the art to do simple integration of the intervals defined by the zero crossings. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |