Related papers: Reducing the number of redundant pair-wise interac…
Meshless methods approximate operators in a specific node as a weighted sum of values in its neighbours. Higher order approximations of derivatives provide more accurate solutions with better convergence characteristics, but they come at…
The development of an LHC physics analysis involves numerous investigations that require the repeated processing of terabytes of data. Thus, a rapid completion of each of these analysis cycles is central to mastering the science project. We…
Contact interfaces with dry friction are frequently used in turbomachinery. Dry friction damping produced by the sliding surfaces of these interfaces reduces the amplitude of bladed-disk vibration. The relative displacements at these…
The surge of activity in the resolution of fine scale features in the field of earth sciences over the past decade necessitates the development of robust yet simple algorithms that can tackle the various drawbacks of in silico models…
Calculation of near-neighbor interactions among high dimensional, irregularly distributed data points is a fundamental task to many graph-based or kernel-based machine learning algorithms and applications. Such calculations, involving…
We propose two closely--related Lagrangian numerical methods for the simulation of physical processes involving advection, reaction and diffusion. The methods are intended to be used in settings where the flow is nearly incompressible and…
In most of mesh-free methods, the calculation of interactions between sample points or particles is the most time consuming. When we use mesh-free methods with high spatial orders, the order of the time integration should also be high. If…
We describe a newly developed hydrodynamic code for studying accretion disk processes. The numerical method uses a finite volume, nonlinear, Total Variation Diminishing (TVD) scheme to capture shocks and control spurious oscillations. It is…
All-pairs compute problems apply a user-defined function to each combination of two items of a given data set. Although these problems present an abundance of parallelism, data reuse must be exploited to achieve good performance. Several…
A common feature of wall-bounded turbulent particle-laden flows is enhanced particle concentrations in a thin layer near the wall due to a phenomenon known as turbophoresis. Even at relatively low bulk volume fractions, particle-particle…
For the arbitrary-Lagrangian-Eulerian (ALE) calculations, the geometric information needs to be calculated at each time step due to the movement of mesh. To achieve the high-order spatial accuracy, a large number of matrix inversions are…
Common time-explicit numerical methods for kinetic simulations of plasmas in the low-collisions limit fall into two classes of algorithms: momentum conserving and energy conserving. Each has certain drawbacks. The PIC algorithm does not…
We develop a linearly-scaling variant of the Force Coupling Method [K. Yeo and M. R. Maxey, J. Fluid Mech. 649, 205-231 (2010)] for computing hydrodynamic interactions among particles confined to a doubly-periodic geometry with either a…
Empirical evidence suggests that hashing is an effective strategy for dimensionality reduction and practical nonparametric estimation. In this paper we provide exponential tail bounds for feature hashing and show that the interaction…
A new parallel algorithm utilizing partitioned global address space (PGAS) programming model to achieve high scalability is reported for particle tracking in direct numerical simulations of turbulent flow. The work is motivated by the…
A new algorithm for solving large-scale convex optimization problems with a separable objective function is proposed. The basic idea is to combine three techniques: Lagrangian dual decomposition, excessive gap and smoothing. The main…
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…
We present an algorithm for simulating the equations of ideal magnetohydrodynamics and other systems of differential equations on an unstructured set of points represented by sample particles. Local, third-order, least-squares, polynomial…
The purpose of this paper is to propose a time-step-robust cell-to-cell integration of particle trajectories in 3-D unstructured meshes in particle/mesh Lagrangian stochastic methods. The main idea is to dynamically update the mean fields…
We propose a novel approach to charged particle tracking at high intensity particle colliders based on Approximate Nearest Neighbors search. With hundreds of thousands of measurements per collision to be reconstructed e.g. at the High…