清晨好,您是今天最早来到科研通的研友!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您科研之路漫漫前行!

NSFnets (Navier-Stokes flow nets): Physics-informed neural networks for the incompressible Navier-Stokes equations

纳维-斯托克斯方程组 人工神经网络 不可压缩流 压缩性 应用数学 压力修正法 来自Navier-Stokes方程的Hagen-Poiseuille流 流量(数学) 数学 经典力学 计算机科学 物理 机械 人工智能
作者
Xiaowei Jin,Shengze Cai,Hui Li,George Em Karniadakis
出处
期刊:Journal of Computational Physics [Elsevier BV]
卷期号:426: 109951-109951 被引量:1342
标识
DOI:10.1016/j.jcp.2020.109951
摘要

In the last 50 years there has been a tremendous progress in solving numerically the Navier-Stokes equations using finite differences, finite elements, spectral, and even meshless methods. Yet, in many real cases, we still cannot incorporate seamlessly (multi-fidelity) data into existing algorithms, and for industrial-complexity applications the mesh generation is time consuming and still an art. Moreover, solving ill-posed problems (e.g., lacking boundary conditions) or inverse problems is often prohibitively expensive and requires different formulations and new computer codes. Here, we employ physics-informed neural networks (PINNs), encoding the governing equations directly into the deep neural network via automatic differentiation, to overcome some of the aforementioned limitations for simulating incompressible laminar and turbulent flows. We develop the Navier-Stokes flow nets (NSFnets) by considering two different mathematical formulations of the Navier-Stokes equations: the velocity-pressure (VP) formulation and the vorticity-velocity (VV) formulation. Since this is a new approach, we first select some standard benchmark problems to assess the accuracy, convergence rate, computational cost and flexibility of NSFnets; analytical solutions and direct numerical simulation (DNS) databases provide proper initial and boundary conditions for the NSFnet simulations. The spatial and temporal coordinates are the inputs of the NSFnets, while the instantaneous velocity and pressure fields are the outputs for the VP-NSFnet, and the instantaneous velocity and vorticity fields are the outputs for the VV-NSFnet. This is unsupervised learning and, hence, no labeled data are required beyond boundary and initial conditions and the fluid properties. The residuals of the VP or VV governing equations, together with the initial and boundary conditions, are embedded into the loss function of the NSFnets. No data is provided for the pressure to the VP-NSFnet, which is a hidden state and is obtained via the incompressibility constraint without extra computational cost. Unlike the traditional numerical methods, NSFnets inherit the properties of neural networks (NNs), hence the total error is composed of the approximation, the optimization, and the generalization errors. Here, we empirically attempt to quantify these errors by varying the sampling ("residual") points, the iterative solvers, and the size of the NN architecture. For the laminar flow solutions, we show that both the VP and the VV formulations are comparable in accuracy but their best performance corresponds to different NN architectures. The initial convergence rate is fast but the error eventually saturates to a plateau due to the dominance of the optimization error. For the turbulent channel flow, we show that NSFnets can sustain turbulence at Reτ∼1,000, but due to expensive training we only consider part of the channel domain and enforce velocity boundary conditions on the subdomain boundaries provided by the DNS data base. We also perform a systematic study on the weights used in the loss function for balancing the data and physics components, and investigate a new way of computing the weights dynamically to accelerate training and enhance accuracy. In the last part, we demonstrate how NSFnets should be used in practice, namely for ill-posed problems with incomplete or noisy boundary conditions as well as for inverse problems. We obtain reasonably accurate solutions for such cases as well without the need to change the NSFnets and at the same computational cost as in the forward well-posed problems. We also present a simple example of transfer learning that will aid in accelerating the training of NSFnets for different parameter settings.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
3秒前
7秒前
龙龙发布了新的文献求助10
8秒前
成就马里奥完成签到,获得积分10
8秒前
顺利大门完成签到,获得积分10
29秒前
34秒前
超帅黑夜完成签到,获得积分10
40秒前
科研通AI6.3的应助被Raju采纳,获得10
41秒前
爱撒娇的芷巧完成签到,获得积分10
41秒前
aspect完成签到 ,获得积分10
43秒前
jane123完成签到,获得积分10
44秒前
53秒前
龙龙发布了新的文献求助10
54秒前
Everything完成签到,获得积分10
1分钟前
1分钟前
健康的忘幽完成签到,获得积分10
1分钟前
田様的应助被李pp采纳,获得10
1分钟前
1分钟前
1分钟前
孤独君浩发布了新的文献求助10
1分钟前
所所的应助被孤独君浩采纳,获得10
1分钟前
Criminology34的应助被科研通管家采纳,获得10
1分钟前
Criminology34的应助被科研通管家采纳,获得10
1分钟前
Criminology34的应助被科研通管家采纳,获得10
1分钟前
迷路飞凤完成签到,获得积分10
1分钟前
科研通AI6.2的应助被龙龙采纳,获得10
1分钟前
cc完成签到,获得积分10
1分钟前
1分钟前
合不着完成签到 ,获得积分10
1分钟前
loii完成签到,获得积分0
1分钟前
碧蓝山灵完成签到,获得积分10
1分钟前
池雨完成签到 ,获得积分10
1分钟前
2分钟前
2分钟前
2分钟前
2分钟前
tlh完成签到 ,获得积分10
2分钟前
2分钟前
诚心荟完成签到,获得积分10
2分钟前
甜美梦之完成签到,获得积分10
2分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
John McDowells Bildungstheorie 800
八旗制度の研究 600
plantTFDB 508
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8173194
求助须知:如何正确求助?哪些是违规求助? 9565558
关于积分的说明 21780461
捐赠科研通 7767279
什么是DOI,文献DOI怎么找? 3431542
关于科研通互助平台的介绍 2555697
邀请新用户注册赠送积分活动 2476682