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:20181221T160904Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181113T083000
DTEND;TZID=America/Chicago:20181113T170000
UID:submissions.supercomputing.org_SC18_sess325_spost130@linklings.com
SUMMARY:Eulerian Algorithms for the Discretization of Plasma Kinetic Equat
 ions
DESCRIPTION:ACM Student Research Competition, Poster\nTech Program Reg Pas
 s, Exhibits Reg Pass\n\nEulerian Algorithms for the Discretization of Plas
 ma Kinetic Equations\n\nJuno\n\nWhile fluid models are common tools in the
  study of plasmas, many of these systems, whether in astrophysics or the l
 ab, are only weakly collisional and far from equilibrium, making them more
  accurately described by kinetic equations. Kinetic equations can be compu
 tationally demanding due to the need to solve for the distribution functio
 n of the particles in a higher dimensional phase space, with position and 
 velocity coordinates. Despite this challenge, the motivation for solving t
 he plasma kinetic equation is large as there remains a vast array of quest
 ions concerning collisionless dynamics in real plasma systems. Here we pre
 sent algorithms in an Eulerian framework for the discretization of the pla
 sma kinetic equation, using a high-order discontinuous Galerkin finite ele
 ment method due to its arithmetic intensity and parallelizability. Scaling
  and performance of the algorithm are discussed, and benchmarks of the alg
 orithm are presented as well.
URL:https://sc18.supercomputing.org/presentation/?id=spost130&sess=sess325
END:VEVENT
END:VCALENDAR