Related papers: Solving Kinetic Equations on GPUs I: Model Kinetic…
We propose a gradient-based method for quadratic programming problems with a single linear constraint and bounds on the variables. Inspired by the GPCG algorithm for bound-constrained convex quadratic programming [J.J. Mor\'e and G.…
Computation of bounding boxes is a fundamental problem in high performance rendering, as it is an input to visibility culling and binning operations. In a scene description structured as a tree, clip nodes and blend nodes entail…
Quantum computing holds great promise to accelerate scientific computations in fluid dynamics and other classical physical systems. While various quantum algorithms have been proposed for linear flows, developing quantum algorithms for…
In this paper, the discontinuous Galerkin based high-order gas-kinetic schemes (DG-HGKS) are developed for the three-dimensional Euler and Navier-Stokes equations. Different from the traditional discontinuous Galerkin (DG) methods with…
We present the GPU implementation of the general-purpose interior-point solver Clarabel for convex optimization problems with conic constraints. We introduce a mixed parallel computing strategy that processes linear constraints first, then…
Hydrodynamics calculations have been successfully used in studies of the bulk properties of the Quark-Gluon Plasma, particularly of elliptic flow and shear viscosity. However, there are areas (for instance event-by-event simulations for…
We develop a multi-dimensional hybrid discontinuous Galerkin method for multi-scale kinetic equations. This method is based on moment realizability matrices, a concept introduced by D. Levermore, W. Morokoff and B. Nadiga for one…
We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds $C_1$ and $C_2$ in a compact…
We have developed dynamic manifold solutions for the Navier-Stokes equations using an extension of differential geometry called the calculus for moving surfaces. Specifically, we have shown that the geometric solutions to the Navier-Stokes…
Kinetic or Boltzmann schemes are interesting alternatives to the macroscopic numerical methods for solving the hyperbolic conservation laws of gas dynamics. They utilize the particle-based description instead of the wave propagation models.…
Writing high performance solvers for engineering applications is a delicate task. These codes are often developed on an application to application basis, highly optimized to solve a certain problem. Here, we present our work on developing a…
A multiscale approach for fluid flow is developed that retains an atomistic description in key regions. The method is applied to a classic problem where all scales contribute: The force on a moving wall bounding a fluid-filled cavity.…
Is it possible to solve Boltzmann-type kinetic equations using only a small number of particles velocities? We introduce a novel techniques of solving kinetic equations with (arbitrarily) large number of particle velocities using only a…
This work presents the development, performance analysis and subsequent optimization of a GPU-based spectral hyperviscosity solver for turbulent flows described by the three dimensional incompressible Navier-Stokes equations. The method…
In a recent paper we presented a new ultra efficient numerical method for solving kinetic equations of the Boltzmann type (G. Dimarco, R. Loubere, Towards an ultra efficient kinetic scheme. Part I: basics on the 689 BGK equation, J. Comp.…
We propose a continuous optimization method for solving dense 3D scene flow problems from stereo imagery. As in recent work, we represent the dynamic 3D scene as a collection of rigidly moving planar segments. The scene flow problem then…
An efficient algorithm for computing the terms appearing in the Generalised Kolmogorov Equation (GKE) written for the indefinite plane channel flow is presented. The algorithm, which features three distinct strategies for parallel…
In this paper, we give a quantum algorithm which solves collision problem in an expected polynomial time. Especially, when the function is two-to-one, we present a quantum algorithm which can find a collision with certainty in a worst-case…
We study a stochastically perturbed mean curvature flow for graphs in $\mathbb{R}^3$ over the two-dimensional unit-cube subject to periodic boundary conditions. In particular, we establish the existence of a weak martingale solution. The…
Design considerations for molecular dynamics algorithms capable of taking advantage of the computational power of a graphics processing unit (GPU) are described. Accommodating the constraints of scalable streaming-multiprocessor hardware…