BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20230831T095746Z
LOCATION:Flüela
DTSTART;TZID=Europe/Stockholm:20230627T150000
DTEND;TZID=Europe/Stockholm:20230627T153000
UID:submissions.pasc-conference.org_PASC23_sess181_pap139@linklings.com
SUMMARY:Scalable Riemann Solvers with the Discontinuous Galerkin Method fo
 r Hyperbolic Network Simulation
DESCRIPTION:Paper\n\nAidan Hamilton (University of Delaware, Argonne Natio
 nal Laboratory); Jingmei Qiu (University of Delaware); and Hong Zhang (Ill
 inois Institute of Technology)\n\nWe develop a set of highly efficient and
  effective computational algorithms and simulation tools for fluid simulat
 ions on a network. The mathematical models are a set of hyperbolic conserv
 ation laws on edges of a network, as well as coupling conditions on juncti
 ons of a network. For example, the shallow water system, together with flu
 x balance and continuity conditions at river intersections, model water fl
 ows on a river network. The computationally accurate and robust discontinu
 ous Galerkin methods, coupled with explicit strong stability preserving Ru
 nge-Kutta methods, are implemented for simulations on network edges. Meanw
 hile, linear and nonlinear scalable Riemann solvers are being developed an
 d implemented at network vertices. These network simulations result in too
 ls that are added to the existing PETSc and DMNetwork software libraries f
 or the scientific community in general. Simulation results of a shallow wa
 ter system on a Mississippi river network with over one billion network va
 riables are performed on an extreme-scale computer using up to 8,192 proce
 ssor with an optimal parallel efficiency. Further potential applications i
 nclude traffic flow simulations on a highway network and blood flow simula
 tions on a arterial network, among many others.\n\nDomain: Physics, Comput
 er Science, Machine Learning, and Applied Mathematics &#8232;\n\nSession Chair: 
 Theofilos Manitaras (ETH Zurich / CSCS)
END:VEVENT
END:VCALENDAR
