Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"approximate GCD"”.
-
Homomorphic Encryption and the Approximate GCD Problem
… is based. These hard problems include the Approximate GCD problem (A-GCD), the Learning With Errors problem (LWE), and various lattice problems. In addition, we discuss many of the proposed and in some cases implemented practical applications of these cryptosystems. Finally, we focus on the …
-
Statistical and structured optimisation : methods for the approximate GCD problem.
… 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).
-
Approximate algebraic computations in control theory
… the properties of the Greatest Common Divisor (GCD) of a set of polynomials; these properties may be investigated using the Sylvester Resultant. New properties of the Sylvester Resultant linked to GCD are established and these lead to canonical factorisations of resultants expressing the …
-
Approximate controllability and observability measures in control systems design
… matrix, is proposed for calculating the ”best” approximate GCD of a coprime polynomial set. The properties of the proposed algorithm are investigated and the method is compared with alternative optimisation techniques which can be employed to solve the problem. It is also shown that the problem …
-
ERES Methodology and Approximate Algebraic Computations
The area of approximate algebraic computations is a fast growing area in modern computer algebra which has attracted many researchers in recent years. Amongst the various algebraic computations, the computation of the Greatest Common Divisor (GCD) and the Least Common Multiple (LCM) of a set of …
-
The Acceleration of Polynomial Methods for Blind Image Deconvolution Using Graphical Processing Units (GPUs)
… of computing the greatest common divisor (GCD) of these polynomials. The computation of the GCD of two polynomials is ill posed, as any noise in the polynomials causes them to be coprime. Thus an approximate GCD (AGCD) must be computed instead. The computation of an AGCD is a …
-
Matrix Polynomials and their Lower Rank Approximations
… of these optimization problems are NP hard to approximate solutions to in a global setting. In most instances we are able to prove that solutions to our optimization problems exist (possibly at infinity) and discuss techniques in conjunction with an implementation to compute local minimizers to …
-
Computing Approximate GCRDs of Differential Polynomials
We generalize the approximate greatest common divisor problem to the non-commutative, approximate Greatest Common Right Divisor (GCRD) problem of differential polynomials. Algorithms for performing arithmetic on approximate differential polynomials are presented along with certification results and …