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

Authors:
Akira Terui
Affiliations:
Graduate School of Pure and Applied Sciences, University of Tsukuba, Tsukuba, Japan
Venue:
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Year:
2010

Citing 12
Cited 4

Approximate square-free decomposition and root-finding of lll-conditioned 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
Applied numerical linear algebra

Applied numerical linear algebra
Optimization strategies for the approximate GCD problem

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On approximate GCDs of univariate polynomials

Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials

Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
Computation of approximate polynomial GCDs and an extension

Information and 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
Computing Approximate GCDs in Ill-conditioned Cases

Proceedings of the 2007 international workshop on Symbolic-numeric computation
An iterative method for calculating approximate GCD of univariate polynomials

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
QR-factorization method for computing the greatest common divisorof polynomials with inexact coefficients

IEEE Transactions on Signal Processing
QR factoring to compute the GCD of univariate approximate polynomials

IEEE Transactions on Signal Processing

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

ACM Communications in Computer Algebra
Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials

Computer Aided Geometric Design
GPGCD: An iterative method for calculating approximate GCD of univariate polynomials

Theoretical Computer Science
Calculating approximate GCD of multiple univariate polynomials using approximate syzygies

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to multiple polynomial inputs. For a given pair of polynomials and a degree, our algorithm finds a pair of polynomials which has a GCD of the given degree and whose coefficients are perturbed from those in the original inputs, making the perturbations as small as possible, along with the GCD. In our GPGCD method, the problem of approximate GCD is transferred to a constrained minimization problem, then solved with the so-called modified Newton method, which is a generalization of the gradient-projection method, by searching the solution iteratively. In this paper, we extend our method to accept more than two polynomials with the real coefficients as an input.