Adaptive iterative multiscale finite volume method

The multiscale finite volume (MSFV) method is a computationally efficient numerical method for the solution of elliptic and parabolic problems with heterogeneous coefficients. It has been shown for a wide range of test cases that the MSFV results are in close agreement with those obtained with a classical (computationally expensive) technique. The method, however, fails to give accurate results for highly anisotropic heterogeneous problems due to weak localization assumptions. Recently, a convergent iterative MSFV (i-MSFV) method was developed to enhance the quality of the multiscale results by improving the localization conditions. Although the i-MSFV method proved to be efficient for most practical problems, it is still favorable to improve the localization condition adaptively, i.e. only for a sub-domain where the original MSFV localization conditions are not acceptable, e.g. near shale layers and long coherent structures with high permeability contrasts. In this paper, a space–time adaptive i-MSFV (ai-MSFV) method is introduced. It is shown how to improve the MSFV results adaptively in space and simulation time. The fine-scale smoother, which is necessary for convergence of the i-MSFV method, is also applied locally. Finally, for multiphase flow problems, two criteria are investigated for adaptively updating the MSFV interpolation functions: (1) a criterion based on the total mobility change for the transient coefficients and (2) a criterion based on the pressure equation residual for the accuracy of the results. For various challenging test cases it is demonstrated that iterations in order to obtain accurate results even for highly anisotropic heterogeneous problems are required only in small sub-domains and not everywhere. The findings show that the error introduced in the MSFV framework can be controlled and improved very efficiently with very little additional computational cost compared to the original, non-iterative MSFV method.