Abstract

This paper discusses a numerical subgrid resolution approach for solving the Stokes–Brinkman system of equations, which is describing coupled flow in plain and in highly porous media. Various scientific and industrial problems are described by this system, and often the geometry and/or the permeability vary on several scales. A particular target is the process of oil filtration. In many complicated filters, the filter medium or the filter element geometry are too fine to be resolved by a feasible computational grid. The subgrid approach presented in this paper is aimed at describing how these fine details are accounted for by solving auxiliary problems in appropriately chosen grid cells on a relatively coarse computational grid. This is done via a systematic and careful procedure of modifying and updating the coefficients of the Stokes–Brinkman system in chosen cells. This numerical subgrid approach is motivated from one side from homogenization theory, from which we borrow the formulations for the so-called cell problem, and from the other side from the numerical upscaling approaches, such as Multiscale Finite Volume, Multiscale Finite Element, etc. Results on the algorithm’s efficiency, both in terms of computational time and memory usage, are presented. Comparison of the full fine grid solution (when possible) of the Stokes–Brinkman system with the subgrid solution of the upscaled Stokes–Brinkman system (including effective permeabilities for the quasi-porous cells), are presented in order to evaluate the accuracy and the efficiency. Advantages and limitations of the considered subgrid approach are discussed.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.