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...

Celý popis

Podrobná bibliografia

Vydané v:	2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) s. 39 - 48
Hlavní autori:	Kluesner, John, Monagan, Michael
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.09.2017
Predmet:	Complexity theory Hensel Lifting Image reconstruction Modular Algorithms Polynomial GCD Radical Ideals Scientific computing Testing Triangular Sets
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!