BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Martin Gander (University of Geneva) DTSTART:20200610T140000Z DTEND:20200610T150000Z DTSTAMP:20260423T022928Z UID:E-NLA/8 DESCRIPTION:Title: A Linear Algebra Approach to Time Parallelization: Parareal\, ParaExp\, Para Diag\, ParaOpt and ParaStieltjes\nby Martin Gander (University of Gene va) as part of E-NLA - Online seminar series on numerical linear algebra\n \n\nAbstract\nTime parallelization has been a very active research area ov er the past decade. This is due to so massively parallel computer architec tures that parallelization in the spatial direction rarely suffices to tak e full advantage of such systems when solving evolution problems. Time par allelization is however quite different from spatial parallelization\, sin ce information only propagates forward in time\, never backward. Time para llelization algorithms are often derived at the PDE level\, but whenever t hey are used\, they take the form of solvers for linear algebra problems. I will give in my presentation an introduction to such algorithms at the l inear algebra level\, starting with two simple but typical model problems\ , namely a heat equation and a transport equation. At the linear algebra l evel\, these two problems look deceivingly similar\, but time parallel alg orithms need different features when solving one or the other in parallel. I will explain the reason for this at the linear algebra level\, and then show how Parareal\, ParaExp and ParaDiag address them. If time permits\, I will also briefly explain the newer classes of ParaOpt and ParaStieltjes algorithms.\n LOCATION:https://researchseminars.org/talk/E-NLA/8/ END:VEVENT END:VCALENDAR