In this paper, a new characterisation of the approximate GCD of many polynomials is given that also allows the evaluation of accuracy of the corresponding ‘approximate GCD computation’. This new… (More)

The computation of the Greatest Common Divisor (GCD) of many polynomials is a nongeneric problem. Techniques defining “approximate GCD” solutions have been defined, but the proper definition of the… (More)

The aim of this paper is to extend recent results on the approximate GCD of polynomials [1] and approximate zeros to the case of a polynomial matrices within the framework of exterior algebra [2].… (More)

In this note the following problem is considered: Given two monic coprime polynomials a(s) and b(s) with real coefficients, find the smallest (in magnitude) perturbation in their coefficients so that… (More)

The Greatest Common Divisor (GCD) of many polynomials is central to linear systems problems and its computation is a nongeneric problem. Defining the notion of “approximate” GCD, measuring and… (More)