@@ -94,8 +94,8 @@ from cysignals.signals cimport sig_check, sig_on, sig_off
94
94
95
95
from sage.libs.gmp.mpz cimport *
96
96
from sage.libs.linbox.fflas cimport FFLAS_TRANSPOSE, FflasNoTrans, FflasTrans, \
97
- FfpackTileRecursive, FfpackSlabRecursive, FflasLeft, FflasRight, vector, list as std_list, \
98
- RankProfileFromLU, PLUQtoEchelonPermutation, MathPerm2LAPACKPerm, LAPACKPerm2MathPerm
97
+ FfpackTileRecursive, FflasLeft, FflasRight, vector, list as std_list, \
98
+ RankProfileFromLU, PLUQtoEchelonPermutation, MathPerm2LAPACKPerm
99
99
100
100
from libcpp cimport bool
101
101
from sage.parallel.parallelism import Parallelism
@@ -1838,8 +1838,8 @@ cdef class Matrix_modn_dense_template(Matrix_dense):
1838
1838
ignore). However, ``efd=True`` uses more memory than FFLAS
1839
1839
directly (default: ``True``)
1840
1840
1841
- OUTPUT: if ``efd`` is ``False``, return the row rank profile of
1842
- ``self``
1841
+ OUTPUT: if ``efd`` is ``False``, return the pivot rows (a.k.a. row rank
1842
+ profile) of the matrix ``self`` before echelonization
1843
1843
1844
1844
EXAMPLES::
1845
1845
@@ -1859,7 +1859,8 @@ cdef class Matrix_modn_dense_template(Matrix_dense):
1859
1859
r, pivots = linbox_echelonize_efd(self .p, self ._entries,
1860
1860
self ._nrows, self ._ncols)
1861
1861
else :
1862
- r, pivots, rrp = linbox_echelonize(self .p, self ._entries, self ._nrows, self ._ncols)
1862
+ r, pivots, rrp = linbox_echelonize(self .p, self ._entries,
1863
+ self ._nrows, self ._ncols)
1863
1864
verbose(' done with echelonize' , t)
1864
1865
self .cache(' in_echelon_form' , True )
1865
1866
self .cache(' rank' , r)
0 commit comments