PhD Seminar • Symbolic Computation — Finding the Nearest Non-Trivial Smith Normal FormExport this event to calendar

Friday, December 21, 2018 — 1:30 PM EST

Joseph Haraldson, PhD candidate
David R. Cheriton School of Computer Science

We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form (SNF). This is a non-convex optimization problem where we find a nearby matrix polynomial with prescribed eigenvalues and associated multiplicity structure in the invariant factors.

Some recent results are discussed that show that computing the SNF of a matrix polynomial is amenable to numeric computation as an optimization problem. Furthermore, effective optimization techniques to find a nearby matrix polynomial with a non-trivial SNF are discussed. The results are then generalized to include the computation of a matrix polynomial having a maximum specified number of ones in the SNF (i.e., with a maximum specified McCoy rank).

Location 
DC - William G. Davis Computer Research Centre
1304
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

S M T W T F S
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
  1. 2019 (212)
    1. December (1)
    2. November (4)
    3. October (14)
    4. September (20)
    5. August (18)
    6. July (12)
    7. June (23)
    8. May (23)
    9. April (32)
    10. March (25)
    11. February (16)
    12. January (24)
  2. 2018 (220)
    1. December (16)
    2. November (19)
    3. October (26)
    4. September (22)
    5. August (17)
    6. July (20)
    7. June (13)
    8. May (25)
    9. April (34)
    10. March (24)
    11. February (3)
    12. January (1)
  3. 2017 (36)
  4. 2016 (21)
  5. 2015 (36)
  6. 2014 (33)
  7. 2013 (23)
  8. 2012 (4)
  9. 2011 (1)
  10. 2010 (1)
  11. 2009 (1)
  12. 2008 (1)