On Tue, Apr 13, 2021 at 01:58:32PM -0700, Richard Fateman wrote:
> Here's a paper that discusses Bessel function computation in the context of
> arbitrary precision.
> Miller's algorithm (backward recurrence) is one method, but there are
> other methods for
> large argument.
>
> https://people.eecs.berkeley.edu/~fateman/papers/hermite.pdf
>
> Have fun.
Earlier I wrote:
> > >
> > > BTW: Obvious thing to do is to look at other implementations.
> > > ATM I have not found "full range" implementation, that
> > > is one giving good accuracy for all arguments where
> > > function may be computed (there good looking implementations
> > > for real p). According to various papers Mathematica
> > > is using multiple procision which gives good accuracy,
> > > but is so slow for some arguments that range is
> > > limited by compute time. AFAICS the same it true of
> > > mpmath.
Thanks for reference, but it seems that your paper have
similar limitation as other works: it concentrates on
real order (or maybe even integer orders).
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/fricas-devel/20210413223341.GC16648%40math.uni.wroc.pl.
