BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20180122T091748Z
DTSTART;TZID=America/Los_Angeles:20180131T160000
DTEND;TZID=America/Los_Angeles:20180131T170000
TRANSP:OPAQUE
SUMMARY:Applied Math Seminar: Efficient solvers and preconditioners for the implicit time integration of discontinuous Galerkin methods
UID:114777-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:740 Evans Hall
DESCRIPTION:Will Pazner\, Brown University and UC Berkeley\n\nImplicit time integration for discontinuous Galerkin (DG) discretizations is important in the context of boundary layer flows\, anisotropic\, unstructured meshes\, and high degree polynomial approximations. Effective preconditioning strategies are essential to the efficient iterative solution of the resulting large\, sparse linear systems. In this talk\, I will discuss two topics: (1) fully implicit Runge-Kutta solvers\, and (2) tensor-product preconditioners for very high polynomial degrees.\n\n(1) There are several advantages to using fully-coupled implicit Runge-Kutta schemes compared with traditional DIRK or BDF methods. However\, such methods couple all of the Runge-Kutta stages\, resulting in a much larger system of equations. We transform the resulting system of equations to maximize sparsity\, and then develop several ILU-based preconditioners with favorable performance properties. These solvers have the additional advantage that they allow for parallelism across the stages.\n\n(2) Furthermore\, the DG method allows for arbitrary order of accuracy\, according to the degree of polynomial approximation used. High-degree polynomials result in extremely restrictive CFL conditions\, motivating the use of implicit solvers. We develop efficient solvers and preconditioners that exploit the natural tensor-product structure of quadrilateral and hexahedral grids in order to obtain methods with optimal computational complexity.
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=114777&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20180122T091748Z
LAST-MODIFIED:20180122T091748Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR