Numerical stability of Euclidean algorithm over ultrametric fields

作者：Caruso Xavier^*

来源：Journal de Theorie des Nombres de Bordeaux, 2017, 29(2): 503-534.

DOI：10.5802/jtnb.989

• Euclidean algorithm
• ultrametric precision
• subresultants

We address the problem of the stability of the computations of resultants and subresultants of polynomials defined over complete discrete valuation rings (e.g. z(p) or k[t] where k is a field). We prove that Euclidean-like algorithms are highly unstable on average and we explain, in many cases, how one can stabilize them without sacrifying the complexity. On the way, we completely determine the distribution of the valuation of the sub resultants of two random monic p-adic polynomials having the same degree.

• 出版日期2017