# Sage Days 3 Coding Sprints

List your ideas for coding sprints here.

- [:days3/sprints/sparsenumerical: Josh Kantor: Sparse numerical linear algebra]
- [:days3/sprints/pippenger: Tom Boothby: Pippenger's Algorithm for fast multivariate polynomial evaluation]
- [:days3/sprints/exactlinalg: William Stein: Optimized exact sparse and dense linear algebra (especially for computing modular forms)]
- [:days3/sprints/flint: David Harvey (+ possibly Martin Albrecht): multithreaded polynomial arithmetic in FLINT]
- [:days3/sprints/roe: David Roe: p-adics (extension fields) (David Harvey would like to help with this)]
- [:days3/sprints/3d: Tom Boothby: 3d object arithmetic / integration with tachyon]
- [:day3s/sprints/objconst: David Harvey: would like to experiment further with speeding up object construction]
- [:days3/sprints/dsage: Yi Qiang: improve user interface for dsage, get rid of dsage_console.py, implement SQLite backend, remove server side pickling/unpickling. ]

## NOTE

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

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