Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ISSAC
2004
Springer

favoriteEmaildiscussreport

118views Mathematics» more ISSAC 2004»

The approximate GCD of inexact polynomials

13 years 9 months ago

The approximate GCD of inexact polynomials

Download www.neiu.edu

This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coeﬃcients may be inexact. The method and the companion software appears to be the ﬁrst practical package with such capabilities. The most signiﬁcant features of the algorithm are its robustness and accuracy as demonstrated in the results of computational experiment. In addition, two variations of a squarefree factorization algorithm for multivariate polynomials are proposed as an application of the GCD algorithm. Categories and Subject Descriptors

Zhonggang Zeng, Barry H. Dayton

Real-time Traffic

Algorithm | ISSAC 2004 | Multivariate Polynomials | Squarefree Factorization Algorithm |

claim paper

Related Content

» Structured Low Rank Approximation of a Bezout Matrix

» The Singular Value Decomposition for Polynomial Systems

» TwoDimensional Blind Deconvolution Using a Robust GCD Approach

» An iterative method for calculating approximate GCD of univariate polynomials

» Approximate polynomial GCD Small degree and small height perturbations

» Approximate GCDs of polynomials and sparse SOS relaxations

» Fully Homomorphic Encryption over the Integers

» Numerical optimization in hybrid symbolicnumeric computation

» Computing the multiplicity structure in solving polynomial systems

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	ISSAC
Authors	Zhonggang Zeng, Barry H. Dayton

Comments (0)