2000 · 19 citations · 8 references
ComputingComputer ScienceAlgorithmsApproximation AlgorithmsMultivariate AnalysisNumber-theoretic AlgorithmsComputational Gcd AlgorithmsMultivariate Polynomial Gcd
Problem. Given two multivariate polynomials with inexact coefficients, how to produce a ‘satisfactory ’ GCD for a given error tolerance $\\epsilon$? $F $ $= $ $C(x_{1}, \\ldots, x_{n})\\overline{F}(x_{1}, \\ldots, x_{n})+\\mathrm{O}(\\epsilon(x_{1}, \\ldots, x_{n}))$
8
The singular value decomposition for polynomial systems
Robert M. Corless, Patrizia Gianni, Barry Trager et al. · 1995 · 205 citations
Arnold Schönhage · Journal of Complexity · 1985 · 127 citations
Optimization strategies for the approximate GCD problem
P. Chin, Robert M. Corless, George F. Corliss · 1998 · 56 citations