An algorithm for approximate common divisor computation

In SIAM J. Matrix Anal. Appl., 26(4):1083-1099, 2005, we presented an algorithm for solving Toeplitz structured total least squares problems. The computation of an approximate common divisor of two polynomials is a Sylvester structured total least squares problem. In this paper we adapt the algorithm developed for Toeplitz matrices for the purpose of computing an approximate common divisor of two scalar polynomials. Per iteration the proposed algorithm has linear computational complexity in the degree of the given polynomials.