BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260522T150116Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181113T083000
DTEND;TZID=America/Chicago:20181113T170000
UID:submissions.supercomputing.org_SC18_sess322_post125@linklings.com
SUMMARY:MGRIT Preconditioned Krylov Subspace Method
DESCRIPTION:Ryo Yoda, Akihiro Fujii, and Teruo Tanaka (Kogakuin University
 )\n\nMGRIT re-discretize the problem with larger time-step width at the co
 arse-levels, which often cause unstable convergence. We propose a Krylov s
 ubspace method with MGRIT preconditioning as a more stable solver. For uns
 table problems, MGRIT preconditioned Krylov subspace method performed bett
 er than MGRIT in terms of the number of iterations. The contributions of t
 he paper are organized as follows. We showed the matrix form of MGRIT oper
 ations, and the improvement of eigenvalue or singular-value distribution. 
 We exemplified MGRIT with Krylov subspace method reaching convergence fast
 er than MGRIT.\n\nRegistration Category: Tech Program Reg Pass, Exhibits R
 eg Pass\n\n
END:VEVENT
END:VCALENDAR