Sun, Dongxia; Zhi, Lihong Structured low rank approximation of a Bezout matrix. (English) Zbl 1132.68073 Math. Comput. Sci. 1, No. 2, 427-437 (2007). Summary: The task of determining the approximate Greatest Common Divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given Bezout matrix a new Bezout matrix of lower rank whose entries are near the corresponding entries of that input matrix. We present an algorithm based on a version of structured nonlinear total least squares (SNTLS) method for computing approximate GCD and demonstrate the practical performance of our algorithm on a diverse set of univariate polynomials. Cited in 1 Document MSC: 68W30 Symbolic computation and algebraic computation 65K10 Numerical optimization and variational techniques Keywords:Bezout matrix; approximate greatest common divisor; structured nonlinear total least squares; symbolic/numeric hybrid method Software:MultRoot PDFBibTeX XMLCite \textit{D. Sun} and \textit{L. Zhi}, Math. Comput. Sci. 1, No. 2, 427--437 (2007; Zbl 1132.68073) Full Text: DOI