On Tue, Apr 13, 2021 at 03:49:16PM -0700, Tobias Neumann wrote:
>
> >
> > > test := 1.1
> > > >> System error:
> > > The value NIL is not of the expected type CCL::UVECTOR.
> >
> > Which version of Clozure CL did you try? ATM my testing version
> > is 11.5.
> >
>
> I am using 1.12 (it's the
On Tue, Apr 13, 2021 at 03:49:16PM -0700, Tobias Neumann wrote:
>
> >
> > > test := 1.1
> > > >> System error:
> > > The value NIL is not of the expected type CCL::UVECTOR.
> >
> > Which version of Clozure CL did you try? ATM my testing version
> > is 11.5.
> >
>
> I am using 1.12 (it's the
>
> > test := 1.1
> > >> System error:
> > The value NIL is not of the expected type CCL::UVECTOR.
>
> Which version of Clozure CL did you try? ATM my testing version
> is 11.5.
>
I am using 1.12 (it's the newest release)
"Clozure Common Lisp Version 1.12 (v1.12-37-g27c4bc11) LinuxX8664"
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.
>
>
On Tue, Apr 13, 2021 at 10:35:58AM -0700, Tobias Neumann wrote:
>
> >
> > There is Closure CL, AFAIK it works fine. I do not know how
> > many FriCAS users buid it on top of Closure CL, but it is
> > quite good Lisp implementation. One higlight is precise
> > garbage collector: with sbcl (and
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.
On Thursday, April
On Tue, Apr 13, 2021 at 6:36 PM Tobias Neumann wrote:
>>
>> There is Closure CL, AFAIK it works fine. I do not know how
>> many FriCAS users buid it on top of Closure CL, but it is
>> quite good Lisp implementation. One higlight is precise
>> garbage collector: with sbcl (and probably ecl too) it
>
> There is Closure CL, AFAIK it works fine. I do not know how
> many FriCAS users buid it on top of Closure CL, but it is
> quite good Lisp implementation. One higlight is precise
> garbage collector: with sbcl (and probably ecl too) it can
> happen that there is free memory but garbage
On Thu, Apr 08, 2021 at 11:05:45AM -0700, Tobias Neumann wrote:
> I'm sure there are tons of these implementations available, but here's
> another one
> (one that I also use in production):
>
> https://www.netlib.org/amos/ https://dl.acm.org/doi/10.1145/7921.214331
> The paper gives a nice
Oh, I must have had some other Fortran code in mind (Gautschi has only $p\in
(0,1)$, indeed).
https://jblevins.org/mirror/amiller/
I guess it was the one below, but there are some others (CTRL-F Bessel ...)
https://jblevins.org/mirror/amiller/cbsslj.f90
cbsslj.f90 Complex Bessel function
On Thu, Apr 08, 2021 at 07:17:42PM +0200, Kurt Pagani wrote:
> Maybe you are already aware of
>
> COMPUTATION OF BESSEL AND AIRY FUNCTIONS AND OF RELATED GAUSSIAN QUADRATURE
> FORMULAE by WALTER GAUTSCHI
> https://www.cs.purdue.edu/homes/wxg/selected_works/section_02/169.pdf
Thanks for
I'm sure there are tons of these implementations available, but here's
another one
(one that I also use in production):
https://www.netlib.org/amos/ https://dl.acm.org/doi/10.1145/7921.214331
The paper gives a nice visual presentation of which method is used in which
region.
It's quite
Here is a link to ARB Airy implementation:
https://github.com/fredrik-johansson/arb/blob/master/acb_hypgeom/airy.c
Riccardo
--
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
Maybe you are already aware of
COMPUTATION OF BESSEL AND AIRY FUNCTIONS AND OF RELATED GAUSSIAN QUADRATURE
FORMULAE by WALTER GAUTSCHI
https://www.cs.purdue.edu/homes/wxg/selected_works/section_02/169.pdf
The code is in Fortran though.
https://www.cs.purdue.edu/archives/2001/wxg/codes/
IMO it
This is mainly to let you know why bug fixes take so much
time. There is old bug, namely our numeric Airy functions
fails for positive real arguments (and gives quite wrong
results for some complex arguments). Problem is that
our current formula for Airy Ai uses Bessel functions and
square root.
15 matches
Mail list logo
