BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Erik Jansson DTSTART:20250918T143000Z DTEND:20250918T150000Z DTSTAMP:20260423T040038Z UID:gbgphd/19 DESCRIPTION:Title: How to compute the polar factorization of a matrix in a way you shouldn't< /a>\nby Erik Jansson as part of Gothenburg PhD seminar\n\nLecture held in MVL14.\n\nAbstract\nThe polar factorization is a way to decompose a square matrix into the product of an orthogonal factor and a positive-definite s ymmetric factor. There exist various ways to do this fast and efficiently\ , but in this talk\, I would like to present a method that is neither fast nor efficient. In fact\, it is completely inadvisable and should not be u sed for any application relying in any way on computing the polar factoriz ation. It is\, however\, interesting for an entirely different reason\, in that it arises in an unexpected and fascinating way. \nAfter having showc ased the method\, I will briefly explain its derivation by discussing the Gaussian optimal transport problem\, principal fiber bundles\, and gradien t flows to showcase that even numerical linear algebra can have deep geome tric roots.\n LOCATION:https://researchseminars.org/talk/gbgphd/19/ END:VEVENT END:VCALENDAR