Matrix-F5 algorithms and tropical Gröbner bases computation

Our study is performed both over any exact field with valuation and some inexact fields like Qp or Fq((t)). In the latter case, we track the loss in precision, and show that the numerical stability can compare very favorably to the case of classical Gröbner bases when the valuation is non-trivial. Numerical examples are provided.