A fast algorithm for solving the Sylvester structured total least squares problem

作者：Li, Bingyu^*; Liu, Zhujun; Zhi, Lihong

来源：Signal Processing, 2007, 87(10): 2313-2319.

DOI：10.1016/j.sigpro.2007.03.001

• approximate greatest common divisor
• Sylvester matrix
• structured total least squares
• displacement structure

In this paper, we develop a fast structured total least squares (STLS) algorithm for computing an approximate greatest common divisor (GCD) of two univariate polynomials. By exploiting the displacement structure of the Sylvester matrix and applying the generalized Schur algorithm, each single iteration of the proposed algorithm has quadratic computational complexity in the degrees of the given polynomials.

• 出版日期2007-10
• 单位东北师范大学; 中国科学院数学与系统科学研究院