| Abstract:
The study of approximate GCDs of polynomials started around 20 years ago.
In this talk, we first recall some well-known results of approximate
greatest common right divisors over reals, and then discuss computing the
approximate greatest common right divisors of quaternion polynomials. We
explore some properties of Sylvester matrices in the quaternion case.
Based on
the singular value decomposition for quaternion matrices, we present
algorithms to compute approximate GCRDs for quaternion polynomials.
|
