Related papers: SWIFT: Fast algorithms for multi-resolution SPH on…
This work presents a new multiphase SPH model that includes the shifting algorithm and a variable smoothing length formalism to simulate multi-phase flows with accuracy and proper interphase management. The implementation was performed in…
Here we report the development of SPRAY, a massively parallel GPU accelerated, smoothed particle hydrodynamics (SPH)-based, radiation hydrodynamics (RHD) code designed specifically for simulating high intensity laser-plasma interactions.…
Basic Smoothed Particle Hydrodynamics (SPH) models exhibit excessive, numerical dissipation in the simulation of water wave propagation. This can be remedied using higher-order approaches such as kernel gradient correction, which introduce…
Online augmentation of an oblique aerial image sequence with structural information is an essential aspect in the process of 3D scene interpretation and analysis. One key aspect in this is the efficient dense image matching and depth…
This work introduces a kernel-independent, multilevel, adaptive algorithm for efficiently evaluating a discrete convolution kernel with a given source distribution. The method is based on linear algebraic tools such as low rank…
Multiscale mixed methods based on non-overlapping domain decompositions can efficiently handle the solution of significant subsurface flow problems in very heterogeneous formations of interest to the industry, especially when implemented on…
Modulating the number of particles in a region is key to accurately capturing the nuances in compressible flows with Smoothed Particle Hydrodynamics (SPH). This paper presents a volume-based adaptive refinement and derefinement procedure,…
I describe a fast algorithm for the identification of connected sets of points where the point-wise connections are determined by a fixed spatial distance - a task commonly referred to in the cosmological simulation community as…
Hypergraphs allow modeling problems with multi-way high-order relationships. However, the computational cost of most existing hypergraph-based algorithms can be heavily dependent upon the input hypergraph sizes. To address the…
We present a novel radiation hydrodynamics code, START, which is a smoothed particle hydrodynamics (SPH) scheme coupled with accelerated radiative transfer. The basic idea for the acceleration of radiative transfer is parallel to the tree…
Contemporary accelerator designs exhibit a high degree of spatial localization, wherein two-dimensional physical distance determines communication costs between processing elements. This situation presents considerable algorithmic…
Smoothed particle hydrodynamics (SPH) has been extensively studied in computer graphics to animate fluids with versatile effects. However, SPH still suffers from two numerical difficulties: the particle deficiency problem, which will…
We describe a simple and fast algorithm for identifying friends-of-friends features and prove its correctness. The algorithm avoids unnecessary expensive neighbor queries, uses minimal memory overhead, and rejects slowdown in high…
Building efficient, accurate and generalizable reduced order models of developed turbulence remains a major challenge. This manuscript approaches this problem by developing a hierarchy of parameterized reduced Lagrangian models for…
We describe a new algorithm for including the dynamical effects of ionizing radiation in SPH simulations, and we present several examples of how the algorithm can be applied to problems in star formation. We use the HEALPix software to…
Diffuse-interface theory provides a foundation for the modeling and simulation of microstructure evolution in a very wide range of materials, and for the tracking/capturing of dynamic interfaces between different materials on larger scales.…
This article describes algorithms for the hybrid parallelization and SIMD vectorization of molecular dynamics simulations with short-range forces. The parallelization method combines domain decomposition with a thread-based parallelization…
Splotch is a rendering algorithm for exploration and visual discovery in particle-based datasets coming from astronomical observations or numerical simulations. The strengths of the approach are production of high quality imagery and…
Silent data corruptions (SDCs) hinder the correctness of long-running scientific applications on large scale computing systems. Selective particle replication (SPR) is proposed herein as the first particle-based replication method for…
The maximal sensitivity of the Smith-Waterman (SW) algorithm has enabled its wide use in biological sequence database search. Unfortunately, the high sensitivity comes at the expense of quadratic time complexity, which makes the algorithm…