|
Size: 2965
Comment:
|
Size: 3432
Comment: added actual projects
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| List any and all project ideas here. Use the format * (name) Project idea. If the idea is more than one line, make a [:/example: link like this (note the leading slash) to more info]. |
== Projects == * elliptic curves (John, rpw, was) * getting g0n into Sage * sparse linear algebra over * |
| Line 6: | Line 9: |
| == Here they are == | * multivariate polynomial quotient rings (Burcin, malb, Ludovic, Michael Brickenstein) * generic polynomial division/reduction * quotient rings via libSINGULAR * PolyBoRi integration * FGB integration * coercion model/calculus/programming manual (robertwb, roed, John Hanke, Ondrey, David Loeffler, Jaap) * packages/updates/LinBox (cpernet, mabshoff) * LinBox bugfixes and updates * Givaro * IML * benchmarketing (robertwb, Willem) * doctest benchmarking interface == Originally Proposed Projects == |
Sage Days 6 Coding Sprints
Projects
- elliptic curves (John, rpw, was)
- getting g0n into Sage
sparse linear algebra over
Fq #E(Fq)
- multivariate polynomial quotient rings (Burcin, malb, Ludovic, Michael Brickenstein)
- generic polynomial division/reduction
- quotient rings via libSINGULAR
PolyBoRi integration
- FGB integration
- coercion model/calculus/programming manual (robertwb, roed, John Hanke, Ondrey, David Loeffler, Jaap)
- packages/updates/LinBox (cpernet, mabshoff)
LinBox bugfixes and updates
- Givaro
- IML
- benchmarketing (robertwb, Willem)
- doctest benchmarking interface
Originally Proposed Projects
(If this list gets much longer -- which it will - we might want to have subheadings, e.g. number fields, linear algebra, elliptic curves... -- john.cremona)
- (wstein and ondrej certik) [:/debian: determine exactly which sage packages are in debian]
- (robertwb, roed, willem, jaap, jon hanke, david loeffler, ondrej) [:/prog_guide: Programming Guide]
- (robertwb, roed, willem, jaap, jon hanke, david loeffler, ondrej) [:/coercion: Coercion]
- (robertwb, roed, willem, jaap, jon hanke, david loeffler, ondrej) [:/calculus: Calculus]
- (wstein) upgrade the freetype package in sage.
- (wstein) upgrade the cvxopt package to 0.9
- (wstein) Number fields -- Reduction modulo a prime ideal, or any ideal.
- (wstein) Number fields -- optimize K([1,2,3,4,5]), etc., for K number field or order.
- (wstein) Timing of doctests (partially done)
- (wstein) Double question mark for spyx files doesn't work.; docstrings work.
- (wstein) Markup Cython code based on what C code it generates.
- (wstein) R Python expect interface
- (wstein) [:/edwards: Redo all the "edwards coord" proofs in Sage instead of Magma.]
- (wstein) ATLAS into Sage on Linux.
- (wstein) Linbox -- get rid of all the crappy hacks for minpoly/charpoly use in Sage.
- (wstein) Linbox -- fix wrapping of smith_form problems in Sage.
- (wstein) Create pickle database
- (wstein) Document number fields.
(wstein) Compute kernels of matrices over
Z/pnZ .- (Ondrej Certik) simplify/improve calculus in SAGE [:/calculus: see this link for more info]
(mabshoff) fix BlasMatrix::Hom leak in LinBox
- (mabshoff) start of 2.8.13 release cycle
- (david harvey) try to improve cache efficiency of NTL's FFT routine
- (Bill Allombert) improve PARI ECM implementation
- (john.cremona) adapt interface to new Simon gp scripts
- (john.cremona) elliptic curve isomorphisms, urst transforms of curves and points
(john.cremona) improved
#E(Fqd) for elliptic curves defined overFq (malb) speed up
GF(pn) forp/=2 andpn≥216 (using NTL::ZZ_pE and NTL::zz_pE)- (malb) implement quotient rings over multivariate polynomial rings over finite fields using libSINGULAR
- (malb) implement multivariate polynomial rings over number fields using libSINGULAR
(malb) implement sparse matrices over
GF(pn) (using Givaro) modelled after sparse matrices modint.- (weinmann) related to malb's point directly above: merge smatlib code into SAGE.
- (weinmann) extend MPolynomialSystemGenerator such that equation systems for (stream and block) ciphers can be generated in a generic way.