Related papers: Octo-Tiger: A New, 3D Hydrodynamic Code for Stella…
Achieving practical quantum speedup with limited resources is a crucial challenge in both academic and industrial communities. To address this, a partially fault-tolerant quantum computing architecture called ``space-time efficient analog…
Higher-order gravitational wave modes from quasi-circular, spinning, non-precessing binary black hole mergers encode key information about these systems' nonlinear dynamics. We model these waveforms using transformer architectures,…
Nested parallelism exists in scientific codes that are searching multi-dimensional spaces. However, implementations of nested parallelism often have overhead and load balance issues. The Orbital Analysis code we present exhibits a sparse…
We present fully general relativistic (GR) simulations of binary white dwarf-neutron star (WDNS) inspiral and merger. The initial binary is in a circular orbit at the Roche critical separation. The goal is to determine the ultimate fate of…
Python's dynamic typing system offers flexibility and expressiveness but can lead to type-related errors, prompting the need for automated type inference to enhance type hinting. While existing learning-based approaches show promising…
Many astrophysical simulations involve extreme dynamic range of timescales around 'special points' in the domain (e.g. black holes, stars, planets, disks, galaxies, shocks, mixing interfaces), where processes on small scales couple strongly…
Upgrades to existing gravitational-wave observatories have the potential to simultaneously constrain the nuclear equation of state and Hubble's constant $H_0$ to percent level with merging neutron star binaries. In practice, performing…
There has been a long history of using ordinary differential equations (ODEs) to understand the dynamics of discrete-time algorithms (DTAs). Surprisingly, there are still two fundamental and unanswered questions: (i) it is unclear how to…
CONTEXT: For more than two decades, stellar atmosphere codes have been used to derive the stellar and wind parameters of massive stars. Although they have become a powerful tool and sufficiently reproduce the observed spectral appearance,…
We describe the first parallel implementation of an adaptive particle-particle, particle-mesh code with smoothed particle hydrodynamics. Parallelisation of the serial code, ``Hydra'', is achieved by using CRAFT, a Cray proprietary language…
We developed a new method to extract halo merger rates from the Millennium Simulation. First, by removing superfluous mergers that are artifacts of the FOF halo finder, we find a lower merger rate compared to previous work. The reductions…
This paper presents Space-Time MultiGrid (STMG) methods which are suitable for performing topology optimisation of transient heat conduction problems. The proposed methods use a pointwise smoother and uniform Cartesian space-time meshes.…
General-relativistic magnetohydrodynamic (GRMHD) simulations have revolutionized our understanding of black hole accretion. Here, we present a graphics processing unit (GPU) accelerated GRMHD code \hammer{} with multi-faceted optimizations…
Despite their unique astrophysical relevance, the outcome of white dwarf binary mergers has so far only been studied for a very restricted number of systems. Here we present the results of a survey with more than two hundred simulations…
Optimally mapping a parallel application to compute and communication resources is increasingly important as both system size and heterogeneity increase. A similar mapping problem exists in gate-based quantum computing where the objective…
We present here a self-consistent cosmological zoom-in simulation of a triple supermassive black hole (SMBH) system forming in a complex multiple galaxy merger. The simulation is run with an updated version of our code KETJU, which is able…
A hybrid-parallel direct-numerical-simulation method with application to turbulent Taylor-Couette flow is presented. The Navier-Stokes equations are discretized in cylindrical coordinates with the spectral Fourier-Galerkin method in the…
This paper considers the problem of distributed optimization over time-varying graphs. For the case of undirected graphs, we introduce a distributed algorithm, referred to as DIGing, based on a combination of a distributed inexact gradient…
We report our new code (named SACRA) for numerical relativity simulations in which an adaptive mesh refinement algorithm is implemented. In this code, the Einstein equations are solved in the BSSN formalism with a fourth-order finite…
We present an algorithm for generating merger histories of dark matter haloes. The algorithm is based on the excursion set approach with moving barriers whose shape is motivated by the ellipsoidal collapse model of halo formation. In…