The approximate GCD of inexact polynomials

Authors:
Zhonggang Zeng;Barry H. Dayton
Affiliations:
Northeastern Illinois University, Chicago, IL;Northeastern Illinois University, Chicago, IL
Venue:
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Year:
2004

Citing 17
Cited 19

Approximate greatest common divisor of multivariate polynomials and its application to ill-conditioned systems of algebraic equations

Journal of Information Processing
The singular value decomposition for polynomial systems

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Evaluation of the heuristic polynomial GCD

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Approximate polynomial greatest common divisors and nearest singular polynomials

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Detection and validation of clusters of polynomial zeros

Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
Polynomial remainder sequence and approximate GCD

ACM SIGSAM Bulletin
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Journal of the ACM (JACM)
Challenges of symbolic computation: my favorite open problems

Journal of Symbolic Computation
Towards factoring bivariate approximate polynomials

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Factoring multivariate polynomials via partial differential equations

Mathematics of Computation
On square-free decomposition algorithms

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
A method computing multiple roots of inexact polynomials

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Algorithm 835: MultRoot---a Matlab package for computing polynomial roots and multiplicities

ACM Transactions on Mathematical Software (TOMS)
Numerical Polynomial Algebra

Numerical Polynomial Algebra
A Rank-Revealing Method with Updating, Downdating, and Applications

SIAM Journal on Matrix Analysis and Applications
Blind image deconvolution using a robust GCD approach

IEEE Transactions on Image Processing
Multichannel blind iterative image restoration

IEEE Transactions on Image Processing

Approximate factorization of multivariate polynomials via differential equations

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Computing the multiplicity structure in solving polynomial systems

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
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
Approximate bivariate factorization: a geometric viewpoint

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Numerical algebraic geometry and kinematics

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Numerical optimization in hybrid symbolic-numeric computation

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Computing Approximate GCDs in Ill-conditioned Cases

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Approximate factorization of multivariate polynomials using singular value decomposition

Journal of Symbolic Computation
A numerical elimination method for polynomial computations

Theoretical Computer Science
ApaTools: a software toolbox for approximate polynomial algebra

ACM Communications in Computer Algebra
A computational study of ruled surfaces

Journal of Symbolic Computation
Computing multivariate approximate GCD based on Barnett's theorem

Proceedings of the 2009 conference on Symbolic numeric computation
Blind image deconvolution via fast approximate GCD

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Tropical algebraic geometry in Maple: A preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients

Journal of Symbolic Computation
Rounding coefficients and artificially underflowing terms in non-numeric expressions

ACM Communications in Computer Algebra
Approximate polynomial GCD over integers

Journal of Symbolic Computation
Twin-float arithmetic

Journal of Symbolic Computation
Ruppert matrix as subresultant mapping

CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
NAClab: a Matlab toolbox for numerical algebraic computation

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. The method and the companion software appear to be the first practical package with such capabilities. The most significant features of the algorithm are its robustness and accuracy as demonstrated in computational experiments. In addition, two variations of a squarefree factorization method for multivariate polynomials are proposed as an application of the GCD algorithm.