Related papers: A connected component-based method for efficiently…
Cosmological N-Body simulations are used for a variety of applications. Indeed progress in the study of large scale structures and galaxy formation would have been very limited without this tool. For nearly twenty years the limitations…
This report presents an adaptive work-efficient approach for implementing the Connected Components algorithm on GPUs. The results show a considerable increase in performance (up to 6.8$\times$) over current state-of-the-art solutions.
The aim of this work is to quantitatively evaluate the impact of computation on the energy consumption on ARM MPSoC platforms, exploiting CPUs, embedded GPUs and FPGAs. One of them possibly represents the future of High Performance…
A novel finite element method for the approximation of Maxwell's equations over hybrid two-dimensional grids is studied. The choice of appropriate basis functions and numerical quadrature leads to diagonal mass matrices which allow for…
Direct gravitational simulations of n-body systems have a time complexity O(n^2), which gets computationally expensive as the number of bodies increases. Distributing this workload to multiple cores significantly speeds up the computation…
We describe the newly written code GADGET which is suitable both for cosmological simulations of structure formation and for the simulation of interacting galaxies. GADGET evolves self-gravitating collisionless fluids with the traditional…
We present a novel convex formulation that weakly couples the Material Point Method (MPM) with rigid body dynamics through frictional contact, optimized for efficient GPU parallelization. Our approach features an asynchronous time-splitting…
This paper describes the adaptation of a well-scaling parallel algorithm for computing Morse-Smale segmentations based on path compression to a distributed computational setting. Additionally, we extend the algorithm to efficiently compute…
We propose a novel block-row partitioning method in order to improve the convergence rate of the block Cimmino algorithm for solving general sparse linear systems of equations. The convergence rate of the block Cimmino algorithm depends on…
A new approach is developed to integrate numerically the equations of motion for systems of interacting rigid polyatomic molecules. With the aid of a leapfrog framework, we directly involve principal angular velocities into the integration,…
Multiscale mathematical models have shown great promise in computational brain electrophysiology but are still hindered by high computational costs due to fast dynamics and complex brain geometries, requiring very fine spatio-temporal…
One approach for solving interacting many-fermion systems is the configuration-interaction method, also sometimes called the interacting shell model, where one finds eigenvalues of the Hamiltonian in a many-body basis of Slater determinants…
I consider a self-gravitating, N-body system assuming that the N constituents follow regular orbits about the center of mass of the cluster, where a central massive object may be present. I calculate the average over a characteristic…
We have developed a gravity solver based on combining the well developed Particle-Mesh (PM) method and TREE methods. It is designed for and has been implemented on parallel computer architectures. The new code can deal with tens of millions…
This article describes a geometric partitioning software that can be used for quick computation of data partitions on many-core HPC machines. It is most suited for dynamic applications with load distributions that vary with time.…
We introduce a class of fourth order symplectic algorithms that are ideal for doing long time integration of gravitational few-body problems. These algorithms have only positive time steps, but require computing the force gradient in…
(Abridged) We describe a new iterative approach for the realization of equilibrium N-body systems for given density distributions. Our method uses elements of Schwarzschild's technique and of the made-to-measure method, but is based on a…
We present the design and implementation details of a geometric multigrid method on adaptively refined meshes for massively parallel computations. The method uses local smoothing on the refined part of the mesh. Partitioning is achieved by…
We analyze a goal-oriented adaptive algorithm that aims to efficiently compute the quantity of interest $G(u^\star)$ with a linear goal functional $G$ and the solution $u^\star$ to a general second-order nonsymmetric linear elliptic partial…
Larger multi-qubit quantum gates allow shallower, more efficient quantum circuits, which could decrease the prohibitive effect of noise on algorithms for noisy intermediate-scale quantum (NISQ) devices and fault-tolerant error correction…