UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Computing Approximate GCRDs of Differential Polynomials

Thumbnail Image

Files

haraldson_joseph.pdf (423.07 KB)

Date

2015-09-21

Authors

Haraldson, Joseph

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

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 the corresponding number of flops required. Under reasonable assumptions the approximate GCRD problem is well posed. In particular, we show that an approximate GCRD exists under these assumptions and provide counter examples when these assumptions are not satisfied. We introduce algorithms for computing nearby differential polynomials with a GCRD. These differential polynomials are improved through a post-refinement Newton iteration. It is shown that Newton iteration will converge to a unique, optimal solution when the residual is sufficiently small. Furthermore, if our computed solution is not optimal, it is shown that this solution is reasonably close to the optimal solution.

Description

Keywords

Ore, Differential, Operator, Approximate, GCD, GCRD

LC Keywords

Citation

URI

http://hdl.handle.net/10012/9685

Collections

Theses
Computer Science