GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials

Authors:
Akira Terui
Affiliations:
University of Tsukuba, Tsukuba, Japan
Venue:
ACM Communications in Computer Algebra
Year:
2011

Citing 3
Cited 0

Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
An iterative method for calculating approximate GCD of univariate polynomials

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials

CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing

Quantified Score

Hi-index	0.00

Visualization

Abstract