A graphical representation of membrane filtration

DOI10.1137/21M1424743MaRDI QIDQ5866313zbMATH OpenOpenAlexFDO

Authors Binan Gu, L. Kondic, Linda Cummings

Publication date 13 June 2022

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2106.03915

zbMATH Keywords

filtration performance metricsgraph model of fluid filtrationHagen-Poiseuille flowmembrane pore networkrandom graph generation method

Mathematics Subject Classification ID

Applications of graph theory (05C90) Mathematical modeling or simulation for problems pertaining to fluid mechanics (76-10) Flows in porous media; filtration; seepage (76S05)

Abstract: 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.

Recommendations

• On the influence of pore connectivity on performance of membrane filters
• Clogging of multigraphs as toy models of filters
• Stochastic modelling of membrane filtration
• Flow and fouling in membrane filters: effects of membrane morphology
• Flow and fouling in a pleated membrane filter

Cites work

• Discrete calculus. Applied analysis on graphs for computational science
• Microvascular networks with uniform flow
• On the influence of pore connectivity on performance of membrane filters
• On the mathematical structure of balanced chemical reaction networks governed by mass action kinetics
• Optimal control in networks of pipes and canals
• Random Geometric Graphs
• The domination number of on-line social networks and random geometric graphs
• The proper diameter of a graph

Cited in

(5)

• Flow and fouling in a pleated membrane filter
• Clogging of multigraphs as toy models of filters
• Rough or wiggly? Membrane topology and morphology for fouling control
• Stochastic modelling of membrane filtration
• On the influence of pore connectivity on performance of membrane filters

This page was built for publication: A graphical representation of membrane filtration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5866313)