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:20181221T160905Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181114T083000
DTEND;TZID=America/Chicago:20181114T170000
UID:submissions.supercomputing.org_SC18_sess323_post125@linklings.com
SUMMARY:MGRIT Preconditioned Krylov Subspace Method
DESCRIPTION:Poster\nTech Program Reg Pass, Exhibits Reg Pass\n\nMGRIT Prec
 onditioned Krylov Subspace Method\n\nYoda, Fujii, Tanaka\n\nMGRIT re-discr
 etize the problem with larger time-step width at the coarse-levels, which 
 often cause unstable convergence. We propose a Krylov subspace method with
  MGRIT preconditioning as a more stable solver. For unstable problems, MGR
 IT preconditioned Krylov subspace method performed better than MGRIT in te
 rms of the number of iterations. The contributions of the paper are organi
 zed as follows. We showed the matrix form of MGRIT operations, and the imp
 rovement of eigenvalue or singular-value distribution. We exemplified MGRI
 T with Krylov subspace method reaching convergence faster than MGRIT.
URL:https://sc18.supercomputing.org/presentation/?id=post125&sess=sess323
END:VEVENT
END:VCALENDAR