Research-Parallel-in-time (PinT) algorithms for large-scale flow problems

Research

All

Parallel-in-time (PinT) algorithms for large-scale flow problems

Speaker: Haijian Yang (Hunan University)
Time: Nov 23, 2022, 10:00-11:00
Location: Tencent Meeting ID 847-240-514, Passcode 221123

Abstract

As the number of processors on supercomputers has increased dramatically, there is a growing interest in developing scalable algorithms with a high degree of parallelism for large-scale simulation. However, traditional simulators and algorithms for such nonlinear problems are usually based on the family of time-marching methods, where parallelization is restricted to the spatial dimension only. In this talk, we propose a family of parallel-in-time (PinT) algorithms for solving some large-scale flow problems from computational fluid dynamics or reservoir simulation, to fully exploit the parallelism of supercomputers.