CLOGGING OF MULTIGRAPHS AS TOY MODELS OF FILTERS

In this paper we model filters as networks of channels. As suspension (fluid with particles) flows through the filter, particles are trapped and clog channels. We assume there is no flow through clogged channels. The filter becomes impermeable after not all, but only a portion, of the channels clog....

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on applied mathematics 2009-01, Vol.70 (4), p.1078-1096
Main Author: GOLDSZTEIN, GUILLERMO H.
Format: Article
Language:English
Subjects:
Channels
Chemical suspensions
Computational fluid dynamics
Correlation analysis
Filters
Filters (fluid)
Filtration
Fluids
Geometric lines
Graph theory
Graphs
Mathematical analysis
Mathematical models
Networks
Plugging
Porosity
Porous materials
Studies
Suspended solids
Trapped particles
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we model filters as networks of channels. As suspension (fluid with particles) flows through the filter, particles are trapped and clog channels. We assume there is no flow through clogged channels. The filter becomes impermeable after not all, but only a portion, of the channels clog. In this paper we compute an upper bound on the number of channels that clog. This bound is a function of properties of the network. Our results provide an understanding of the relationship between the filter pore space geometry and the filter efficiency.
ISSN:0036-1399
1095-712X
DOI:10.1137/090747579