Numerical stability of Euclidean algorithm over ultrametric fields

DOI10.5802/JTNB.989zbMATH Open1409.11120OpenAlexW2723644701MaRDI QIDQ2397945FDOQ2397945

Authors: Xavier Caruso 

Publication date: 14 August 2017

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5802/jtnb.989

Recommendations

• The Euclidean algorithm in algebraic number fields
• Analysis of Euclidean algorithms for polynomials over finite fields
• Publication:3201738
• Computation of the Euclidean minimum of algebraic number fields
• scientific article; zbMATH DE number 6693374
• scientific article; zbMATH DE number 4125523
• Publication:4508390
• On the computation of the norm-Euclidean minimum of algebraic number fields
• scientific article; zbMATH DE number 4078610
• scientific article; zbMATH DE number 2151244

zbMATH Keywords

Euclidean algorithmsubresultantsultrametric precision

Mathematics Subject Classification ID

Other nonanalytic theory (11S85)

Cites Work

• The Magma algebra system. I: The user language
• Polynomial algorithms in computer algebra
• Title not available (Why is that?)
• Algorithms in real algebraic geometry
• Title not available (Why is that?)
• Tracking \(p\)-adic precision
• Random matrices over a DVR and LU factorization
• Title not available (Why is that?)
• On \(p\)-adic differential equations with separation of variables

Cited In (2)

• Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
• Division and slope factorization of \(p\)-adic polynomials

Uses Software

• Magma
• PARI/GP
• SageMath

This page was built for publication: Numerical stability of Euclidean algorithm over ultrametric fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397945)