PhD Defence • Symbolic Computation • Fast Algorithms for Computing with Integer Matrices: Normal Forms and Applications
Please note: This PhD defence will be given online.
Stavros Birmpilis, PhD candidate
David R. Cheriton School of Computer Science
Supervisors: Professors George Labahn, Arne Storjohann
The focus of this thesis is on fundamental computational problems in exact integer linear algebra. Specifically, for a nonsingular integer input matrix A ∈ Zn×n, we consider problems such as linear system solving and computing integer matrix normal forms.