We can just go the Maxima approach, and write quadQag, quadQng etc (Maxima
has quad_qag, quad_qng) - this retains the naming convention from
QUADPACK. Or we could have a domain QUAD which included operations qag,
qng etc... like this:
v := quad(x+->exp(-x^2),0,1,1.0e-10)
qag(v)
As to other quic
Here is a little design issue concerning names.
Right now we have the example of 'gslIntegrationQng' and I have
started to fill in some miscellaneous functions such as
gslLookup: String -> Symbol
++ \spad{\gslLookup} finds GSLL function by GSL name and
++ displays some documentati
Now that Karl has provided a fantastic working template for an integration
routine from QUADPACK/GSL/GSLL it should be possible to extend those files
to incorporate some of the other routines. For the next few days I'll not
have much time, but I'll aim to fiddle later in the week. And I might ev
Ralf Hemmecke wrote:
>
> > Nothing changed in Factored, but now Polynomial(Integer) has
> > UniqueFactorizationDomain. Now coercion to Factored is
> > performing factorization:
> >
> > (1) -> (x^2 - 1)::Factored(?)
> >
> >(1) (x - 1)(x + 1)
> > Typ
That's very "ok" :)
Unfortunately I have little time to contribute to this topic, but you
know much more about these things anyway. I also had a glance over the
FFI of OpenAxiom which Alfredo Portes posted recently here. Looks quite
interesting but here too, I have to avoid frittering ;)
I'll kee
> Nothing changed in Factored, but now Polynomial(Integer) has
> UniqueFactorizationDomain. Now coercion to Factored is
> performing factorization:
>
> (1) -> (x^2 - 1)::Factored(?)
>
>(1) (x - 1)(x + 1)
> Type: Factored(Polynomial(Integer))
>
> Th
Hello Bill,
that's great. There is a lot in Lisp which is a "black spot" to me,
especially this "multiple value" stuff. Since this also seems to be
solved I think this could be a starting point.
Thank you and
best regards
Kurt
Am 26.10.2015 um 05:14 schrieb Bill Page:
> Alasdair and Kurt,
>
>
I just dropped this "proof-of-concept" level code into a repository at:
https://github.com/billpage/gsla
Title: GNU Scientific Library for Axiom (and FriCAS and OpenAxiom)
I hope there are no objections or let me know.
Please check it out and test it. Feel free to fork it, make changes, etc.
Ralf Hemmecke wrote:
>
> Hi Waldek,
>
> Did you change anything in Factored?
>
> As far as I remember (and a very old FriCAS form 2011 that I still have
> around confirms this), there was no automatic factorization in (3). I
> thought this was deliberate, because factorization costs time and (2)
Added the 'algdep' function; I will have a look at the automatical control
of precision
and finish cleaning the code. Regards.
Le lundi 26 octobre 2015 11:29:47 UTC+1, Waldek Hebisch a écrit :
>
> Thomas Baruchel wrote:
> >
> > I would be very happy to have this package included in Fricas; I be
Hi Waldek,
Did you change anything in Factored?
As far as I remember (and a very old FriCAS form 2011 that I still have
around confirms this), there was no automatic factorization in (3). I
thought this was deliberate, because factorization costs time and (2)
and (3) might only be intermediate op
Thomas Baruchel wrote:
>
> I would be very happy to have this package included in Fricas; I began to
> clean the code according to your comments.
> I also added a maximum number of iterations (in order to avoid infinite
> loops when requested precision is higher than current
> number of digits).
Le dimanche 25 octobre 2015 04:51:06 UTC+1, Waldek Hebisch a écrit :
>
> Thomas Baruchel wrote:
> >
> > I think the package is ready now;
> >
> > https://github.com/baruchel/numerical-routines/tree/master/spad
> >
> > The PSLQ (which was once selected as one of the "Top Ten Algorithms of
> t
13 matches
Mail list logo
