Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.advisorLinton, Steve
dc.contributor.authorWainwright, Robert J.
dc.coverage.spatial132 p.en_US
dc.date.accessioned2018-07-10T11:05:05Z
dc.date.available2018-07-10T11:05:05Z
dc.date.issued2002
dc.identifier.urihttp://hdl.handle.net/10023/15171
dc.description.abstractGiven an integer matrix A, there is a unique matrix S of a particular form, called the Smith Normal Form, and non-unique unimodular matrices P and Q such that PAQ = S. It is often the case that these matrices P and Q will be used for further calculation, and as such it is desirable to find P and Q with small entries. In this thesis we address the problem of finding such P and Q with small entries, in particular in the case where A is a diagonal matrix, which arises as a final step in many published algorithms. Heuristic algorithms are developed which appear to do well in practice and some theory is developed to explain this behaviour. We also give an account of the implementation of an alternative algorithm which bypasses this intermediary diagonal form. The basic theoretical development of this is work by Storjohan.en_US
dc.language.isoenen_US
dc.publisherUniversity of St Andrewsen
dc.subject.lccQA188.W2
dc.titleFinding "small' matrices P,Q such that PDQ = Sen_US
dc.typeThesisen_US
dc.type.qualificationlevelDoctoralen_US
dc.type.qualificationnamePhD Doctor of Philosophyen_US
dc.publisher.institutionThe University of St Andrewsen_US


This item appears in the following Collection(s)

Show simple item record