TY - JOUR
T1 - Application of parallel aggregation-based multigrid to high resolution subsurface flow simulations
AU - Chen, Menghuo
AU - Sun, Shuyu
N1 - KAUST Repository Item: Exported on 2020-10-04
Acknowledged KAUST grant number(s): BAS/1/1351-01-01
Acknowledgements: The research reported in this publication was supported in part by funding from King Abdullah University of Science and Technology (KAUST) through the grant BAS/1/1351-01-01.
PY - 2019/8
Y1 - 2019/8
N2 - In this paper we assess the parallel efficiency issues for simulating single phase subsurface ow in porous media, where the permeability tensor contains anisotropy rotated with certain angles or severe discontinuity. Space variables are discretized using multi-points ux approximations and the pressure equations are solved by aggregation-based algebraic multigrid method. The involved issues include the domain decomposition of space discretization and coarsening, smoothing, the coarsest grid solving of multigrid solving steps. Numerical experiments exhibit that the convergence of the multigrid algorithm suffers from the parallel implementation. The linear system at the coarsest grid is solved and by various iterative methods and the experimental results show that the parallel efficiency is less attenuated when sparse approximate inverse preconditioning conjugate gradient is used.
AB - In this paper we assess the parallel efficiency issues for simulating single phase subsurface ow in porous media, where the permeability tensor contains anisotropy rotated with certain angles or severe discontinuity. Space variables are discretized using multi-points ux approximations and the pressure equations are solved by aggregation-based algebraic multigrid method. The involved issues include the domain decomposition of space discretization and coarsening, smoothing, the coarsest grid solving of multigrid solving steps. Numerical experiments exhibit that the convergence of the multigrid algorithm suffers from the parallel implementation. The linear system at the coarsest grid is solved and by various iterative methods and the experimental results show that the parallel efficiency is less attenuated when sparse approximate inverse preconditioning conjugate gradient is used.
UR - http://hdl.handle.net/10754/665408
UR - http://www.math.ualberta.ca/ijnam/Volume-16-2019/No-6-19/2019-06-02.pdf
UR - http://www.scopus.com/inward/record.url?scp=85073690186&partnerID=8YFLogxK
M3 - Article
SN - 1705-5105
VL - 16
SP - 873
EP - 890
JO - International Journal of Numerical Analysis and Modeling
JF - International Journal of Numerical Analysis and Modeling
IS - 6
ER -