Finding "small' matrices P,Q such that PDQ = S
Given 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 w...
Main Author: | |
---|---|
Other Authors: | |
Published: |
University of St Andrews
2002
|
Subjects: | |
Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.750282 |
id |
ndltd-bl.uk-oai-ethos.bl.uk-750282 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-bl.uk-oai-ethos.bl.uk-7502822018-09-11T03:21:50ZFinding "small' matrices P,Q such that PDQ = SWainwright, Robert J.Linton, Steve2002Given 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.QA188.W2University of St Andrewshttps://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.750282http://hdl.handle.net/10023/15171Electronic Thesis or Dissertation |
collection |
NDLTD |
sources |
NDLTD |
topic |
QA188.W2 |
spellingShingle |
QA188.W2 Wainwright, Robert J. Finding "small' matrices P,Q such that PDQ = S |
description |
Given 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. |
author2 |
Linton, Steve |
author_facet |
Linton, Steve Wainwright, Robert J. |
author |
Wainwright, Robert J. |
author_sort |
Wainwright, Robert J. |
title |
Finding "small' matrices P,Q such that PDQ = S |
title_short |
Finding "small' matrices P,Q such that PDQ = S |
title_full |
Finding "small' matrices P,Q such that PDQ = S |
title_fullStr |
Finding "small' matrices P,Q such that PDQ = S |
title_full_unstemmed |
Finding "small' matrices P,Q such that PDQ = S |
title_sort |
finding "small' matrices p,q such that pdq = s |
publisher |
University of St Andrews |
publishDate |
2002 |
url |
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.750282 |
work_keys_str_mv |
AT wainwrightrobertj findingsmallmatricespqsuchthatpdqs |
_version_ |
1718732881836113920 |