Showing papers on "Eulerian path published in 2015"

The affine particle-in-cell method

Abstract: Hybrid Lagrangian/Eulerian simulation is commonplace in computer graphics for fluids and other materials undergoing large deformation. In these methods, particles are used to resolve transport and topological change, while a background Eulerian grid is used for computing mechanical forces and collision responses. Particle-in-Cell (PIC) techniques, particularly the Fluid Implicit Particle (FLIP) variants have become the norm in computer graphics calculations. While these approaches have proven very powerful, they do suffer from some well known limitations. The original PIC is stable, but highly dissipative, while FLIP, designed to remove this dissipation, is more noisy and at times, unstable. We present a novel technique designed to retain the stability of the original PIC, without suffering from the noise and instability of FLIP. Our primary observation is that the dissipation in the original PIC results from a loss of information when transferring between grid and particle representations. We prevent this loss of information by augmenting each particle with a locally affine, rather than locally constant, description of the velocity. We show that this not only stably removes the dissipation of PIC, but that it also allows for exact conservation of angular momentum across the transfers between particles and grid.

Bias in the Effective Field Theory of Large Scale Structures

Abstract: We study how to describe collapsed objects, such as galaxies, in the context of the Effective Field Theory of Large Scale Structures. The overdensity of galaxies at a given location and time is determined by the initial tidal tensor, velocity gradients and spatial derivatives of the regions of dark matter that, during the evolution of the universe, ended up at that given location. Similarly to what was recently done for dark matter, we show how this Lagrangian space description can be recovered by upgrading simpler Eulerian calculations. We describe the Eulerian theory. We show that it is perturbatively local in space, but non-local in time, and we explain the observational consequences of this fact. We give an argument for why to a certain degree of accuracy the theory can be considered as quasi time-local and explain what the operator structure is in this case. We describe renormalization of the bias coefficients so that, after this and after upgrading the Eulerian calculation to a Lagrangian one, the perturbative series for galaxies correlation functions results in a manifestly convergent expansion in powers of k/kNL and k/kM, where k is the wavenumber of interest, kNL is the wavenumber associated to the non-linear scale, and kM is the comoving wavenumber enclosing the mass of a galaxy.

Global solutions and asymptotic behavior for two dimensional gravity water waves

Abstract: This paper is devoted to the proof of a global existence result for the water waves equation with smooth, small, and decaying at infinity Cauchy data. We obtain moreover an asymptotic description in physical coordinates of the solution, which shows that modified scattering holds. The proof is based on a bootstrap argument involving $L^2$ and $L^\infty$ estimates. The $L^2$ bounds are proved in a companion paper of this article. They rely on a normal forms paradifferential method allowing one to obtain energy estimates on the Eulerian formulation of the water waves equation. We give here the proof of the uniform bounds, interpreting the equation in a semi-classical way, and combining Klainerman vector fields with the description of the solution in terms of semi-classical lagrangian distributions. This, together with the $L^2$ estimates of the companion paper, allows us to deduce our main global existence result.

Eulerian BAO Reconstructions and N-Point Statistics

Abstract: As galaxy surveys begin to measure the imprint of baryonic acoustic oscillations (BAO) on large-scale structure at the sub-percent level, reconstruction techniques that reduce the contamination from nonlinear clustering become increasingly important. Inverting the nonlinear continuity equation, we propose an Eulerian growth-shift reconstruction algorithm that does not require the displacement of any objects, which is needed for the standard Lagrangian BAO reconstruction algorithm. In real-space DM-only simulations the algorithm yields 95% of the BAO signal-to-noise obtained from standard reconstruction. The reconstructed power spectrum is obtained by adding specific simple 3- and 4-point statistics to the pre-reconstruction power spectrum, making it very transparent how additional BAO information from higher-point statistics is included in the power spectrum through the reconstruction process. Analytical models of the reconstructed density for the two algorithms agree at second order. Based on similar modeling efforts, we introduce four additional reconstruction algorithms and discuss their performance.

Objective Eulerian Coherent Structures

Abstract: We define objective Eulerian Coherent Structures (OECSs) in two-dimensional, non-autonomous dynamical systems as instantaneously most influential material curves. Specifically, OECSs are stationary curves of the averaged instantaneous material stretching-rate or material shearing-rate functionals. From these objective (frame-invariant) variational principles, we obtain explicit differential equations for hyperbolic, elliptic and parabolic OECSs. As illustration, we compute OECSs in an unsteady ocean velocity data set. In comparison to structures suggested by other common Eulerian diagnostic tools, we find OECSs to be the correct short-term cores of observed trajectory deformation patterns.

Detection and tracking of vortex phenomena using Lagrangian coherent structures

