نتایج جستجو برای: incompressibility

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

Journal: :Comput. Graph. Forum 2012
Xiaowei He Ning Liu Sheng Li Hongan Wang Guoping Wang

Enforcing fluid incompressibility is one of the time-consuming aspects in SPH. In this paper, we present a local Poisson SPH (LPSPH) method to solve incompressibility for particle based fluid simulation. Considering the pressure Poisson equation, we first convert it into an integral form, and then apply a discretization to convert the continuous integral equation to a discretized summation over...

2001
Torsten Rohlfing Calvin R. Maurer

A major problem with non-rigid image registration techniques in many applications is their tendency to reduce the volume of contrast-enhancing structures [10]. Contrast enhancement is an intensity inconsistency, which is precisely what intensity-based registration algorithms are designed to minimize. Therefore, contrast-enhanced structures typically shrink substantially during registration, whi...

2003
N. A. Kampanis J. A. Ekaterinaris Nikolaos A. Kampanis John A. Ekaterinaris

A high-order accurate method for the numerical solution of the incompressible Navier-Stokes equations is developed. Fourth–order, explicit, finite difference schemes on staggered grids are used for space discretization. The explicit, fourth–order Runge–Kutta method is used for time marching. Incompressibility is enforce for each Runge–Kutta stage either by a local pressure correction, which is ...

2009
Joris Degroote Abigail Swillens Peter Bruggeman Robby Haelterman Patrick Segers Jan Vierendeels

Partitioned fluid-structure interaction simulations of the arterial system are difficult due to the incompressibility of the fluid and the shape of the domain. The interface artificial compressibility method (IAC) mitigates the incompressibility constraint by adding a source term to the continuity equation in the fluid domain adjacent to the fluid-structure interface. This source term imitates ...

2001
Pradip Kumar Sahu Akira Ohnishi

We discuss the SU(2) chiral sigma model in the context of nuclear matter using a mean field approach at high density. In this model we include a dynamically generated isoscalar vector field and higher-order terms in the scalar field. With the inclusion of these, we reproduce the empirical values of the nuclear matter saturation density, binding energy, and nuclear incompressibility. The value o...

2001
K. C. Chung

The extraction of nuclear matter properties from measured nuclear masses is investigated in the energy density functional formalism of nuclei. It is shown that the volume energy a1 and the nuclear incompressibility K0 depend essentially on μnN + μpZ − 2EN , whereas the symmetry energy J and the density symmetry coefficient L as well as symmetry incompressibility Ks depend essentially on μn − μp...

Journal: :IACR Cryptology ePrint Archive 2011
Jingguo Bi Qi Cheng

Finding the shortest vector of a lattice is one of the most important problems in computational lattice theory. For a random lattice, one can estimate the length of the shortest vector using the Gaussian heuristic. However, no rigorous proof can be provided for some classes of lattices, as the Gaussian heuristic may not hold for them. In the paper we study two types of random lattices in crypto...

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

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