MIXED VOLUME COMPUTATION IN PARALLEL

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixed Volume Computation in Parallel

Efficient algorithms for computing mixed volumes, via the computation of mixed cells, have been implemented in DEMiCs [18] and MixedVol-2.0 [13]. While the approaches in those two packages are somewhat different, they follow the same theme and are both highly serial. To fit the need for the parallel computing, a reformulation of the algorithms is inevitable. This article proposes a reformulatio...

متن کامل

Mixed Volume Computation, A Revisit

The superiority of the dynamic enumeration of all mixed cells suggested by T. Mizutani et al. for the mixed volume computation over the existing methods was reported in [15]. In this article, we embed the idea of dynamic enumeration into our original algorithm for the mixed volume computation presented in [7], and a new algorithm is developed by employing both primal and dual simplex algorithms...

متن کامل

An Implementation of Exact Mixed Volume Computation

Mixed volumes of lattice polytopes play a central role in numerical and tropical algebraic geometry. We present an implementation of a new algorithm for their computation based on tropical homotopy continuation, which is a combinatorial procedure using ideas from numerical algebraic geometry. While the mathematical aspects of the algorithm are presented elsewhere, here we mainly address technic...

متن کامل

Parallel Volume Computation of Massive Polyhedron Union

We present a parallel implementation of UNION3, an algorithm for computing the volume, surface area, center of mass, or similar properties of a boolean combination of many polyhedra. UNION3 has been implemented on the special case of the union of congruent isothetic cubes, and tested on 100,000,000 cubes. The algorithm uses a volume formula that does not require first computing the explicit uni...

متن کامل

Parallel computation framework for optimizing trailer routes in bulk transportation

We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Taiwanese Journal of Mathematics

سال: 2014

ISSN: 1027-5487

DOI: 10.11650/tjm.18.2014.3276