相关论文: GPU parallel simulation algorithm of Brownian part…

This paper presents a heuristic for finding the optimum number of CUDA streams by using tools common to the modern AI-oriented approaches and applied to the parallel partition algorithm. A time complexity model for the GPU realization of…

Tensor network algorithms can efficiently simulate complex quantum many-body systems by utilizing knowledge of their structure and entanglement. These methodologies have been adapted recently for solving the Navier-Stokes equations, which…

Quantum computing holds great potential to accelerate the process of solving complex combinatorial optimization problems. The Distributed Quantum Approximate Optimization Algorithm (DQAOA) addresses high-dimensional, dense problems using…

The convex hull is a fundamental geometrical structure for many applications where groups of points must be enclosed or represented by a convex polygon. Although efficient sequential convex hull algorithms exist, and are constantly being…

A framework for performant Brownian Dynamics (BD) many-body simulations with adaptive timestepping is presented. Contrary to the Euler-Maruyama scheme in common non-adaptive BD, we employ an embedded Heun-Euler integrator for the…

We demonstrate a GPU-accelerated nested sampling framework for efficient high-dimensional Bayesian inference in cosmology. Using JAX-based neural emulators and likelihoods for cosmic microwave background and cosmic shear analyses, our…

We present a simple modification of the direct-forcing immersed boundary method (IBM) proposed by Uhlmann [J. Comput. Phys, 2005] in order to enable it to be applied to particulate flows with solid-to-fluid density ratios around unity. The…

The conservative Post-Newtonian (PN) Hamiltonian formulation of spinning compact binaries has six integrals of motion including the total energy, the total angular momentum and the constant unit lengths of spins. The manifold correction…

In this work, we present a high-fidelity and efficient point-particle direct numerical simulation framework based on a multi-block overset curvilinear grid system, enabling large-scale Lagrangian particle tracking in complex geometries with…

A highly adaptive load balancing algorithm for parallel simulations using particle methods, such as molecular dynamics and smoothed particle hydrodynamics (SPH), is developed. Our algorithm is based on the dynamic spatial decomposition of…

Decoupling approach presents a novel solution/alternative to the highly time-consuming fluid-thermal-structural simulation procedures when thermal effects and resultant displacements on machine tools are analyzed. Using high dimensional…

Dense suspensions of solid particles in viscous liquid are ubiquitous in both industry and nature, and there is a clear need for efficient numerical routines to simulate their rheology and microstructure. Particles of micron size present a…

This paper presents some of our findings on the scalability of parallel 3D mesh generation on distributed memory machines. The primary objective of this study was to evaluate a distributed memory approach for implementing a 3D parallel…

Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay triangulation. The technique has been researched extensively for full dimensional triangulations of point sets. However, an important case of…

The Immersed Boundary Method (IBM) is one of the popular one-fluid mixed Eulerian-Lagrangian methods to simulate motion of droplets. While the treatment of a moving complex boundary is an extremely time consuming and formidable task in a…

With a view toward addressing the explosive growth in the computational demands of nuclear structure and reactions modeling, we develop a novel quantum algorithm for neutron-nucleus simulations with general potentials, which provides…

The evolution of an initially prepared distribution of micron sized colloidal particles, trapped at a fluid interface and under the action of their mutual capillary attraction, is analyzed by using Brownian dynamics simulations. At a…

Systems comprised of self-steering active Brownian particles are studied via simulations for a minimal cognitive flocking model. The dynamics of the active Brownian particles is extended by an orientational response with limited…

We present a computational framework for modeling large-scale particle-laden flows in complex domains with the goal of enabling simulations in medical-image derived patient specific geometries. The framework is based on a volume-filtered…

We propose a highly parallel primal-dual algorithm for the multicut (a.k.a. correlation clustering) problem, a classical graph clustering problem widely used in machine learning and computer vision. Our algorithm consists of three steps…