Campus Event Calendar
Event Entry
What and Who
Computing Canonical Forms of Matrices
George Havas
University of Queensland, Australien
Informatik-Kolloquium
AG 1, AG 2, AG 3, INET, AG 4, AG 5, D6, RG1, SWS
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 27 November 95
16:00
60 Minutes
36 - Informatik
406
Saarbrücken
Abstract
The calculation of canonical forms for matrices plays an important role
in many computations. Our aim is to develop effective algorithms for
finding canonical forms of matrices over various domains. In principle
it is easy, but it can be difficult if the matrix is large.
in many computations. Our aim is to develop effective algorithms for
finding canonical forms of matrices over various domains. In principle
it is easy, but it can be difficult if the matrix is large.
Various different strategies have been proposed for integer matrices,
primarily trying to avoid the major obstacle that occurs in such
computations: explosive growth in size of intermediate entries. We
present new algorithms with excellent performance. We investigate the
complexity of such computations, indicating relationships with
NP-complete extended gcd problems.
Contact
Ulrike Lehmberg
--email hidden
passcode not visible
logged in users only