نتایج جستجو برای: eulerian model
تعداد نتایج: 2107891 فیلتر نتایج به سال:
The compaction forming of metal powder is a process involving large deformations, large strain, non-linear material behavior and friction. Consequently, the numerical analysis of such a highly non-linear process is a formidable computational problem. In this paper, an ALE technique is presented based on a generalized cap plasticity model in simulation of powder forming processes. In ALE formula...
multiphase impeller stirred tank reactors enhance mixing of reacting species used in a variety of chemical industries. these reactors have been studied based on computational fluid dynamics (cfd) that can be used in the analysis, design and scale up of these reactors. most of the researches done in this area are limited to single phase reactors, and a few remaining two phase flow investigations...
We derive from Eulerian electron beam equations the multifrequency spectral Eulerian (MUSE) model, a new onedimensional (1-D) nonlinear multifrequency model of a traveling wave tube (TWT). We also derive from the same equations a Lagrangian “disk” model, LATTE, so that MUSE may be directly compared to a Lagrangian approach. The models are compared to the large signal code Christine 1-D on a set...
A graded partially ordered set is Eulerian if every interval has the same number of elements of even rank and of odd rank. Face lattices of convex polytopes are Eulerian. For Eulerian partially ordered sets, the flag vector can be encoded efficiently in the cd-index. The cd-index of a polytope has all positive entries. An important open problem is to give the broadest natural class of Eulerian ...
An undirected graph is Eulerian if it is connected and all its vertices are of even degree. Similarly, a directed graph is Eulerian, if for each vertex its in-degree is equal to its out-degree. It is well known that Eulerian graphs can be recognized in polynomial time while the problems of finding a maximum Eulerian subgraph or a maximum induced Eulerian subgraph are NP-hard. In this paper, we ...
We derive a non-dimensional metric to quantify the expected Lagrangian persistence of objectively defined Eulerian vortices in two-dimensional unsteady flows. This persistence metric is the averaged deviation of the vorticity from its spatial mean over the Eulerian vortex, normalized by the instantaneous material leakage from the Eulerian vortex. The metric offers a modeland frame-independent t...
Advancements in internal combustion technology, such as efficiency improvements and the usage of new complex fuels, are often coupled with developments suitable numerical tools for predicting dynamic behavior sprays. Therefore, this work presents a Eulerian multi-fluid model specialized dense evaporating liquid fuel The introduced was implemented within open-source OpenFOAM library, which is co...
Problems involving a transition between dense and dilute dispersed phase regimes often require hybridization of Eulerian-Eulerian (EE) Eulerian-Lagrangian (EL) methods for accurate efficient computational modeling. A hybrid EE-EL formulation is developed in this work from first principles, which asymptotes to well-established EE EL limiting conditions. smooth dynamic criterion corresponding alg...
We introduce Eulerian maps with blocked edges as a general way to implement statistical matter models on random maps by a modification of intrinsic distances. We show how to code these dressed maps by means of mobiles, i.e. decorated trees with labeled vertices, leading to a closed system of recursion relations for their generating functions. We discuss particular solvable cases in detail, as w...
Sum-free enumerative formulae are derived for several classes of rooted planar maps with no vertices of odd valency (eulerian maps) and with two vertices of odd valency (unicursal maps). As corollaries we obtain simple formulae for the numbers of unrooted eulerian and unicursal planar maps. Also, we obtain a sum-free formula for the number of rooted bi-eulerian (eulerian and bipartite) maps and...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید