PURRS
|
The Parma Recurrence Relation Solver News
Here is the news archive
of the Parma Recurrence Relation Solver.
Oct 28, 2004 |
Andrea made it, at last!
Andrea Pescetti got a Laurea degree in Mathematics with full marks
and honors with a dissertation on his implementation of the
Zeilberger algorithm
(advisers
Roberto Bagnara and
Alessandro Zaccagnini).
The thesis defense was really good (which is kind of strange,
since the rehearsal one hour before the real show was deadly boring ;-)
Congratulations, Dottor Pescetti!
|
Aug 18, 2003 |
New paper available
The Automatic
Solution of Recurrence Relations. I. Linear Recurrences of Finite Order
with Constant Coefficients: this is the first in a series
devoted to the presentation of all the mathematics behind
the PURRS project.
This paper describes algorithmic techniques for the efficient
solution of a wide class of linear recurrences of finite order
with constant coefficients.
The presentation is thorough and reasonably
self-contained, covering topics such as the automatic solution of
polynomial equations and efficient, exact symbolic summation of
some special functions.
|
Jun 26, 2003 |
New demo hits the Web
This demonstrates new PURRS features such as support for
linear recurrence relations of infinite order and ultra-sharp
bounds for divide-et-impera recurrences.
|
May 22, 2003 |
PURRS seminar at UPM
The seminar Symbolic Computation Support for Complexity Analysis
and the PURRS Project was given at the
Universidad Politécnica de Madrid.
The slides
probably constitute the most complete description of the PURRS project
available to date.
|
Apr 29, 2003 |
A barbaric YOP for Tatiana!
(Chi è Tatiana?!?)
Tatiana Zolo got a Laurea degree in Mathematics with a dissertation
on the automatic solution of recurrence equations
(advisers
Roberto Bagnara,
Alessandro Zaccagnini
and
Enea Zaffanella).
The thesis defense was excellent (even though the laser pointer
could have been used more effectively ;-)
Congratulations, Dottoressa Zolo!
|
Feb 07, 2003 |
Brand new demo put online
This one solves some non-linear recurrence relations of finite order
and approximates many more generalized recurrences and with tighter
bounds than the previous version.
|
Jan 21, 2003 |
Yet another new demo put online
This is a much improved version that also solves some
generalized recurrences.
|
Oct 29, 2002 |
New demo put online
This one solves also linear recurrences of the first order
with variable coefficients.
|
Jul 24, 2002 |
The PURRS project goes public
There is nothing released yet, nothing to download:
only a statement of which problem we sat down to solve
and Web-based demos of the first steps we made.
|
[Page last updated on January 21, 2013, 08:18:13.]
|