Related papers: Nemesis: A Multi-Scale, Multi-Physics Algorithm fo…
We show that adaptive time stepping in particle accelerator simulation is an enhancement for certain problems. The new algorithm has been implemented in the OPAL (Object Oriented Parallel Accelerator Library) framework, and is compared to…
Approximate counting via correlation decay is the core algorithmic technique used in the sharp delineation of the computational phase transition that arises in the approximation of the partition function of anti-ferromagnetic two-spin…
The scalability of massively parallel algorithms is a fundamental question in computer science. We study the scalability and the efficiency of a conservative massively parallel algorithm for discrete-event simulations where the discrete…
We introduce Nessie, a galaxy group finder implemented in Rust and distributed as both a Python and R package. Nessie employs the friends-of-friends (FoF) algorithm and requires only on-sky position and redshift as input, making it…
Particle-mesh simulations trade small-scale accuracy for speed compared to traditional, computationally expensive N-body codes in cosmological simulations. In this work, we show how a data-driven model could be used to learn an effective…
Transiting exoplanets in multi-planet systems exhibit non-Keplerian orbits as a result of the gravitational influence from companions which can cause the times and durations of transits to vary. The amplitude and periodicity of the transit…
Many exoplanetary systems are multiplanet configurations whose long-term dynamics are governed by N-body gravitational interactions. Consequently, their detection signatures cannot be adequately described by Keplerian orbits. Accurately…
Hierarchical clustering remains a fundamental challenge in data mining, particularly when dealing with large-scale datasets where traditional approaches fail to scale effectively. Recent Chameleon-based algorithms - Chameleon2, M-Chameleon,…
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Swendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these…
We present an algorithm to efficiently sample the full space of planetary interior density profiles. Our approach uses as few assumptions as possible to pursue an agnostic algorithm. The algorithm avoids the common Markov Chain Monte Carlo…
We use Deutsch's algorithm as a stand in for more complex quantum algorithms in order to determine how quantum properties of an environment manifest themselves in results that can be obtained on quantum computers. We model pure dephasing in…
We discuss statistical techniques for detecting and quantifying bimodality in astronomical datasets. We concentrate on the KMM algorithm, which estimates the statistical significance of bimodality in such datasets and objectively partitions…
We propose a new non-parametric algorithm that can be implemented to study and characterize stellar clusters. The scheme attempts to simultaneously recover the stellar distribution function and the cluster potential by using projected radii…
It is well known that physical phenomena may be of great help in computing some difficult problems efficiently. A typical example is prime factorization that may be solved in polynomial time by exploiting quantum entanglement on a quantum…
We establish a high-resolution, high-performance, and high-confidence compressible multiphysics system in a Cartesian grid with irregular boundary topologies to simulate intensive blast waves propagating in large-scale and extremely complex…
In this paper, the first large-scale application of multiscale-spectral generalized finite element methods (MS-GFEM) to composite aero-structures is presented. The crucial novelty lies in the introduction of A-harmonicity in the local…
Future precision cosmology from large-scale structure experiments including the Dark Energy Spectroscopic Instrument (DESI) and Euclid will probe wider and deeper cosmic volumes than those covered by previous surveys. The Cartesian power…
A real-space formalism for density-functional perturbation theory (DFPT) is derived and applied for the computation of harmonic vibrational properties in molecules and solids. The practical implementation using numeric atom-centered…
In recent years, the infinite time-evolution block decimation (iTEBD) method has been demonstrated to be one of the most efficient and powerful numerical schemes for time-evolution in one-dimensional quantum many-body systems. However, a…
We give a summary of recent results on spatial and velocity biases in cosmological models. Progress in numerical techniques made it possible to simulate halos in large volumes with a such accuracy that halos survive in dense environments of…