Author(s)

Xuefeng Duan, Xinjun Zhang, Qingwen Wang

College of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin, China.
Department of Mathematics, Shanghai University, Shanghai, China.

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.

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

X. Duan, X. Zhang and Q. Wang, "Computing Approximation GCD of Several Polynomials by Structured Total Least Norm," Advances in Linear Algebra & Matrix Theory, Vol. 3 No. 4, 2013, pp. 39-46. doi: 10.4236/alamt.2013.34008.