Related papers: An algorithmic approach to the multiple impact of …
We present a new, simple, fast algorithm to numerically evolve disks of inelastically colliding particles surrounding a central star. Our algorithm adds negligible computational cost to the fastest existing collisionless N-body codes, and…
Many fundamental challenges in robotics, based in manipulation or locomotion, require making and breaking contact with the environment. To represent the complexity of frictional contact events, impulsive impact models are especially…
We develop a new numerical algorithm to model collisional cascades in debris disks. Because of the large dynamical range in particle masses, we solve the integro-differential equations describing erosive and catastrophic collisions in a…
We have presented some practical consequences on the molecular-dynamics simulations arising from the numerical algorithm published recently in paper Int. J. Mod. Phys. C 16, 413 (2005). The algorithm is not a finite-difference method and…
A general class of nonconvex optimization problems is considered, where the penalty is the composition of a linear operator with a nonsmooth nonconvex mapping, which is concave on the positive real line. The necessary optimality condition…
The break-up of a two-dimensional circular disc by normal and oblique impact on a hard frictionless plate is investigated by molecular dynamics simulations. The disc is composed of numerous unbreakable randomly shaped convex polygons…
Collisions are common in many dynamical systems with real applications. They can be formulated as hybrid dynamical systems with discontinuities automatically triggered when states transverse certain manifolds. We present an algorithm for…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
This paper aims to put forward the concept that learning to take safe actions in unknown environments, even with probability one guarantees, can be achieved without the need for an unbounded number of exploratory trials, provided that one…
The motion of a rigid, spinning disk on a flat surface ends with a dissipation-induced finite-time singularity. The problem of finding the dominant energy absorption mechanism during the last phase of the motion generated a lively debate…
The correct computation of orbits of discrete dynamical systems on the interval is considered. Therefore, an arbitrary-precision floating-point approach based on automatic error analysis is chosen and a general algorithm is presented. The…
We present a cluster kinetic Monte-Carlo algorithm for active matter systems of self-propelled particles with special focus on steric interactions. The kinetic event-chain algorithm is based on the event-chain Monte-Carlo method and is…
We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number…
The dynamics of affective decision making is considered for an intelligent network composed of agents with different types of memory: long-term and short-term memory. The consideration is based on probabilistic affective decision theory,…
An accurate algorithm is proposed to improve the prediction of a particle in collision with a moving wall within the direct simulation Monte Carlo (DSMC) framework for the simulation of unsteady rarefied flows. This algorithm is able to…
The noise generated by the friction of two rough surfaces under weak contact pressure is usually called roughness noise. The underlying vibration which produces the noise stems from numerous instantaneous shocks (in the microsecond range)…
Optimization with nonnegative orthogonality constraints has wide applications in machine learning and data sciences. It is NP-hard due to some combinatorial properties of the constraints. We first propose an equivalent optimization…
Past research on interactive decision making problems (bandits, reinforcement learning, etc.) mostly focuses on the minimax regret that measures the algorithm's performance on the hardest instance. However, an ideal algorithm should adapt…
The optimal control of a mechanical system is of crucial importance in many realms. Typical examples are the determination of a time-minimal path in vehicle dynamics, a minimal energy trajectory in space mission design, or optimal motion…
A simple and reliable algorithm for collision avoidance maneuvers (CAMs), capable of computing impulsive, multi-impulsive, and low-thrust maneuvers, is proposed. The probability of collision (PoC) is approximated by a polynomial of…