#10571: print protocol of Groebner basis computations via Singular and Magma
-------------------------------+--------------------------------------------
Reporter: malb | Owner: was
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.6.2
Component: interfaces | Keywords: magma, singular
Author: Martin Albrecht | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-------------------------------+--------------------------------------------
Changes (by malb):
* status: new => needs_review
Old description:
> It would be nice if this would work:
>
> {{{#!python
> sage: P.<x,y,z> = GF(32003)[]
> sage: I = sage.rings.ideal.Katsura(P)
> sage: _ = I.groebner_basis('magma', prot=True)
> Homogeneous weights search
> Number of variables: 3, nullity: 0
> Exact search time: 0.000
> Found best approx weight vector: [1 1 1]
> Norm: 3, count: 1
> Approx search time: 0.000
> ********************
> FAUGERE F4 ALGORITHM
> ********************
> Coefficient ring: GF(32003)
> Rank: 3
> Order: Graded Reverse Lexicographical
> NEW hash table
> Matrix kind: Modular FP
> Datum size: 4
> No queue sort
> Initial length: 3
> Inhomogeneous
>
> Initial queue setup time: 0.000
> Initial queue length: 2
>
> *******
> STEP 1
> Basis length: 3, queue length: 2, step degree: 2, num pairs: 2
> Basis total mons: 11, average length: 3.667
> Number of pair polynomials: 2, at 8 column(s), 0.000
> Average length for reductees: 3.50 [2], reductors: 4.00 [4]
> Symbolic reduction time: 0.000, column sort time: 0.000
> 2 + 4 = 6 rows / 10 columns, 38.333% / 52.487% (3.8333/r)
> Before ech memory: 7.8MB
> Row sort time: 0.000
> 0.000 + 0.000 = 0.000 [2]
> Delete 1 memory chunk(s); time: 0.000
> Number of unused reductors: 1
> After ech memory: 7.8MB
> Queue insertion time: 0.000
> Step 1 time: 0.000, [0.000], mat/total: 0.000/0.000 [0.000], mem: 7.8MB
>
> *******
> STEP 2
> Basis length: 5, queue length: 1, step degree: 3, num pairs: 1
> Basis total mons: 19, average length: 3.800
> Number of pair polynomials: 1, at 6 column(s), 0.000
> Average length for reductees: 4.00 [1], reductors: 4.00 [4]
> Symbolic reduction time: 0.000, column sort time: 0.000
> 1 + 4 = 5 rows / 8 columns, 50% / 67.429% (4/r)
> Before ech memory: 7.8MB
> Row sort time: 0.000
> 0.000 + 0.000 = 0.000 [1]
> Delete 1 memory chunk(s); time: 0.000
> After ech memory: 7.8MB
> Queue insertion time: 0.000
> Step 2 time: 0.000, [0.001], mat/total: 0.000/0.000 [0.001], mem: 7.8MB
>
> *******
> STEP 3
> Basis length: 6, queue length: 1, step degree: 4, num pairs: 1
> Basis total mons: 23, average length: 3.833
> Number of pair polynomials: 1, at 6 column(s), 0.000
> Average length for reductees: 4.00 [1], reductors: 4.00 [6]
> Symbolic reduction time: 0.000, column sort time: 0.000
> 1 + 6 = 7 rows / 9 columns, 44.444% / 63.243% (4/r)
> Before ech memory: 7.8MB
> Row sort time: 0.000
> 0.000 + 0.000 = 0.000 [0]
> Delete 1 memory chunk(s); time: 0.000
> After ech memory: 7.8MB
> Queue insertion time: 0.000
> Step 3 time: 0.000, [0.000], mat/total: 0.000/0.000 [0.001], mem: 7.8MB
>
> Reduce 6 final polynomial(s) by 6
> 2 redundant polynomial(s) removed; time: 0.000
> Interreduce 4 (out of 6) polynomial(s)
> Symbolic reduction time: 0.000
> Column sort time: 0.000
> 4 + 0 = 4 rows / 8 columns, 50% / 68.452% (4/r)
> Row sort time: 0.000
> 0.000 + 0.000 = 0.000 [4]
> Delete 1 memory chunk(s); time: 0.000
> Total reduction time: 0.000
> Reduction time: 0.000
> Final number of polynomials: 4
>
> Number of pairs: 4
> Total pair setup time: 0.000
> Max num entries matrix: 7 by 9
> Max num rows matrix: 7 by 9
> Total symbolic reduction time: 0.000
> Total column sort time: 0.000
> Total row sort time: 0.000
> Total matrix time: 0.000
> Total new polys time: 0.000
> Total queue update time: 0.000
> Total Faugere F4 time: 0.000, real time: 0.001
> }}}
>
> It would also be nice if the protocol is printed live, i.e. whenever
> Magma prints a new line it is immediately displayed by Sage.
New description:
It would be nice if this would work:
{{{
#!python
sage: P.<x,y,z> = GF(32003)[]
sage: I = sage.rings.ideal.Katsura(P)
sage: _ = I.groebner_basis('magma', prot=True)
Homogeneous weights search
Number of variables: 3, nullity: 0
Exact search time: 0.000
Found best approx weight vector: [1 1 1]
Norm: 3, count: 1
Approx search time: 0.000
********************
FAUGERE F4 ALGORITHM
********************
Coefficient ring: GF(32003)
Rank: 3
Order: Graded Reverse Lexicographical
NEW hash table
Matrix kind: Modular FP
Datum size: 4
No queue sort
Initial length: 3
Inhomogeneous
Initial queue setup time: 0.000
Initial queue length: 2
*******
STEP 1
Basis length: 3, queue length: 2, step degree: 2, num pairs: 2
Basis total mons: 11, average length: 3.667
Number of pair polynomials: 2, at 8 column(s), 0.000
Average length for reductees: 3.50 [2], reductors: 4.00 [4]
Symbolic reduction time: 0.000, column sort time: 0.000
2 + 4 = 6 rows / 10 columns, 38.333% / 52.487% (3.8333/r)
Before ech memory: 7.8MB
Row sort time: 0.000
0.000 + 0.000 = 0.000 [2]
Delete 1 memory chunk(s); time: 0.000
Number of unused reductors: 1
After ech memory: 7.8MB
Queue insertion time: 0.000
Step 1 time: 0.000, [0.000], mat/total: 0.000/0.000 [0.000], mem: 7.8MB
*******
STEP 2
Basis length: 5, queue length: 1, step degree: 3, num pairs: 1
Basis total mons: 19, average length: 3.800
Number of pair polynomials: 1, at 6 column(s), 0.000
Average length for reductees: 4.00 [1], reductors: 4.00 [4]
Symbolic reduction time: 0.000, column sort time: 0.000
1 + 4 = 5 rows / 8 columns, 50% / 67.429% (4/r)
Before ech memory: 7.8MB
Row sort time: 0.000
0.000 + 0.000 = 0.000 [1]
Delete 1 memory chunk(s); time: 0.000
After ech memory: 7.8MB
Queue insertion time: 0.000
Step 2 time: 0.000, [0.001], mat/total: 0.000/0.000 [0.001], mem: 7.8MB
*******
STEP 3
Basis length: 6, queue length: 1, step degree: 4, num pairs: 1
Basis total mons: 23, average length: 3.833
Number of pair polynomials: 1, at 6 column(s), 0.000
Average length for reductees: 4.00 [1], reductors: 4.00 [6]
Symbolic reduction time: 0.000, column sort time: 0.000
1 + 6 = 7 rows / 9 columns, 44.444% / 63.243% (4/r)
Before ech memory: 7.8MB
Row sort time: 0.000
0.000 + 0.000 = 0.000 [0]
Delete 1 memory chunk(s); time: 0.000
After ech memory: 7.8MB
Queue insertion time: 0.000
Step 3 time: 0.000, [0.000], mat/total: 0.000/0.000 [0.001], mem: 7.8MB
Reduce 6 final polynomial(s) by 6
2 redundant polynomial(s) removed; time: 0.000
Interreduce 4 (out of 6) polynomial(s)
Symbolic reduction time: 0.000
Column sort time: 0.000
4 + 0 = 4 rows / 8 columns, 50% / 68.452% (4/r)
Row sort time: 0.000
0.000 + 0.000 = 0.000 [4]
Delete 1 memory chunk(s); time: 0.000
Total reduction time: 0.000
Reduction time: 0.000
Final number of polynomials: 4
Number of pairs: 4
Total pair setup time: 0.000
Max num entries matrix: 7 by 9
Max num rows matrix: 7 by 9
Total symbolic reduction time: 0.000
Total column sort time: 0.000
Total row sort time: 0.000
Total matrix time: 0.000
Total new polys time: 0.000
Total queue update time: 0.000
Total Faugere F4 time: 0.000, real time: 0.001
}}}
It would also be nice if the protocol is printed live, i.e. whenever Magma
prints a new line it is immediately displayed by Sage.
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10571#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
