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

Full description

Bibliographic Details

Published in:	2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) pp. 39 - 48
Main Authors:	Kluesner, John, Monagan, Michael
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.09.2017
Subjects:	Complexity theory Hensel Lifting Image reconstruction Modular Algorithms Polynomial GCD Radical Ideals Scientific computing Testing Triangular Sets
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!