Abstract: The formation and shedding of vortices in two vortex-dominated flows around an actuated flat plate are studied to develop a better method of identifying and tracking coherent structures in unsteady flows. The work automatically processes data from the 2D simulation of a flat plate undergoing a $$45^{\circ }$$ pitch-up maneuver, and from experimental particle image velocimetry data in the wake of a continuously pitching trapezoidal panel. The Eulerian $$\varGamma _1$$ , $$\varGamma _2$$ , and Q functions, as well as the Lagrangian finite-time Lyapunov exponent are applied to identify both the centers and boundaries of the vortices. The multiple vortices forming and shedding from the plates are visualized well by these techniques. Tracking of identifiable features, such as the Lagrangian saddle points, is shown to have potential to identify the timing and location of vortex formation, shedding, and destruction more precisely than by only studying the vortex cores as identified by the Eulerian techniques.

Comparing the Markov Chain Model with the Eulerian and Lagrangian Models for Indoor Transient Particle Transport Simulations

Abstract: Correctly predicting transient particle transport in indoor environments is crucial to improving the design of ventilation systems and reducing the risk of acquiring airborne infectious diseases. Recently, a new model was developed on the basis of Markov chain frame for quickly predicting transient particle transport indoors. To evaluate this Markov chain model, this study compared it with the traditional Eulerian and Lagrangian models in terms of performance, computing cost, and robustness. Four cases of particle transport, three of which included experimental data, were used for this comparison. The Markov chain model was able to predict transient particle transport indoors with similar accuracy to the Eulerian and Lagrangian models. Furthermore, when the same time step size (Courant number ≤1) and grid number were used for all three models, the Markov chain model had the highest calculation speed. The Eulerian model was faster than the Lagrangian model unless a super-fine grid was used. This investigat...

Model-reduced variational fluid simulation

Abstract: We present a model-reduced variational Eulerian integrator for incompressible fluids, which combines the efficiency gains of dimension reduction, the qualitative robustness of coarse spatial and temporal resolutions of geometric integrators, and the simplicity of sub-grid accurate boundary conditions on regular grids to deal with arbitrarily-shaped domains. At the core of our contributions is a functional map approach to fluid simulation for which scalar- and vector-valued eigenfunctions of the Laplacian operator can be easily used as reduced bases. Using a variational integrator in time to preserve liveliness and a simple, yet accurate embedding of the fluid domain onto a Cartesian grid, our model-reduced fluid simulator can achieve realistic animations in significantly less computational time than full-scale non-dissipative methods but without the numerical viscosity from which current reduced methods suffer. We also demonstrate the versatility of our approach by showing how it easily extends to magnetohydrodynamics and turbulence modeling in 2D, 3D and curved domains.

On the Anisotropic Gaussian velocity closure for inertial- particle laden flows

Abstract: The accurate simulation of disperse two-phase flows, where a discrete partic- ulate condensed phase is transported by a carrier gas, is crucial for many applications; Eulerian approaches are well suited for high performance computations of such flows. However when the particles from the disperse phase have a significant inertia compared to the time scales of the flow, particle trajectory crossing (PTC) occurs i.e. the particle ve- locity distribution at a given location can become multi-valued. To properly account for such a phenomenon many Eulerian moment methods have been recently proposed in the literature. The resulting models hardly comply with a full set of desired criteria involving: 1- ability to reproduce the physics of PTC, at least for a given range of particle inertia, 2- well-posedness of the resulting set of PDEs on the chosen moments as well as guaran- teed realizability, 3- capability of the model to be associated with a high order realizable numerical scheme for the accurate resolution of particle segregation in turbulent flows. The purpose of the present contribution is to introduce a multi-variate Anisotropic Gaus- sian closure for such particulate flows, in the spirit of the closure that has been suggested for out-of-equilibrium gas dynamics and which satisfies the three criteria. The novelty of the contribution is three-fold. First we derive the related moment systems of conservation laws with source terms, and justify the use of such a model in the context of high Knudsen numbers, where collision operators play no role. We exhibit the main features and advan- tages in terms of mathematical structure and realizability. Then a second order accurate and realizable MUSCL/HLL scheme is proposed and validated. Finally the behavior of the method for the description of PTC is thoroughly investigated and its ability to account accurately for inertial particulate flow dynamics in typical configurations is assessed.

Full Eulerian lattice Boltzmann model for conjugate heat transfer.

Abstract: In this paper a full Eulerian lattice Boltzmann model is proposed for conjugate heat transfer. A unified governing equation with a source term for the temperature field is derived. By introducing the source term, we prove that the continuity of temperature and its normal flux at the interface is satisfied automatically. The curved interface is assumed to be zigzag lines. All physical quantities are recorded and updated on a Cartesian grid. As a result, any complicated treatment near the interface is avoided, which makes the proposed model suitable to simulate the conjugate heat transfer with complex interfaces efficiently. The present conjugate interface treatment is validated by several steady and unsteady numerical tests, including pure heat conduction, forced convection, and natural convection problems. Both flat and curved interfaces are also involved. The obtained results show good agreement with the analytical and/or finite volume results.

