نتایج جستجو برای: dipolar hard ellipsoids

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

Journal: :Int. J. Comput. Geometry Appl. 2000
Kenji Shimada Atsushi Yamada Takayuki Itoh

This paper describes a new computational method of fully automated anisotropic triangulation of a trimmed parametric surface. Given as input: (1) a domain geometry and (2) a 3 x 3 tensor field that specifies a desired anisotropic node-spacing, this new approach first packs ellipsoids closely in the domain by defining proximity-based interacting forces among the ellipsoids and finding a force-ba...

1996
Kenji Shimada Atsushi Yamada

This paper describes a new computational method of fully automated anisotropic triangulation of a trimmed parametric surface. Given as input: (1) a domain geometry and (2) a 3 x 3 tensor eld that speciies a desired anisotropic node-spacing, this new approach rst packs ellipsoids closely in the domain by deening proximity-based interacting forces among the ellipsoids and nding a force-balancing ...

2013
Hassan Masoud Howard A. Stone Michael J. Shelley

We study theoretically the dynamics of porous ellipsoids rotating in simple shear flows. We use the Brinkman–Debye–Bueche (BDB) model to simulate flow within and through particles and solve the coupled Stokes–BDB equations to calculate the overall flow field and the rotation rate of porous ellipsoids. Our results show that the permeability has little effect on the rotational behaviour of partic...

2008
Lahcen Assoud René Messina Hartmut Löwen

The phase diagram of binary mixtures of particles interacting via a pair potential of parallel dipoles is computed at zero temperature as a function of composition and the ratio of their magnetic susceptibilities. Using lattice sums, a rich variety of different stable crystalline structures is identified including AmBn structures. [A (B) particles correspond to large (small) dipolar moments.] T...

Journal: :Math. Program. 2010
Simai He Zhening Li Shuzhong Zhang

In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such optimization models have wide applications, e.g., in signal processing, magnetic resonance imaging (MRI), data training, approximation theory, and portfolio selection. Since polynomial functions are nonconvex in general, t...

Journal: :The Journal of chemical physics 2009
Kenneth C Millett Patrick Plunkett Michael Piatek Eric J Rawdon Andrzej Stasiak

We simulate freely jointed chains to investigate how knotting affects the overall shapes of freely fluctuating circular polymeric chains. To characterize the shapes of knotted polygons, we construct enveloping ellipsoids that minimize volume while containing the entire polygon. The lengths of the three principal axes of the enveloping ellipsoids are used to define universal size and shape descr...

2004
Leehter Yao Kuei-Song Weng Cherng-Dir Huang

A fuzzy classifier using multiple ellipsoids approximating decision regions for classification is to be designed in this paper. An algorithm called Gustafson-Kessel algorithm (GKA) with an adaptive distance norm based on covariance matrices of prototype data points is adopted to learn the ellipsoids. GKA is able to adapt the distance norm to the underlying distribution of the prototype data poi...

2008
Simonetta Abenda

The closedness condition for real geodesics on n–dimensional ellipsoids is in general transcendental in the parameters (semiaxes of the ellipsoid and constants of motion). We show that it is algebraic in the parameters if and only if both the real and the imaginary geodesics are closed and we characterize such double–periodicity condition via real hyperelliptic tangential coverings. We prove th...

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

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