Abstract

AbstractFluid flow problems in bi‐porous media have strong implications in a variety of industrial applications, such as nuclear waste disposal and composites manufacturing. Despite various numerical solutions proposed in the literature, the prediction of dual‐scale flow remains a challenging task due to the requirement of fine meshes to resolve the complex microstructures of bi‐porous media. This paper introduces a new numerical solver based on fast Fourier transform (FFT) for the Stokes–Brinkman problem to predict fluid flow in bi‐porous media with local anisotropy. The novel FFT solver is derived from a velocity‐form of the problem, in contrast to the stress‐form proposed by a recent work. The Anderson acceleration technique is applied for the first time to the Stokes–Brinkman problem, leading to a substantial (orders of magnitude) improvement of the convergence rate. A range of detailed numerical examples are provided to validate the method against the analytical and literature results. Parametric studies are also demonstrated to aid in the selection of model parameters to achieve optimum numerical performance. With a 3D unit cell of a woven textile fabric, we demonstrate that the proposed method is capable of handling high‐resolution simulations with strongly heterogeneous microstructures. Combined with a parallelized implementation over high‐performance computing systems, our method demonstrates a new state‐of‐the‐art in numerical solvers for the Stokes‐Brinkman problem, in terms of computation capacity.

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.