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:20191206T142452Z
LOCATION:Analog 1\, 2
DTSTART;TZID=Europe/Stockholm:20180625T134100
DTEND;TZID=Europe/Stockholm:20180625T134500
UID:isc_hpc_ISC High Performance 2018_sess103_phd110@linklings.com
SUMMARY:(PhD11) Numerical Simulation of Flow around Complex Geometries usi
 ng immersed Boundaries and DG
DESCRIPTION:PhD Forum\n\n(PhD11) Numerical Simulation of Flow around Compl
 ex Geometries using immersed Boundaries and DG\n\nEbrahimi Pour\n\nThe num
 erical simulation of flow around complex geometries, considering also the 
 resulting acoustics, gained more and more attention in the recent years, s
 ince it allows improvements in the design process in early stages of produ
 ct dimensioning. It can help to reduce noise, generated by e.g. wind turbi
 nes, fans etc. Such complex simulations require a lot of compute power. Bu
 t even when realised on supercomputers, a monolithic approach for solving 
 such a huge problem is very expensive. In order to make it more feasible a
 nd reduce the computational time, we consider in the first step partitione
 d coupling. We divide the whole problem in smaller parts, which can than b
 e solved individually with the best-suited numerical discretization, schem
 e and equations. Since this technique requires knowledge about the area, w
 here the decomposition is reasonable and the change of equations is allowe
 d, we consider a second technique in addition. For the second method, we d
 o not need to have a priori knowledge about the flow behaviour in each par
 t of the simulation domain. We can simplify the equations for solving the 
 problem by using an adaptive method. The adaptive method changes the equat
 ions to solve locally in each element, by checking a predefined threshold 
 for the energy, which is the indicator. We compare all methods with each o
 ther and try to find the best method, which allows a quality of solution s
 imilar to the monolithic run but needs less time for the computation.\n\nP
 asses: Conference Pass, Exhibition Pass, Parallel Applications, Scientific
  Software Development\n\nTag: Conference Pass, Exhibition Pass, Parallel A
 pplications, Scientific Software Development
URL:https://2018.isc-program.com/presentation/?id=phd110&sess=sess103
END:VEVENT
END:VCALENDAR

