Z. Zeng and B. H. Dayton, “The Approximate GCD of Inexact Polynomials Part 2: A Multivariate Algorithm,” Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, Santander, 2004.

has been cited by the following article:

• TITLE: Computing Approximation GCD of Several Polynomials by Structured Total Least Norm

  AUTHORS: Xuefeng Duan, Xinjun Zhang, Qingwen Wang

  KEYWORDS: Sylvester Matrix; Approximate Greatest Common Divisor; Low Rank Approximation; Structured Total Least Norm; Numerical Method

  JOURNAL NAME: Advances in Linear Algebra & Matrix Theory, Vol.3 No.4, December 6, 2013

  ABSTRACT: The task of determining the greatest common divisors (GCD) for several polynomials which arises in image compression, computer algebra and speech encoding can be formulated as a low rank approximation problem with Sylvester matrix. This paper demonstrates a method based on structured total least norm (STLN) algorithm for matrices with Sylvester structure. We demonstrate the algorithm to compute an approximate GCD. Both the theoretical analysis and the computational results show that the method is feasible.