Sage Days 3 Coding Sprints

List your ideas for coding sprints here.

  1. (Josh Kantor: Sparse numerical linear algebra)

  2. Tom Boothby: Pippenger's Algorithm for fast multivariate polynomial evaluation

  3. William Stein: Optimized exact sparse and dense linear algebra (especially for computing modular forms)

  4. (cancelled) David Harvey (+ possibly Martin Albrecht): multithreaded polynomial arithmetic in FLINT

  5. David Roe: p-adics (extension fields) (David Harvey would like to help with this)

  6. Tom Boothby/Robert Bradshaw/Robert Miller: 3d graphics and object arithmetic / integration with tachyon

  7. David Harvey: would like to experiment further with speeding up object construction

  8. Yi Qiang & Alex Clemesha: improve user interface for dsage, get rid of, implement SQLite backend, remove server side pickling/unpickling.

  9. Iftikhar Burhanuddin: Investigte memory leaks associated to SupersingularModule code.

  10. William Stein: Revamp the SAGE_ROOT/examples directory so it is better documented and automatically tested.

  11. WilliamStein: Create a new vmware virtual machine for SAGE; make it easy to config as web server, DSage worker, etc.


It would be very good to do the following for each sprint project (on a separate page linked to from above).

  1. create a specific detailed realistic list of goals.
  2. list every possible problem they can think of that might cause problems for (a)
  3. how many people are needed to do a)
  4. background reading material that sprinters should look at (this could be papers or source code).
  5. list anything else that could go wrong, and ways to deal with it.

days3/sprints (last edited 2008-11-14 13:42:05 by localhost)