Related papers: REBOUND: An open-source multi-purpose N-body code …

The mapping, exact or approximate, of a many-body problem onto an effective single-body problem is one of the most widely used conceptual and computational tools of physics. Here, we propose and investigate the inverse map of effective…

Restricted three-body codes have a proven ability to recreate much of the disturbed morphology of actual interacting galaxies. As more sophisticated n-body models were developed and computer speed increased, restricted three-body codes fell…

I describe here the performances of a parallel treecode with individual particle timesteps. The code is based on the Barnes-Hut algorithm and runs cosmological N-body simulations on parallel machines with a distributed memory architecture…

Several extensions of the standard cosmological model include scalar fields as new degrees of freedom in the underlying gravitational theory. A particular class of these scalar field theories include screening mechanisms intended to hide…

A fast algorithm to study one-dimensional self-gravitating systems, and, more generally, systems that are Lagrangian integrable between collisions, is presented. The algorithm is event-driven, and uses a heap-ordered set of predicted future…

To more thoroughly study the effects of radiative forces on the orbits of small, astronomical bodies, we introduce the Yarkovsky effect into REBOUNDx, an extensional library for the N-body integrator REBOUND. Two different versions of the…

This paper introduces the Circular Restricted n-Body Problem (CRNBP), an extension of the bicircular restricted four-body problem (BCR4BP) designed to describe the dynamics of an n-body system. In the CRNBP, each massive body in the system…

We introduce a new jet substructure technique called Recursive Soft Drop, which generalizes the Soft Drop algorithm to have multiple grooming layers. Like the original Soft Drop method, this new recursive variant traverses a jet clustering…

Bounding volumes are an established concept in computer graphics and vision tasks but have seen little change since their early inception. In this work, we study the use of neural networks as bounding volumes. Our key observation is that…

We present Swarm-NG, a C++ library for the efficient direct integration of many n-body systems using highly-parallel Graphics Processing Unit (GPU), such as NVIDIA's Tesla T10 and M2070 GPUs. While previous studies have demonstrated the…

Many-body dispersion (MBD) is a powerful framework to treat van der Waals (vdW) dispersion interactions in density-functional theory and related atomistic modeling methods. Several independent implementations of MBD with varying degree of…

Complex natural or engineered systems comprise multiple characteristic scales, multiple spatiotemporal domains, and even multiple physical closure laws. To address such challenges, we introduce an interface learning paradigm and put forth a…

We present and discuss the characteristics and performances, both in term of computational speed and precision, of a numerical code which numerically integrates the equation of motions of N 'particles' interacting via Newtonian gravitation…

In early Solar System numerical simulations, where chaos is a primary driver, it is difficult to explore parameter space in a systematic way. In such simulations, stable configurations are hard to come by, and often require special…

For many mixed-integer programming (MIP) problems, high-quality dual bounds can be obtained either through advanced formulation techniques coupled with a state-of-the-art MIP solver, or through semidefinite programming (SDP) relaxation…

Near-Earth Objects (NEOs) are attractive exploration targets due to their accessibility, scientific value, and resources. Although trajectory design has revealed efficient pathways to these bodies, systematic strategies for Earth-NEO…

In this paper, we describe the implementation and performance of GreeM, a massively parallel TreePM code for large-scale cosmological N-body simulations. GreeM uses a recursive multi-section algorithm for domain decomposition. The size of…

We developed a Keplerian-based Hamiltonian splitting for solving the gravitational $N$-body problem. This splitting allows us to approximate the solution of a general $N$-body problem by a composition of multiple, independently evolved…

We propose an efficient motion planning method designed to efficiently find collision-free trajectories for multiple manipulators. While multi-manipulator systems offer significant advantages, coordinating their motions is computationally…

This work presents ReSync, a Riemannian subgradient-based algorithm for solving the robust rotation synchronization problem, which arises in various engineering applications. ReSync solves a least-unsquared minimization formulation over the…