Resolving Zero Divisors Using Hensel Lifting

Algorithms which compute modulo triangular sets must respect zero divisors. We present Hensel lifting as a tool for resolving them. We give an application: a modular algorithm for computing gcds of univariate polynomials with coefficients modulo a radical triangular set over the rational numbers. We...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) S. 39 - 48
Hauptverfasser: Kluesner, John, Monagan, Michael
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.09.2017
Schlagworte:
Complexity theory
Hensel Lifting
Image reconstruction
Modular Algorithms
Polynomial GCD
Radical Ideals
Scientific computing
Testing
Triangular Sets
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Algorithms which compute modulo triangular sets must respect zero divisors. We present Hensel lifting as a tool for resolving them. We give an application: a modular algorithm for computing gcds of univariate polynomials with coefficients modulo a radical triangular set over the rational numbers. We have implemented our algorithm using Maple's RECDEN package. We compare our implementation with the procedure RegularGcd in the RegularChains package.
DOI:10.1109/SYNASC.2017.00017