Related papers: SWIFT: Fast algorithms for multi-resolution SPH on…
We describe a simple method for simulating the dynamics of small grains in a dusty gas, relevant to micron-sized grains in the interstellar medium and grains of centimetre size and smaller in protoplanetary discs. The method involves…
This work presents the mathematical and computational aspects of a smooth dissipative particle dynamics with dynamic virtual particle allocation method (SDPD-DV) for modeling and simulation of mesoscopic fluids in wall-bounded domains. The…
We present a novel approach to accelerate astrophysical hydrodynamical simulations. In astrophysical many-body simulations, GRAPE (GRAvity piPE) system has been widely used by many researchers. However, in the GRAPE systems, its function is…
We give a new algorithm that quickly finds smooth neighbors.
We study a distributed framework for stochastic optimization which is inspired by models of collective motion found in nature (e.g., swarming) with mild communication requirements. Specifically, we analyze a scheme in which each one of $N >…
With meshfree and fully Lagrangian features of particle methods, smoothed particle hydrodynamics (SPH) is suitable to achieve high-accurate simulations of multiphase flows with large interfacial deformations, discontinuities, and…
The smoothed particle hydrodynamics (SPH) method has been widely used to simulate incompressible and slightly compressible fluid flows. Adaptive refinement strategies to dynamically increase the resolution of the particles to capture sharp…
This article describes a geometric partitioning software that can be used for quick computation of data partitions on many-core HPC machines. It is most suited for dynamic applications with load distributions that vary with time.…
We describe a new method to accelerate neighbor searches on GRAPE, i.e. a special purpose hardware that efficiently calculates gravitational forces and potentials in $N$-body simulations. In addition to the gravitational calculations, GRAPE…
Graph mining analyzes real-world graphs to find core substructures (connected subgraphs) in applications modeled as graphs. Substructure discovery is a process that involves identifying meaningful patterns, structures, or components within…
Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation when processing graphs on a parallel computer. When a topology of a distributed system is known an important task…
We present preliminary results from recent high-resolution double-degenerate merger simulations with the Smooth Particle Hydrodynamics (SPH) technique. We put particular emphasis on verification and validation in our effort and show the…
Smoothed particle hydrodynamics (SPH) method has been increasingly used for simulating fluid flows, however its ability to simulate evaporating flow requires significant improvements. This paper proposes an SPH method for evaporating…
We describe and demonstrate a method for increasing the resolution locally in a Smoothed Particle Hydrodynamic (SPH) simulation, by splitting particles. We show that in simulations of self-gravitating collapse (of the sort which are…
We present a new algorithm for simulating two-fluid gas and dust mixtures in Smoothed Particle Hydrodynamics (SPH), systematically addressing a number of key issues including the generalised SPH density estimate in multi-fluid systems, the…
Similarity search is a key to a variety of applications including content-based search for images and video, recommendation systems, data deduplication, natural language processing, computer vision, databases, computational biology, and…
Generating intelligent robot behavior in contact-rich settings is a research problem where zeroth-order methods currently prevail. Developing methods that make use of first/second order information about rigid-body dynamics in the presence…
The current state of the art of Simultaneous Localisation and Mapping, or SLAM, on low power embedded systems is about sparse localisation and mapping with low resolution results in the name of efficiency. Meanwhile, research in this field…
We propose a novel application of coded computing to the problem of the nearest neighbor estimation using MatDot Codes [Fahim. et.al. 2017], that are known to be optimal for matrix multiplication in terms of recovery threshold under storage…
Previously, we have proposed a direct simulation scheme for colloidal dispersions in a Newtonian solvent [Phys.Rev.E 71,036707 (2005)]. An improved formulation called the ``Smoothed Profile (SP) method'' is presented here in which…