Size: 3246
Comment:
|
Size: 3244
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 87: | Line 87: |
=== Fix sage.functions === | == Fix sage.functions == |
Sage Days 24 Coding Sprint Projects
This is a list of projects suitable for Sage Days 24. Feel free to add your favourite ideas/wishes, and to put your name down for something you're interested in (you'll need to get an account on the wiki to do this).
Contents
GIAC Factoring
People: Thomas, Burcin, Richard, William Stein (total anarchy, no leader!)
Kovacic's Algorithm
People: Burcin, Erocal, Felix
Implement Kovacic's algorithm in Sage.
Hypergeometric Functions
People: Flavia Stan, Karen Kohl, Fredrik Johansson, Zaf
Add a hypergeometric function class + simplifications
Plural support
People: Burcin Erocal, Simon King, Oleksandr, Alex D., Burkhard (total anarchy!)
Add support for Singular's noncommutative component Plural, finish #4539.
Parallel Integration
People: Stefan Boethner, Ralf, Burkhard, Burcin Erocal
Integrate Stefan Boettner's parallel integration code in Sage. There are several prerequisites for this, such as
algebraic function fields (transcendence degree > 1)
- differential rings/fields
- proper to_polynomial(), to_rational() functions for symbolic expressions
Function Fields
The goal of this project is to get the basic infrastructure for function fields into Sage. See Hess's papers and talks.
People: William Stein, Sebastian P.
Trac 9054: Create a class for basic function_field arithmetic for Sage
Trac 9069: Weak Popov Form (reduction algorithm)
Trac 9094: is_square and sqrt for polynomials and fraction fields
Trac 9095: Heights of points on elliptic curves over function fields
Make sure to see this page for more links.
Fast linear algebra over small extensions of GF(2)
People: Martin Albrecht, Ciaran Mullan, Robert Miller, Sebastian P., Thomas
Here is how long Sage currently takes to compute the reduced row echelon form over GF(2^4) on a Macbook Pro (2nd generation):
n |
Sage |
NTL *2 |
Magma |
M4RIE |
1000 |
49.49 |
18.84 |
0.090 |
0.097 |
2000 |
429.05 |
149.11 |
0.510 |
0.529 |
3000 |
1494.33 |
526.57 |
1.640 |
2.315 |
Note that over GF(2^8) this code is already faster than Magma
> K<a> := GF(2^8); > for i := 1000 to 10001 by 1000 do for> A:=RandomMatrix(K,i,i); for> t:=Cputime(); for> E:=EchelonForm(A); for> print i, Cputime(t); for> end for; 1000 1.290 2000 9.870 3000 33.560
gf(2^8), 1000 x 1000: wall time: 0.865 gf(2^8), 2000 x 2000: wall time: 4.306 gf(2^8), 3000 x 3000: wall time: 14.029
Generating Stuff
People: Robert Miller (self-determination!)
Fix sage.functions
People: Frederik, William Stein, Harald
Easy ripping apart of symbolic expression trees
People: Burcin, Thomas, Stefan, Frederik