On 10/09/2014 11:15 AM, William Sit wrote:
> Some people already have Maple?
OK. But it will not help if you do not have the shasta executable
locally on your machine. So you need the Shasta and SumIt sources and
the Aldor compiler anyway to interface to maple.
I know that Bronstein used to expos
Some people already have Maple?
William
On Thu, 09 Oct 2014 10:48:31 +0200
Ralf Hemmecke wrote:
On 10/09/2014 10:21 AM, William Sit wrote:
Shasta has a Maple interface too.
http://www-sop.inria.fr/cafe/Manuel.Bronstein/sumit/shastadoc/node9.html
Why interface to Maple if Shasta source code
On 10/09/2014 10:21 AM, William Sit wrote:
> Shasta has a Maple interface too.
> http://www-sop.inria.fr/cafe/Manuel.Bronstein/sumit/shastadoc/node9.html
Why interface to Maple if Shasta source code is free?
https://gforge.inria.fr/projects/bronstein-codes/
It would probably be a bit of work to
Shasta has a Maple interface too.
http://www-sop.inria.fr/cafe/Manuel.Bronstein/sumit/shastadoc/node9.html
William
On Thu, 09 Oct 2014 04:05:39 +0200
kp wrote:
I've recently discovered a thesis called
"Interactive Computer Manipulation of Formal Sums"
by Nivedita Patil
http://www.csd.uwo.ca
Kurt,
I'm currently reading
Zima, Eugene V.
Accelerating Indefinite Summation: Simple Classes of Summands"
which "presents the history of indefinite summation starting with
classics (Newton, Montmort, Taylor, Stirling, Euler, Boole, Jordan)
followed by modern classics (Abramov, Gosper, Karr) to
I've recently discovered a thesis called
"Interactive Computer Manipulation of Formal Sums"
by Nivedita Patil
http://www.csd.uwo.ca/~watt/home/students/theses/NPatil2010-msc.pdf
and - just for fun - sketched some functions from the text. There seems
to be a lot of symbolic summation code around
On 10/08/2014 09:31 PM, William Sit wrote:
> Didn't Schneider implemented the algorithm in Mathematica around 2000?
> http://www.emis.de/journals/SLC/wpapers/s43schneider.pdf
Probably more of the theory can be found in his thesis.
http://www.risc.jku.at/publications/download/risc_3017/SymbSumTHES
http://www.risc.jku.at/research/combinat/software/Sigma/index.php
On 8 October 2014 15:31, William Sit wrote:
> Didn't Schneider implemented the algorithm in Mathematica around 2000?
> http://www.emis.de/journals/SLC/wpapers/s43schneider.pdf
>
> William
>
>
> On Wed, 08 Oct 2014 11:02:21 -0400
>
i originally thought that implementing (or reimplementing) would be easy
as a walk in the park...
Victor
On 10/8/2014 3:31 PM, William Sit wrote:
Didn't Schneider implemented the algorithm in Mathematica around 2000?
http://www.emis.de/journals/SLC/wpapers/s43schneider.pdf
William
On Wed,
Didn't Schneider implemented the algorithm in Mathematica
around 2000?
http://www.emis.de/journals/SLC/wpapers/s43schneider.pdf
William
On Wed, 08 Oct 2014 11:02:21 -0400
Victor Adamchik wrote:
Tim,
We have tried to implement Karr-Schneider algorithm in
Mathematica, however we met two pro
Tim,
We have tried to implement Karr-Schneider algorithm in Mathematica,
however we met two problems that we are not sure how to deal with. If
you are interested, Javier can provide more details on this.
Victor
--
~~
Vict
>We have tried to implement Karr-Schneider algorithm in Mathematica,
>however we met two problems that we are not sure how to deal with. If
>you are interested, Javier can provide more details on this.
>
>Victor
There is no such thing as a simple job.
I'd be interested to know the nature of the
Javier,
Thank you for your thesis. It will, of course, take a while for me to
read and understand the details. Eventually I'd like to implement this
in Axiom but it won't be soon.
In case you haven't heard of it, Axiom was a commercial competitor
to Mathematica and Maple, sold by the Numerical Al
13 matches
Mail list logo
