Bucket-based multigrid preconditioner for solving pressure Poisson equation using a particle method

被引:4
作者
Sodersten, Axel [1 ]
Matsunaga, Takuya [1 ]
Koshizuka, Seiichi [1 ]
机构
[1] Univ Tokyo, Dept Syst Innovat, Bunkyo Ku, 7-3-1 Hongo, Tokyo 1138656, Japan
基金
日本学术振兴会;
关键词
Computational fluid dynamics; Particle method; Moving particle semi-implicit method; Multigrid preconditioner; Aggregation-based multigrid method; Bucket-based multigrid method; SEMIIMPLICIT METHOD; CONSERVATION PROPERTIES; MPS METHOD; STABILIZATION; AGGREGATION; ENHANCEMENT; PERFORMANCE; SIMULATION; ACCURATE; SCHEMES;
D O I
10.1016/j.compfluid.2019.104242
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The execution time for incompressible particle methods is dominated by solving large sparse linear systems. In this study, a novel simple bucket-based multigrid (BMG) preconditioner is presented to retrieve linear scaling. In the algorithm, the domain is decomposed into cubic boxes, to enable recursive aggregation of the closest neighboring particles. Under a moving particle semi-implicit (MPS) discretization scheme, parametric, verification, and performance studies were conducted for basic problems. From the parametric study, the BMG preconditioner was accompanied with a Krylov subspace accelerated multigrid cycle strategy and incorporated into a generalized conjugate residual method. Regardless of dimension and degree of particle distribution irregularity, the method significantly outperformed a conjugate gradient (CG), an incomplete Cholesky CG, and a conventional plain aggregation-based algebraic multigrid preconditioned solver. For a dam-break problem with 1.3 M and 2.3 M particles in 2D and 3D, the proposed method, as a linear solver for the MPS method, was 27 and 5.4 times faster than the CG method. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数:21
相关论文
共 52 条
[1]  
[Anonymous], 2000, MULTIGRID
[2]   A Stabilized Incompressible SPH Method by Relaxing the Density Invariance Condition [J].
Asai, Mitsuteru ;
Aly, Abdelraheem M. ;
Sonoda, Yoshimi ;
Sakai, Yuzuru .
JOURNAL OF APPLIED MATHEMATICS, 2012,
[3]   EXPOSING FINE-GRAINED PARALLELISM IN ALGEBRAIC MULTIGRID METHODS [J].
Bell, Nathan ;
Dalton, Steven ;
Olson, Luke N. .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2012, 34 (04) :C123-C152
[4]   Towards algebraic multigrid for elliptic problems of second order [J].
Braess, D .
COMPUTING, 1995, 55 (04) :379-393
[5]  
Briggs WL, 2000, MULTIGRID TUTORIAL, DOI [10.1007/BF02238488, DOI 10.1007/BF02238488]
[6]   NUMERICAL SOLUTION OF NAVIER-STOKES EQUATIONS [J].
CHORIN, AJ .
MATHEMATICS OF COMPUTATION, 1968, 22 (104) :745-&
[7]   Incompressible SPH (ISPH) with fast Poisson solver on a GPU [J].
Chow, Alex D. ;
Rogers, Benedict D. ;
Lind, Steven J. ;
Stansby, Peter K. .
COMPUTER PHYSICS COMMUNICATIONS, 2018, 226 :81-103
[8]   A survey of parallelization techniques for multigrid solvers [J].
Chow, Edmond ;
Falgout, Robert A. ;
Hu, Jonathan J. ;
Tuminaro, Raymond S. ;
Yang, Ulrike Meier .
PARALLEL PROCESSING FOR SCIENTIFIC COMPUTING, 2006, :179-201
[9]  
Golub OH, 2013, MATRIX COMPUTATIONS
[10]  
Gotoh H., 2016, J OCEAN ENG MAR ENER, V2, P251, DOI [DOI 10.1007/S40722-016-0049-3, https://doi.org/10.1007/s40722-016-0049-3]