Differences between revisions 8 and 9
Revision 8 as of 2007-02-13 21:47:04
Size: 562
Editor: D-128-208-202-175
Comment:
Revision 9 as of 2007-02-13 21:49:51
Size: 1012
Editor: D-128-208-202-175
Comment:
Deletions are marked like this. Additions are marked like this.
Line 16: Line 16:

== NOTE ==

It would be very good to do the following for each sprint project:
    a) create a specific detailed realistic list of goals.
    b) list every possible problem they can think of that might cause problems for (a)
    c) how many people are needed to do a)
    d) background reading material that sprinters should look at (this could be papers or source code).
    e) anything else that could go wrong, and ways to deal with it.

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:

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

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