Filtration of Forward end Back Flow of Suspension in Porous Media
Filtration problem of suspension with identical particles in a porous medium is considered. Physical and mathematical models for size-exclusion capture mechanism of suspended particles at the inlet of filter pores are presented. An exact solution is constructed for the forward and back flow of suspension in a porous medium in case of linear filtration coefficient.
The mechanical-geometric model of the suspension filtering in the porous media is considered. Suspended solid particles of the same size move with suspension flow through the porous media - a solid body with pores - channels of constant cross section. It is assumed that the particles pass freely through the pores of large diameter and are stuck at the inlet of pores that are smaller than the particle size. It is considered that one particle can clog only one small pore and vice versa. Particles stuck in the pores remain motionless and form a deposit. The concentrations of suspended and retained particles satisfy a quasilinear hyperbolic system of partial differential equations of the first order, obtained as a result of macro-averaging of micro-stochastic diffusion equations. Initially the porous media contains no particles and both concentrations are equal to zero; the suspension supplied to the porous media inlet has a constant concentration of sus-pended particles. The flow of particles moves in the porous media with a constant speed, before the wave front the concentrations of suspended and retained particles are zero. Assuming that the filtration coefficient is small we construct an asymptotic solution of the filtration problem over the concentration front. Terms of the asymptotic expansions sat-isfy linear partial differential equations of the first order and are determined successively in an explicit form. It is shown that in the simplest case the asymptotics found matches the known asymptotic expansion of the solution near the concentration front.
The mathematical model of filtering the suspension in a porous medium and its asymptotic solution behind the concentration front depend on several parameters. These parameters are determined by the given values of concentrations of suspended and retained particles at the filter inlet and outlet. An estimation of the method`s error is given.
This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.
Filtration describes a variety of the construction complex problems: strengthening loose soil to create a solid foundation, the movement of groundwater with solid impurities near underground structures, and many others. A model of two-sized deep bed filtration particles moving with different velocities in a porous medium with three-size pores is considered. The competition of pores and various size particles for deposit formation is modeled. Solutions are constructed at the porous medium inlet and on the concentrations front of the fast particles. For constant filtration coefficients, a global exact solution is obtained. Numerical calculation illustrates the evolution of the filtration process.
The Cell Formation Problem (CFP) is an NP-hard optimization problem considered for cellular man- ufacturing systems. Because of its high computational complexity there have been developed a lot of heuristics and almost no exact algorithms for solving this problem. In this paper we suggest a branch- and-bound algorithm which provides exact solutions for the CFP with the grouping efficacy objective function. To linearize this fractional objective function we apply the Dinkelbach approach. Our algorithm finds optimal solutions for 24 of the 35 popular benchmark instances from literature and for the remaining instances it finds good solutions close to the best known. The difference in the grouping efficacy with the best known solutions is always less than 1.5%.
Filtering the suspension in porous media is important for long-term assessment of the strength of soil in the construction of underground and hydraulic engineering structures. The geometrical and mechanical model of filtering is considered: solid particles pass freely through the larger pores, and get stuck at the entrance of tiny pores smaller than the diameter of the particles. The asymptotics of the suspended and retained particle concentrations in the suspension is constructed on the assumption of small deposit.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Let k be a field of characteristic zero, let G be a connected reductive algebraic group over k and let g be its Lie algebra. Let k(G), respectively, k(g), be the field of k- rational functions on G, respectively, g. The conjugation action of G on itself induces the adjoint action of G on g. We investigate the question whether or not the field extensions k(G)/k(G)^G and k(g)/k(g)^G are purely transcendental. We show that the answer is the same for k(G)/k(G)^G and k(g)/k(g)^G, and reduce the problem to the case where G is simple. For simple groups we show that the answer is positive if G is split of type A_n or C_n, and negative for groups of other types, except possibly G_2. A key ingredient in the proof of the negative result is a recent formula for the unramified Brauer group of a homogeneous space with connected stabilizers. As a byproduct of our investigation we give an affirmative answer to a question of Grothendieck about the existence of a rational section of the categorical quotient morphism for the conjugating action of G on itself.
Let G be a connected semisimple algebraic group over an algebraically closed field k. In 1965 Steinberg proved that if G is simply connected, then in G there exists a closed irreducible cross-section of the set of closures of regular conjugacy classes. We prove that in arbitrary G such a cross-section exists if and only if the universal covering isogeny Ĝ → G is bijective; this answers Grothendieck's question cited in the epigraph. In particular, for char k = 0, the converse to Steinberg's theorem holds. The existence of a cross-section in G implies, at least for char k = 0, that the algebra k[G]G of class functions on G is generated by rk G elements. We describe, for arbitrary G, a minimal generating set of k[G]G and that of the representation ring of G and answer two Grothendieck's questions on constructing generating sets of k[G]G. We prove the existence of a rational (i.e., local) section of the quotient morphism for arbitrary G and the existence of a rational cross-section in G (for char k = 0, this has been proved earlier); this answers the other question cited in the epigraph. We also prove that the existence of a rational section is equivalent to the existence of a rational W-equivariant map T- - - >G/T where T is a maximal torus of G and W the Weyl group.