Publications (9)
An algebraic multigrid method for mixed discretizations of the Navier-Stokes equations
Andrey Prokopenko, Raymond S. Tuminaro
Algebraic multigrid (AMG) preconditioners are considered for discretized systems of partial differential equations (PDEs) where unknowns associated with different physical quantiti…
A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs
Andrey Prokopenko, Piyush Sao, Damien Lebrun-Grandié
Computing the Euclidean minimum spanning tree (EMST) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing…
Cosmological Hydrodynamics at Exascale: A Trillion-Particle Leap in Capability
Nicholas Frontiere, J. D. Emberson, Michael Buehlmann +10
Resolving the most fundamental questions in cosmology requires simulations that match the scale, fidelity, and physical complexity demanded by next-generation sky surveys. To achie…
Automated Fortran--C++ Bindings for Large-Scale Scientific Applications
Seth R. Johnson, Andrey Prokopenko, Katherine J. Evans
Although many active scientific codes use modern Fortran, most contemporary scientific software "libraries" are implemented in C and C++. Providing their numerical, algorithmic, or…
Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
Andrey Prokopenko, Damien Lebrun-Grandié
Stackless traversal is a technique to speed up range queries by avoiding usage of a stack during the tree traversal. One way to achieve that is to transform a given binary tree to…
Fast tree-based algorithms for DBSCAN for low-dimensional data on GPUs
Andrey Prokopenko, Damien Lebrun-Grandie, Daniel Arndt
DBSCAN is a well-known density-based clustering algorithm to discover arbitrary shape clusters. While conceptually simple in serial, the algorithm is challenging to efficiently par…