S. Fatouros

  • Citations Per Year
Learn 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 “approximate” GCD, and the way we can measure the strength of the approximation has remained open. This paper uses recent results on the representation of the(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 the perturbed polynomials have a common root. It is shown that the problem is equivalent to the calculation of the structured singular value of a matrix, which(More)
  • 1