Open boundary molecular dynamics

Abstract: This contribution analyzes several strategies and combination of methodologies to perform molecular dynamic simulations in open systems. Here, the term open indicates that the total system has boundaries where transfer of mass, momentum and energy can take place. This formalism, which we call Open Boundary Molecular Dynamics (OBMD), can act as interface of different schemes, such as Adaptive Resolution Scheme (AdResS) and Hybrid continuum-particle dynamics to link atomistic, coarse-grained (CG) and continuum (Eulerian) fluid dynamics in the general framework of fluctuating Navier-Stokes equations. The core domain of the simulation box is solved using all-atom descriptions. The CG layer introduced using AdResS is located at the outer part of the open box to make feasible the insertion of large molecules into the system. Communications between the molecular system and the outer world are carried out in the outer layers, called buffers. These coupling preserve momentum and mass conservation laws and can thus be linked with Eulerian hydro- dynamic solvers. In its simpler form, OBMD allows, however, to impose a local pressure tensor and a heat flux across the system’s boundaries. For a one component molecular system, the external normal pressure and temperature determine the external chemical potential and thus the independent parameters of a grand-canonical ensemble simulation. Extended ensembles under non-equilibrium stationary states can also be simulated as well as time dependent forcings (e.g. oscillatory rheology). To illustrate the robustness of the combined OBMD-AdResS method, we present simulations of star-polymer melts at equilibrium and in sheared flow.

Space-time correlations in turbulent flow: A review

Abstract: This paper reviews some of the principal uses, over almost seven decades, of correlations, in both Eulerian and Lagrangian frames of reference, of properties of turbulent flows at variable spatial locations and variable time instants. Commonly called space--time correlations, they have been fundamental to theories and models of turbulence as well as for the analyses of experimental and direct numerical simulation turbulence data.

Eulerian Method for Multiphase Interactions of Soft Solid Bodies in Fluids

Abstract: We introduce an Eulerian approach for problems involving one or more soft solids immersed in a fluid, which permits mechanical interactions between all phases. The reference map variable is exploited to simulate finite-deformation constitutive relations in the solid(s) on the same fixed grid as the fluid phase, which greatly simplifies the coupling between phases. Our coupling procedure, a key contribution in the current work, is shown to be computationally faster and more stable than an earlier approach, and admits the ability to simulate both fluid--solid and solid--solid interaction between submerged bodies. The interface treatment is demonstrated with multiple examples involving a weakly compressible Navier--Stokes fluid interacting with a neo-Hookean solid, and we verify the method's convergence. The solid contact method, which exploits distance-measures already existing on the grid, is demonstrated with two examples. A new, general routine for cross-interface extrapolation is introduced and used as part of the new interfacial treatment.

The Fascinating World of Graph Theory

Abstract: The fascinating world of graph theory goes back several centuries and revolves around the study of graphsmathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematicsand some of its most famous problems. For example, what is the shortest route for a traveling salesman seeking to visit a number of cities in one trip? What is the least number of colors needed to fill in any map so that neighboring regions are always colored differently? Requiring readers to have a math background only up to high school algebra, this book explores the questions and puzzles that have been studied, and often solved, through graph theory. In doing so, the book looks at graph theorys development and the vibrant individuals responsible for the fields growth. Introducing graph theorys fundamental concepts, the authors explore a diverse plethora of classic problems such as the Lights Out Puzzle, the Minimum Spanning Tree Problem, the Knigsberg Bridge Problem, the Chinese Postman Problem, a Knights Tour, and the Road Coloring Problem. They present every type of graph imaginable, such as bipartite graphs, Eulerian graphs, the Petersen graph, and trees. Each chapter contains math exercises and problems for readers to savor. An eye-opening journey into the world of graphs, this book offers exciting problem-solving possibilities for mathematics and beyond.

Tight Bounds for Graph Problems in Insertion Streams

