一、标题：

A graph-partitioned sharp-interface immersed boundary solver for efficient solution of internal flows

二、主讲人：

朱驰

三、摘要：

In this talk, a graph-partitioning framework for a sharp-interface immersed boundary method is proposed S0 as to increase its computational efficiency for simulating internal flows on large- scale parallel computers. Immersed boundary methods are generally inefficient for internal flows with complex geometries due to the larger proportion of grid points that fall outside the fluid domain for such configurations. The graph-partitioning framework proposed here enables the solver to effectively ignore these points and focus the computation on the active points inside the fluid domain. A novel coarsening-partitioning process is proposed to ensure that sufficient overlapping layers are available at the sub-domain interfaces to accommodate computational stencils associated with the discretization as well as the sharp-interface boundary conditions. The benchmark test shows that the adoption of the graph topology reduces the computational cost (wall-time and memory cost) substantially. Moreover, the computational cost is shown to only scale with the number of computationally active grid points. The capability of the graph-partitioned solver is further demonstrated by simulating the flow inside an arterial network, a configuration which would otherwise be out of reach for most immersed boundary methods.

四、主讲人简介：

朱驰，北京大学工学院、研究员、博士生导师。本科毕业于中国科学技术大学，获郭沫若奖学金; 2018年在Johns Hopkins University获得博士学位；后在UC Berkeley从事博士后研究。主要研究方向包括计算生物流体力学、多物理场耦合模拟、高性能计算方法。工作发表于J. Fluid Mech.、J. Comput. Phys等权威杂志，获得过Corrsin-Kovasznay杰出文章奖、Journal of Biomechanical Engineering年度十佳文章以及美国心脏协会博士后基金。主持和参与国家自然科学基金面上项目、重大项目和科技部重点研发计划项目。

五、邀请人：

蒋晓芸 数学学院教授

六、时间：

8月23日（周三）9：30—10：30

七、地点：

山东大学知新楼B座924

八、主办：

山东大学数学学院