450
Comment:

← Revision 30 as of 20081114 13:42:05 ⇥
2010
converted to 1.6 markup

Deletions are marked like this.  Additions are marked like this. 
Line 5:  Line 5: 
* Josh Kantor: Sparse numerical linear algebra  1. ([[days3/sprints/sparsenumerical Josh Kantor: Sparse numerical linear algebra]]) 
Line 7:  Line 7: 
* Tom Boothby: [http://cr.yp.to/papers/pippenger.pdf Pippenger's Algorithm] for multivariate polynomial evaluation  * [[days3/sprints/pippenger Tom Boothby: Pippenger's Algorithm for fast multivariate polynomial evaluation]] 
Line 9:  Line 9: 
* William Stein: Optimized exact sparse and dense linear algebra (especially for computing modular forms)  * [[days3/sprints/exactlinalg William Stein: Optimized exact sparse and dense linear algebra (especially for computing modular forms)]] 
Line 11:  Line 11: 
* David Harvey (+ possibly Martin Albrecht): multithreaded polynomial arithmetic in FLINT  * (cancelled) [[days3/sprints/flint David Harvey (+ possibly Martin Albrecht): multithreaded polynomial arithmetic in FLINT]] * [[days3/sprints/roe David Roe: padics (extension fields) (David Harvey would like to help with this)]] * [[days3/sprints/3d Tom Boothby/Robert Bradshaw/Robert Miller: 3d graphics and object arithmetic / integration with tachyon]] * [[days3/sprints/objconst David Harvey: would like to experiment further with speeding up object construction]] * [[days3/sprints/dsage Yi Qiang & Alex Clemesha: improve user interface for dsage, get rid of dsage_console.py, implement SQLite backend, remove server side pickling/unpickling. ]] * [[days3/sprints/Supersingular Iftikhar Burhanuddin: Investigte memory leaks associated to SupersingularModule code.]] * [[days3/sprints/examples William Stein: Revamp the SAGE_ROOT/examples directory so it is better documented and automatically tested.]] * [[days3/sprints/vmware WilliamStein: Create a new vmware virtual machine for SAGE; make it easy to config as web server, DSage worker, etc.]] == NOTE == It would be very good to do the following for each sprint project (on a separate page linked to from above). a. create a specific detailed realistic list of goals. a. list every possible problem they can think of that might cause problems for (a) a. how many people are needed to do a) a. background reading material that sprinters should look at (this could be papers or source code). a. list anything else that could go wrong, and ways to deal with it. 
Sage Days 3 Coding Sprints
List your ideas for coding sprints here.
Tom Boothby: Pippenger's Algorithm for fast multivariate polynomial evaluation
(cancelled) David Harvey (+ possibly Martin Albrecht): multithreaded polynomial arithmetic in FLINT
David Roe: padics (extension fields) (David Harvey would like to help with this)
David Harvey: would like to experiment further with speeding up object construction
Iftikhar Burhanuddin: Investigte memory leaks associated to SupersingularModule code.
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.