Allan, John (2008) Statistical and structured optimisation : methods for the approximate GCD problem. PhD thesis, University of Sheffield.
Abstract
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).
Metadata
Awarding institution: | University of Sheffield |
---|---|
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Computer Science (Sheffield) The University of Sheffield > Faculty of Science (Sheffield) > Computer Science (Sheffield) |
Identification Number/EthosID: | uk.bl.ethos.505594 |
Depositing User: | EThOS Import Sheffield |
Date Deposited: | 31 May 2016 13:39 |
Last Modified: | 31 May 2016 13:39 |
Open Archives Initiative ID (OAI ID): | oai:etheses.whiterose.ac.uk:12806 |
You do not need to contact us to get a copy of this thesis. Please use the 'Download' link(s) above to get a copy.
You can contact us about this thesis. If you need to make a general enquiry, please see the Contact us page.