Parallel Domain Decomposition method for the fully-mixed Stokes-dual-permeability fluid flow model with Beavers-Joseph interface conditions

TL;DR

This paper introduces a parallel domain decomposition method for solving complex Stokes-dual-permeability flow models with Beavers-Joseph interface conditions, enabling efficient and convergent solutions through decoupling and rigorous analysis.

Contribution

It presents a novel parallel algorithm that fully decouples the Stokes-dual-permeability model, with proven convergence and geometric rate, validated by numerical experiments.

Findings

The algorithm achieves geometric convergence under suitable parameters.

Decoupling simplifies the complex flow model for efficient computation.

Numerical results confirm the method's effectiveness and convergence.

Abstract

In this paper, a parallel domain decomposition method is proposed for solving the fully-mixed Stokes-dual-permeability fluid flow model with Beavers-Joseph (BJ) interface conditions. Three Robin-type boundary conditions and a modified weak formulation are constructed to completely decouple the original problem, not only for the free flow and dual-permeability regions but also for the matrix and microfractures in the dual-porosity media. We derive the equivalence between the original problem and the decoupled systems with some suitable compatibility conditions, and also demonstrate the equivalence of two weak formulations in different Sobolev spaces. Based on the completely decoupled modified weak formulation, the convergence of the iterative parallel algorithm is proved rigorously. To carry out the convergence analysis of our proposed algorithm, we propose an important but general convergence lemma for the steady-state problems. Furthermore, with some suitable choice of parameters, the new algorithm is proved to achieve the geometric convergence rate. Finally, several numerical experiments are presented to illustrate and validate the performance and exclusive features of our proposed algorithm.