Physics-informed neural network (PINN) has emerged as a promising approach for solving differential equations in recent years. However, their application to large-scale complex problems has faced challenges regarding accuracy and efficiency. To address these limitations, domain decomposition has gained popularity as an effective strategy. This paper studies a domain decomposition PINN method for solving incompressible Navier–Stokes equations. We assess the method's predicted accuracy, convergence, and the impact of different strategies on performance. In the domain decomposition PINN method, individual PINN is employed for each subdomain to compute local solutions, which are seamlessly connected by enforcing additional continuity conditions at the interfaces. To improve the method's performance, we investigate various continuity conditions at the interfaces and analyze their influence on the predictive accuracy and interface continuity. Furthermore, we introduce two approaches: the dynamic weight method and a novel neural network architecture incorporating attention mechanisms, both aimed at mitigating gradient pathologies commonly encountered in PINN methods. To demonstrate the effectiveness of the proposed method, we apply it to a range of forward and inverse problems involving diverse incompressible Navier–Stokes flow scenarios. This includes solving benchmark problems such as the two-dimensional (2D) Kovasznay flow, the three-dimensional (3D) Beltrami flow, the 2D lid-driven cavity flow, and the 2D cylinder wake. Additionally, we conduct 3D blood flow simulations for synthetic flow geometries and real blood vessels. The experimental results demonstrate the capability and versatility of the domain decomposition PINN method in accurately solving incompressible Navier–Stokes flow problems.
In the continuous-time random walk model, the time-fractional operator usually expresses an infinite waiting time probability density. Different from that usual setting, this work considers the tempered time-fractional operator, which reflects a finite waiting time probability density. Firstly, we analyse the solution of a tempered benchmark problem, which shows a weak singularity near the initial time. The L1 scheme on graded mesh and the weighted shifted Grünwald–Letnikov formula with correction terms are adapted to deal with the non-smooth solution, in which we compare these two methods systematically in terms of the convergence and consumed CPU time. Furthermore, a fast calculation for the time tempered Caputo fractional derivative is developed based on a sum-of-exponentials approximation, which significantly reduces the running time. Moreover, the tempered operator is applied to the Bloch equation in nuclear magnetic resonance and a two-layered problem with composite material exhibiting distinct memory effects, for which both the analytical (or semi-analytical) and numerical solutions are derived using transform techniques and finite difference methods. Data-fitting results verify that the tempered time-fractional model is much effective to describe the MRI data. An important finding is that, compared with the fractional index, the tempered operator parameter could further accelerate the diffusion. The tempered model with two parameters $$\alpha $$ and $$\rho $$ are more flexible, which can avoid choosing a too small fractional index leading to low regularity and strong heterogeneity.
8 July 2022 in Computer Methods and Programs in Biomedicine