GCD of multivariate approximate polynomials using beautification with the subtractive algorithm

Authors:
Robert M. Corless;Erik Postma;David R. Stoutemyer
Affiliations:
-;-;-
Venue:
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Year:
2012

Citing 7
Cited 0

The singular value decomposition for polynomial systems

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Computer algebra handbook

Computer algebra handbook
Algorithm 835: MultRoot---a Matlab package for computing polynomial roots and multiplicities

ACM Transactions on Mathematical Software (TOMS)
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
A new Gröbner basis conversion method based on stabilization techniques

Theoretical Computer Science
An iterative method for calculating approximate GCD of univariate polynomials

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Rounding coefficients and artificially underflowing terms in non-numeric expressions

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

The GCD problem for approximate polynomials, by which we mean polynomials expressed in some fixed basis but having approximately-known coefficients, has been well-studied at least since the paper of [6]. Important papers include those listed in [4, 2.12.3], and more recently includes [5], [8] and [9]. What is new about the present paper is that we hope to take advantage of some new technology, in order to improve our understanding of the GCD problem and not necessarily to try to improve on existing algorithms.