Sage Days 3 Coding Sprints

List your ideas for coding sprints here.

1. Josh Kantor: Sparse numerical linear algebra

2. Tom Boothby: [http://cr.yp.to/papers/pippenger.pdf Pippenger's Algorithm] for multivariate polynomial evaluation

3. William Stein: Optimized exact sparse and dense linear algebra (especially for computing modular forms)
4. David Harvey (+ possibly Martin Albrecht): multithreaded polynomial arithmetic in FLINT
5. David Roe: p-adics (extension fields)
6. Tom Boothby: 3d object arithmetic / integration with tachyon

NOTE

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.