• DOI:10.1137/21m1424743
• Corpus ID: 235367981

A Graphical Representation of Membrane Filtration

@article{Gu2022AGR,
  title={A Graphical Representation of Membrane Filtration},
  author={B. Gu and Lou Kondic and Linda J. Cummings},
  journal={SIAM J. Appl. Math.},
  year={2022},
  volume={82},
  pages={950-975}
}

• B. Gu, L. Kondic, L. Cummings
• Published 7 June 2021
• Engineering
• SIAM J. Appl. Math.

We analyze the performance of membrane filters represented by pore networks using two criteria: 1) total volumetric throughput of filtrate over the filter lifetime and 2) accumulated foulant concentration in the filtrate. We first formulate the governing equations of fluid flow on a general network, and we model transport and adsorption of particles (foulants) within the network by imposing an advection equation with a sink term on each pore (edge) as well as conservation of fluid and foulant volumetric flow rates at each pore junction (network vertex). Such a setup yields a system of partial differential equations on the network. We study the influence of three geometric network parameters on filter performance: 1) average number of neighbors of each vertex; 2) initial total void volume of the pore network; and 3) tortuosity of the network. We find that total volumetric throughput depends more strongly on the initial void volume than on average number of neighbors. Tortuosity, however, turns out to be a universal parameter, leading to almost perfect collapse of all results for a variety of different network architectures. In particular, the accumulated foulant concentration in the filtrate shows an exponential decay as tortuosity increases.