BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Andrii Dmytryshyn (Chalmers and GU)
DTSTART:20260427T111500Z
DTEND:20260427T120000Z
DTSTAMP:20260507T012241Z
UID:cam/96
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/cam/96/">Nea
 rness problems for matrix polynomials</a>\nby Andrii Dmytryshyn (Chalmers 
 and GU) as part of CAM seminar\n\nLecture held in MV:L14.\n\nAbstract\nThe
  problem of approximating a given constant matrix $A$ by a matrix of presc
 ribed rank $r<\\min(m\,n)$ is among the best understood problems in numeri
 cal linear algebra. The situation changes drastically if $A$ depends on pa
 rameters. In the talk we consider this problem for matrix polynomials\, i.
 e.\, for $A(\\lambda) \\in \\mathbb C[\\lambda]^{m\\times n}$. We present 
 an algorithm for approximating $A(\\lambda)$ by a matrix polynomial of pre
 scribed rank and degree at most $d$. The method builds on recent advances 
 in the theory of generic eigenstructures and factorizations of matrix poly
 nomials with bounded rank and degree.\n
LOCATION:https://researchseminars.org/talk/cam/96/
END:VEVENT
END:VCALENDAR