返回
A FULLY IMPLICIT METHOD FOR LATTICE BOLTZMANN EQUATIONS
DOI:10.1137/140975346.png)
摘要
En 中文
Existing approaches for solving the lattice Boltzmann equations with finite difference methods are explicit and semi-implicit; both have certain stability constraints on the time step size. In this work, a fully implicit second-order finite difference scheme is developed. We focus on a parallel, highly scalable, Newton-Krylov-RAS algorithm for the solution of a large sparse nonlinear system of equations arising at each time step. Here, RAS is a restricted additive Schwarz preconditioner based on a first-order spatial discretization. We show numerically that by using the fully implicit method the time step size is no longer constrained by the CFL condition, and the Newton-Krylov-RAS algorithm is scalable on a supercomputer with more than ten thousand processors. Moreover, to calculate the steady state solution we investigate an adaptive time stepping strategy. The total compute time required by the implicit method with adaptive time stepping is much smaller than that of an explicit method for several test cases.
Keyword:
lattice Boltzmann equations
fully implicit method
Newton-Krylov-RAS
domain decomposition
parallel scalability
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
On pressure and velocity boundary conditions for the lattice Boltzmann BGK model
PHYSICS OF FLUIDS
IF4.3

