نتایج جستجو برای: eulerian analysis

تعداد نتایج: 2828002  

2017
Boyce E. Griffith Xiaoyu Luo

The immersed boundary method is an approach to fluid-structure interaction that uses a Lagrangian description of the structural deformations, stresses, and forces along with an Eulerian description of the momentum, viscosity, and incompressibility of the fluid-structure system. The original immersed boundary methods described immersed elastic structures using systems of flexible fibers, and eve...

2009
Shi Jin Hao Wu Xu Yang

A novel Eulerian Gaussian beam method was developed in [8] to compute the Schrödinger equation efficiently in the semiclassical regime. In this paper, we introduce an efficient semi-Eulerian implementation of this method. The new algorithm inherits the essence of the Eulerian Gaussian beam method where the Hessian is computed through the derivatives of the complexified level set functions inste...

Journal: :SIAM J. Discrete Math. 2013
James M. Carraher Stephen G. Hartke

Let G be an eulerian digraph with a fixed edge coloring (not necessarily a proper edge coloring). A compatible circuit of G is an eulerian circuit such that every two consecutive edges in the circuit have different colors. We characterize the existence of compatible circuits for directed graphs avoiding certain vertices of outdegree three. Our result is analogous to a result of Kotzig for compa...

2005
Graham R. Brightwell Peter Winkler

We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod-p reduction from counting Eulerian orientations.

2012
M. I. Isaev

Let G be a simple connected graph all of whose vertices have even degrees. An Eulerian circuit in G is a closed walk (see, for example, [2]) which uses every edge of G exactly once. Two Eulerian circuits are called equivalent if one is a cyclic permutation of the other. It is clear that the size of such an equivalence class equals the number of edges of graph G. Let EC(G) denote the number of e...

Journal: :Electr. J. Comb. 2013
Zhicong Lin

The (q, r)-Eulerian polynomials are the (maj−exc, fix, exc) enumerative polynomials of permutations. Using Shareshian and Wachs’ exponential generating function of these Eulerian polynomials, Chung and Graham proved two symmetrical q-Eulerian identities and asked for bijective proofs. We provide such proofs using Foata and Han’s three-variable statistic (inv−lec, pix, lec). We also prove a new ...

2014
LONG CHEN

1.1. Eulerian and Lagrangian coordinates. Let us begin with Eulerian and Lagrangian coordinates. The Eulerian coordinate (x, t) is the physical space plus time. The Eulerian description of the flow is to describe the flow using quantities as a function of a spatial location x and time t, e.g. the flow velocity u(x, t). This can be visualized by sitting on the bank of a river and watching the wa...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید