A Euclidean algorithm for integer matrices

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review


We present a Euclidean algorithm for computing a greatest
common right divisor of two integer matrices. The algorithm
is derived from elementary properties of
finitely generated modules over the ring of integers.
Original languageEnglish
JournalThe American Mathematical Monthly
Publication statusAccepted/In press - 10 Aug 2015

See relations at Aarhus University Citationformats

Download statistics

No data available

ID: 90515501