Differences between revisions 9 and 10
⇤ ← Revision 9 as of 2006-10-11 18:30:56 →
Size: 2283
Editor: AlexClemesha
Comment:
← Revision 10 as of 2006-10-11 20:26:23 → ⇥
Size: 2802
Editor: anonymous
Comment:
Deletions are marked like this. Additions are marked like this.
Line 52: Line 52:
== Graph Theory Implementation ==

Emily Kirkman, Robert Miller, Bobby Moretti

 * [http://sage.math.washington.edu:9001/graph Existing Software] list; includes links to several algorithm pages also; list will be complete by 10/13/06
 * currently interfacing NetworkX with SAGE
 * experts will be contacted regarding a) the completeness of the list, b) the best benchmark tests
 * ''thorough'' benchmarking to begin soon: we will set up another wiki for results
 * after benchmarking, the real fun begins...

A page to summarise and coordinate SAGE development activity.

Core arithmetic team

David Harvey, Martin Albrecht, Joel Mohler, Robert Bradshaw, William Stein

  • Develop new __mul__ semantics for rings/algebras using something like ToyQuarternionAlgebraElement as a test case.

  • Migrate _add_, _mul_ etc to new _add_sibling, _add_sibling_cdef, framework etc. Intention is to eventually remove _add_ everywhere.

  • Change all __add__ methods (etc) to use new fast code pathways, pyrex tricks, as studied at SAGE Days 2.

  • Try changing a.parent() == b.parent() conditions to a._parent is b._parent in various places and see what breaks.

  • Write up more entries in WritingFastPyrexCode. (everyone)

  • Write a benchmarking module.
  • Optimise pyrex in coercion module.

  • Make Algebra _base_ring into a cdef attribute.

  • Move univariate Polynomial class down to Pyrex, and make it inherit from CommutativeAlgebra instead of CommutativeRing. (David)

    • Rewrite polynomials over Z and Z/nZ using direct NTL calls. (David)

  • Optimise new integers mod n code using fast pyrex tricks.
  • Wrap NTL finite fields and polynomials over finite fields.

  • Benchmark omalloc. (Martin)

  • Linear algebra (perhaps William or Robert want to say something here?)

Lower priority issues

  • Make generic dense polynomial class in pyrex using C arrays to store coefficients?

Making SAGE Releases (Packaging and Integration)

  • William Stein
  • Getting sage-1.4.1 ready:
    • New maxima, pari, clisp.
    • Editing and including axiom interface.

Notebook/web team

  • Tom Boothby, Alex Clemesha, Dorian Raymer, William Stein
  • Change the Notebook over to use Twisted
  • Add SSL support for the Notebook (with Twisted/pyOpenSSL)
  • Make public Notebook more secure (no cross-side scripting / encrypted passwords / change root jail / ...)
  • Add notebook help browser
  • Wikify some parts of the Notebook
  • Add ability to edit plain text Notebook cells and then re-upload

3D Graphics

Alex Clemesha, Robert Miller, ...

  • Add 3D Graphics built on top of matplotlib

Graph Theory Implementation

Emily Kirkman, Robert Miller, Bobby Moretti

  • [http://sage.math.washington.edu:9001/graph Existing Software] list; includes links to several algorithm pages also; list will be complete by 10/13/06

  • currently interfacing NetworkX with SAGE
  • experts will be contacted regarding a) the completeness of the list, b) the best benchmark tests

  • thorough benchmarking to begin soon: we will set up another wiki for results

  • after benchmarking, the real fun begins...

Other groups add yourselves here