Pore network modelling of molecular diffusion in a single‐block model during lean gas injection, a comparative study on calculation approaches
In this paper, we have proposed a new algorithm for pore network modelling of molecular diffusion in a single matrix block model. The block contains a volatile component adjacent to a gaseous lean component to mimic high capillarity‐induced flow rates caused by either high liquid to gas mass transfe...
Gespeichert in:
Veröffentlicht in: | Canadian journal of chemical engineering 2019-03, Vol.97 (3), p.808-820 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, we have proposed a new algorithm for pore network modelling of molecular diffusion in a single matrix block model. The block contains a volatile component adjacent to a gaseous lean component to mimic high capillarity‐induced flow rates caused by either high liquid to gas mass transfer rates and/or small throat size of the porous medium. Various types of boundary conditions for liquid pressure calculation are formulated. Advantages and the range of applicability of this algorithm are compared against an existing algorithm. A threshold value for surface mass transfer coefficient is obtained above which the algorithms that are based on the rule that only one bond is invaded at each step of invasion are no longer applicable. Simultaneous multiple throat invasion in a single time step, unnecessity of liquid cluster identification, and possibility of throat refilling are the major advantages of the new pressure‐based algorithm. While the phase distribution in the old approach is insensitive to surface mass transfer coefficient the proposed approach is severely dependent on the magnitude of this coefficient. The incident in which the liquid body is detached from the top surface in the proposed algorithm is also a strong function of surface mass transfer coefficient. The advantages of the new algorithm, however, come with a higher computational cost, especially for large network sizes. |
---|---|
ISSN: | 0008-4034 1939-019X |
DOI: | 10.1002/cjce.23222 |