Filters. The Number of Channels That Can Clog in a Network | Zendy

Guido Kampel | Zendy; Guillermo H. Goldsztein | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Filters. The Number of Channels That Can Clog in a Network

Author(s) -

Guido Kampel,

Guillermo H. Goldsztein

Publication year - 2008

Publication title -

siam journal on applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.954

H-Index - 99

eISSN - 1095-712X

pISSN - 0036-1399

DOI - 10.1137/080723703

Subject(s) - flow (mathematics) , filter (signal processing) , channel (broadcasting) , suspension (topology) , reynolds number , computer science , upper and lower bounds , mechanics , control theory (sociology) , topology (electrical circuits) , physics , mathematics , telecommunications , mathematical analysis , combinatorics , turbulence , control (management) , artificial intelligence , homotopy , pure mathematics , computer vision

We model filters as two-dimensional networks of channels. As a suspension (fluid with particles) flows through the filter, particles clog channels. We assume that there is no flow through clogged channels. In this paper, we compute a sharp upper bound on the number of channels that can clog before fluid can no longer flow through the filter.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research