Related papers: Multi-sphere approximation of realistic particles …
We study the maximum set coverage problem in the massively parallel model. In this setting, $m$ sets that are subsets of a universe of $n$ elements are distributed among $m$ machines. In each round, these machines can communicate with each…
As a fundamental topic in graph mining, Densest Subgraph Discovery (DSD) has found a wide spectrum of real applications. Several DSD algorithms, including exact and approximation algorithms, have been proposed in the literature. However,…
This article presents a new force model for performing quantitative simulations of dense granular materials. Interactions between multiple contacts (MC) on the same grain are explicitly taken into account. Our readily applicable method…
The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution…
In this manuscript we investigate the capabilities of the Discrete Dipole Approximation (DDA) to simulate scattering from particles that are much larger than the wavelength of the incident light, and describe an optimized publicly available…
The most difficult aspect of the realistic modeling of granular materials is how to capture the real shape of the particles. Here we present a method to simulate granular materials with complex-shaped particles. The particle shape is…
Development of algorithms and growth of computational resources in the past decades have enabled simulations of sediment transport processes with unprecedented fidelities. The Computational Fluid Dynamics--Discrete Element Method (CFD--DEM)…
The increasing use of microfluidics in industrial, biomedical, and clinical applications requires a more and more precise control of the microfluidic flows and suspended particles or cells. This leads to higher demands in three-dimensional…
In the dynamic set cover problem, the input is a dynamic universe of elements and a fixed collection of sets. As elements are inserted or deleted, the goal is to efficiently maintain an approximate minimum set cover. While the past decade…
The idea of using fragment embedding to circumvent the high computational scaling of accurate electronic structure methods while retaining high accuracy has been a long-standing goal for quantum chemists. Traditional fragment embedding…
Questions surrounding the spatial disposition of particles in various condensed-matter systems continue to pose many theoretical challenges. This paper explores the geometric availability of amorphous many-particle configurations that…
Spherical symmetry is ubiquitous in nature. It's therefore unfortunate that spherical system simulations are so hard, and require complete spheres with millions of interacting particles. Here we introduce an approach to model spherical…
A 3D point cloud is often synthesized from depth measurements collected by sensors at different viewpoints. The acquired measurements are typically both coarse in precision and corrupted by noise. To improve quality, previous works denoise…
In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor…
We explore the potential of our novel triaxial modeling machinery in recovering the viewing angles, the shape and the orbit distribution of galaxies by using a high-resolution $N$-body merger simulation. Our modelling technique includes…
When the effects of relative motion at the solid object interfaces are not negligible, the contact method is required in the smoothed particle hydrodynamics (SPH) method to prevent virtual shear and tensile stresses. However, there is still…
This study addresses the challenge of simulating realistic particle systems by proposing a novel particle decomposition scheme that improves the parallel performance of surface resolved particle simulations. Realistic particle systems often…
We describe a parallel approximation algorithm for maximizing monotone submodular functions subject to hereditary constraints on distributed memory multiprocessors. Our work is motivated by the need to solve submodular optimization problems…
Reduced bases have been introduced for the approximation of parametrized PDEs in applications where many online queries are required. Their numerical efficiency for such problems has been theoretically confirmed in \cite{BCDDPW,DPW}, where…
Computational fluid dynamics and discrete element method (CFD-DEM) coupling is an efficient and powerful tool to simulate particle-fluid systems. However, current volume-averaged CFD-DEM relying on direct grid-based mapping between the…