- Journal Home
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
In this paper we assess the parallel efficiency issues for simulating single phase subsurface flow in porous media, where the permeability tensor contains anisotropy rotated with certain angles or severe discontinuity. Space variables are discretized using multi-points flux 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.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/13258.html} }In this paper we assess the parallel efficiency issues for simulating single phase subsurface flow in porous media, where the permeability tensor contains anisotropy rotated with certain angles or severe discontinuity. Space variables are discretized using multi-points flux 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.