An improvement in the lattice construction process of approximate polynomial GCD over integers

Authors:
Kosaku Nagasaka
Affiliations:
Kobe University, Japan
Venue:
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Year:
2012

Citing 4
Cited 0

Approximate polynomial GCD over integers

ACM Communications in Computer Algebra
Approximate polynomial gcd: small degree and small height perturbations

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Approximate polynomial gcd: Small degree and small height perturbations

Journal of Symbolic Computation
Approximate polynomial GCD over integers

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We compute an approximate greatest common divisor (GCD) of co-prime polynomials over integers by changing their coefficients slightly over integers so that the input polynomials still remain over integers. In this paper, we give an improved algorithm with a new lattice construction process by which we can restrict the range of perturbations in some cases.