Hi Martin, On 12 Jul., 21:09, Martin Albrecht <martinralbre...@googlemail.com> wrote: > If one is serious about this then one should probably use the FFLAS/FFPACK > low-level routines directly (Burcin might have some old patches for this, he's > the last person I know of who tried) since that avoids compiling all thee > layers of C++ in LinBox.
That would probably be beyond my scope. > > But one question: Can linbox deal with non-prime finite fields? > > They had some experimental code at some point IIRC but nothing for general > use. What a pity - I need non-prime fields as well. But perhaps it is feasible to create a sub-class Matrix_modp_dense of Matrix_modn_dense for matrices over finite prime fields -- overriding _mul_ etc. to use the functions from sage.libs.linbox.linbox. In that way, one could benefit from the LinBox speed at least to some extent. I suppose that fits into the scope of #8096. Best regards, Simon -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
