Ticket #853 (needs_info enhancement)
Add a pslq implementation to Sage
|Reported by:||was||Owned by:||was|
|Cc:||burcin, robertwb||Work issues:||need advice on interface|
|Report Upstream:||N/A||Reviewers:||David Kirkby|
|Authors:||Paul Zimmermann, Alex Ghitza||Merged in:|
Description (last modified by AlexGhitza) (diff)
David Bailey's ARPREC package http://crd.lbl.gov/~dhbailey/mpdist/ includes several implementations of PSLQ, written in C++, and is licensed under BSD. However, ARPREC raw multi arithmetic timings don't look too favorable http://pari.math.u-bordeaux.fr/benchs/timings-mpfr.html and one has the same fix-x86 issues as quad-double. It looks like, however, one of the advantages of PSLQ is that it does not require full-precision at many of the intermediate steps. (that's what this two-level stuff is about in his package--most operations are performed with machine-double arithmetic).
Zimmermann also has a GPL implementation, based on gmp, which is only 1000 lines long. http://www.loria.fr/~zimmerma/free/ No idea yet how speeds compare.
- Summary changed from Add a pslq implementation to Sage to [with patch] Add a pslq implementation to Sage
- Status changed from needs_work to needs_info
- Work issues set to need advice on interface
- Milestone changed from sage-wishlist to sage-4.3.3
- Summary changed from [with patch] Add a pslq implementation to Sage to Add a pslq implementation to Sage
- Authors set to Paul Zimmermann, Alex Ghitza