Browsing Theses by Supervisor "Giesbrecht, Mark"
Now showing items 16 of 6

Analysis of Randomized Algorithms in Real Algebraic Geometry
(University of Waterloo, 20200902)Consider the problem of computing at least one point in each connected component of a smooth real algebraic set. This is a basic and important operation in real and semialgebraic geometry: it gives an upper bound on the ... 
Computational Approaches to Problems in Noncommutative Algebra  Theory, Applications and Implementations
(University of Waterloo, 20160928)Noncommutative rings appear in several areas of mathematics. Most prominently, they can be used to model operator equations, such as differential or difference equations. In the Ph.D. studies leading to this thesis, ... 
Faster Algorithms for Sparse Decomposition and Sparse Series Solutions to Differential Equations
(University of Waterloo, 20220509)Sparse polynomials are those polynomials with only a few nonzero coefficients relative to their degree. They can appear in practice in polynomial systems as inputs, where the degree of the input sparse polynomial can be ... 
Matrix Polynomials and their Lower Rank Approximations
(University of Waterloo, 20190807)This thesis is a wide ranging work on computing a “lowerrank” approximation of a matrix polynomial using secondorder nonlinear optimization techniques. Two notions of rank are investigated. The first is the rank as the ... 
Smith Normal Form over Local Rings and Related Problems
(University of Waterloo, 20170828)The Smith normal form is a diagonalization of matrices with many applications in diophantine analysis, graph theory, system control theory, simplicial homology, and more recently, in topological analysis of big data. ... 
Sparse Polynomial Interpolation and Testing
(University of Waterloo, 20160303)Interpolation is the process of learning an unknown polynomial f from some set of its evaluations. We consider the interpolation of a sparse polynomial, i.e., where f is comprised of a small, bounded number of terms. Sparse ...