Statistical and structured optimisation : methods for the approximate GCD problem
John J. Allan · White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York) · 2008
The computation of polynomial greatest common divisors (GCDs) is a fundamental problem in algebraic computing and has important widespread applications in areas such as computing theory, control, image processing, signal processing and computer-aided design (CAD).