Abstract: Despite the large amount of work on solving graph problems in the data stream model, there do not exist tight space bounds for almost any of them, even in a stream with only edge insertions. For example, for testing connectivity, the upper bound is O(n * log(n)) bits, while the lower bound is only Omega(n) bits. We remedy this situation by providing the first tight Omega(n * log(n)) space lower bounds for randomized algorithms which succeed with constant probability in a stream of edge insertions for a number of graph problems. Our lower bounds apply to testing bipartiteness, connectivity, cycle-freeness, whether a graph is Eulerian, planarity, H-minor freeness, finding a minimum spanning tree of a connected graph, and testing if the diameter of a sparse graph is constant. We also give the first Omega(n * k * log(n)) space lower bounds for deterministic algorithms for k-edge connectivity and k-vertex connectivity; these are optimal in light of known deterministic upper bounds (for k-vertex connectivity we also need to allow edge duplications, which known upper bounds allow). Finally, we give an Omega(n * log^2(n)) lower bound for randomized algorithms approximating the minimum cut up to a constant factor with constant probability in a graph with integer weights between 1 and n, presented as a stream of insertions and deletions to its edges. This lower bound also holds for cut sparsifiers, and gives the first separation of maintaining a sparsifier in the data stream model versus the offline model.

Finite element modeling of free surface flow in variable porosity media

Abstract: The aim of the present work is to present an overview of some numerical procedures for the simulation of free surface flows within a porous structure. A particular algorithm developed by the authors for solving this type of problems is presented. A modified form of the classical Navier–Stokes equations is proposed, with the principal aim of simulating in a unified way the seepage flow inside rockfill-like porous material and the free surface flow in the clear fluid region. The problem is solved using a semi-explicit stabilized fractional step algorithm where velocity is calculated using a 4th order Runge–Kutta scheme. The numerical formulation is developed in an Eulerian framework using a level set technique to track the evolution of the free surface. An edge-based data structure is employed to allow an easy OpenMP parallelization of the resulting finite element code. The numerical model is validated against laboratory experiments on small scale rockfill dams and is compared with other existing methods for solving similar problems.

On the fractional Eulerian numbers and equivalence of maps with long term power-law memory (integral Volterra equations of the second kind) to Grünvald-Letnikov fractional difference (differential) equations.

Abstract: In this paper, we consider a simple general form of a deterministic system with power-law memory whose state can be described by one variable and evolution by a generating function. A new value of the system's variable is a total (a convolution) of the generating functions of all previous values of the variable with weights, which are powers of the time passed. In discrete cases, these systems can be described by difference equations in which a fractional difference on the left hand side is equal to a total (also a convolution) of the generating functions of all previous values of the system's variable with the fractional Eulerian number weights on the right hand side. In the continuous limit, the considered systems can be described by the Grunvald-Letnikov fractional differential equations, which are equivalent to the Volterra integral equations of the second kind. New properties of the fractional Eulerian numbers and possible applications of the results are discussed.

Schrödinger operators on graphs: Symmetrization and Eulerian cycles

Abstract: Spectral properties of the Schrodinger operator on a finite compact metric graph with delta-type vertex conditions are discussed. Explicit estimates for the lowest eigenvalue (ground state) are obt ...

Verification Benchmarks to Assess the Implementation of Computational Fluid Dynamics Based Hemolysis Prediction Models

Abstract: As part of an ongoing effort to develop verification and validation (V&V) standards for using computational fluid dynamics (CFD) in the evaluation of medical devices, we have developed idealized flow-based verification benchmarks to assess the implementation of commonly cited power-law based hemolysis models in CFD. Verification process ensures that all governing equations are solved correctly and the model is free of user and numerical errors. To perform verification for power-law based hemolysis modeling, analytical solutions for the Eulerian power-law blood damage model (which estimates hemolysis index (HI) as a function of shear stress and exposure time) were obtained for Couette and inclined Couette flow models, and for Newtonian and non-Newtonian pipe flow models. Subsequently, CFD simulations of fluid flow and HI were performed using Eulerian and three different Lagrangian-based hemolysis models and compared with the analytical solutions. For all the geometries, the blood damage results from the Eulerian-based CFD simulations matched the Eulerian analytical solutions within ∼1%, which indicates successful implementation of the Eulerian hemolysis model. Agreement between the Lagrangian and Eulerian models depended upon the choice of the hemolysis power-law constants. For the commonly used values of power-law constants (α = 1.9-2.42 and β = 0.65-0.80), in the absence of flow acceleration, most of the Lagrangian models matched the Eulerian results within 5%. In the presence of flow acceleration (inclined Couette flow), moderate differences (∼10%) were observed between the Lagrangian and Eulerian models. This difference increased to greater than 100% as the beta exponent decreased. These simplified flow problems can be used as standard benchmarks for verifying the implementation of blood damage predictive models in commercial and open-source CFD codes. The current study only used power-law model as an illustrative example to emphasize the need for model verification. Similar verification problems could be developed for other types of hemolysis models (such as strain-based and energy dissipation-based methods). However, since the current study did not include experimental validation, the results from the verified models do not guarantee accurate hemolysis predictions. This verification step must be followed by experimental validation before the hemolysis models can be used for actual device safety evaluations.