Markovsky, Ivan (K.U.Leuven), Van Huffel, Sabine (Katholieke Univ. Leuven)

An Algorithm for Approximate Common Divisor Computation

Scheduled for presentation during the Regular Session "Model reduction" (MoP05), Monday, July 24, 2006, 17:00−17:25, Room F

17th International Symposium on Mathematical Theory of Networks and Systems, July 24-28, 2006, Kyoto, Japan

This information is tentative and subject to change. Compiled on April 16, 2024

Abstract

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 given 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.