Dear all,
No question, no bug report, but just a short report about a SageMath Google
Summer of Code project related to LinBox / FFLAS-FFPACK which was carried
out this summer, by student Marie Bonboire from Sorbonne Université, France.
In short, the goal was to improve as much as possible the
Hello,
The output seems to be the expected one. Can you please clarify what your
question/observation is?
For the first output, 'a' is already reduced w.r.t the DegRevLex Gröbner
basis of the ideal (which happens to be the two provided polynomials in
this case). The behaviour is clearly
Concerning what minimal_approximant_basis returns: this is specified in the
documentation,
http://doc.sagemath.org/html/en/reference/matrices/sage/matrix/matrix_polynomial_dense.html#sage.matrix.matrix_polynomial_dense.Matrix_polynomial_dense.minimal_approximant_basis
but in formal (hence
Dear Emmanuel,
You may be interested in taking a look at the following function:
Matrix_polynomial_dense.minimal_approximant_basis
This only supports the univariate case. This solves a problem which
generalizes Padé approximation (the documentation gives a precise
description of what it
Le vendredi 18 novembre 2016 04:44:49 UTC+1, Kwankyu Lee a écrit :
> I am not a big fan of the suggested asymptotically best algorithms relying
> on auxiliary tools, which would be hard to implement and gain for small
> matrices might be not much.
>
For sure; I do not know precisely what the
Le jeudi 17 novembre 2016 21:15:11 UTC+1, Johan S. H. Rosenkilde a écrit :
>
> John Cremona writes:
> > I once used the weak Popov form in a talk with Hendrik Lenstra in the
> > audience and he was quite amused since it appeared to be (and I think
> > he is right) much the same as his brother
Le jeudi 17 novembre 2016 21:15:11 UTC+1, Johan S. H. Rosenkilde a écrit :
>
> John Cremona writes:
> > I once used the weak Popov form in a talk with Hendrik Lenstra in the
> > audience and he was quite amused since it appeared to be (and I think
> > he is right) much the same as his brother
Regarding the original question: is the question specifically about
computing the HNF? Or, is any other canonical form acceptable? (with known
algorithms, it seems that the Popov form would be easier to implement
efficiently than the HNF)
Also, would you have examples of typical dimensions
