Optimization strategies for the approximate GCD problem

Authors:
Paulina Chin;Robert M. Corless;George F. Corliss
Affiliations:
Department of Physics and Computing, Wilfrid Laurier University, Waterloo, Ontario, N2L 3C5, Canada;Department of Applied Mathematics, University of Western Ontario, London, Ontario, N6A 5B7, Canada;Department of Mathematics, Statistics, and Computer Science, Marquette University, P.O. Box 1881, Milwaukee, WI
Venue:
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Year:
1998

Citing 12
Cited 15

Approximate GCD and its application to ill-conditioned algebraic equations

ISCM '90 Proceedings of the International Symposium on Computation mathematics
The singular value decomposition for polynomial systems

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Cofactor iteration

ACM SIGSAM Bulletin
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
On approximate GCDs of univariate polynomials

Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
When are two numerical polynomials relatively prime?

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
Subresultants and Reduced Polynomial Remainder Sequences

Journal of the ACM (JACM)
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Journal of the ACM (JACM)
Linear System Theory and Design

Linear System Theory and Design
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)

Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)

Report on the SNAP minisymposium at SIAM '98

ACM SIGSAM Bulletin
Approximate polynomial decomposition

ISSAC '99 Proceedings of the 1999 international 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
Cited References

Computer algebra handbook
Numerical optimization in hybrid symbolic-numeric computation

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Approximate GCDs of polynomials and SOS relaxation

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Approximate GCDs of polynomials and sparse SOS relaxations

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

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation

Computers & Mathematics with Applications
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
Number of zeros of interval polynomials

Journal of Computational and Applied Mathematics
Variable projection methods for approximate GCD computations

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
Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Optimization strategies for the approximate GCD problem

Quantified Score

Visualization

Abstract