Changes between Version 8 and Version 17 of Ticket #16742
- Timestamp:
- 08/26/14 12:28:50 (8 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Ticket #16742
-
Property
Branch
changed from
to
u/ketzu/overload_for_faster_weak_popov_form
-
Property
Authors
changed from
to
David Mödinger
-
Property
Commit
changed from
to
e464be9e38cd84c8d52d9c117724e4a9f0ce01e7
-
Property
Branch
changed from
-
Ticket #16742 – Description
v8 v17 1 1 The target of this ticket is to enhance the function weak_popov of the matrix interface. The function should transform the matrix in weak popov form, it will use mulders-storjohann algorithm and should be much faster than the current implementation but will not work for polynomials over a fraction field only for polynomial rings over finite fields. 2 2 3 This ticket is independent from but connected to [wiki:trac.sagemath.org/ticket/16739 #16739].3 This ticket is independent from but connected to #16739. 4 4 5 5 Short description of weak popov form: Let R be an ordered Ring and Amxn a matrix over R. The leading position of a row is called the position i in [1,m) such that the order of A[i,_] is maximal within the row. If there are multiple entries with the maximum order, the highest i is the leading position (the furthest to the right in the matrix). A is in weak popov form if all leading positions are different (zero lines ignored).