Related papers: Heap-based algorithm for one-dimensional particle …
We present high-order variational Lagrangian finite element methods for compressible fluids using a discrete energetic variational approach. Our spatial discretization is mass/momentum/energy conserving and entropy stable. Fully implicit…
We consider Lagrangian duality based approaches to design and analyze algorithms for online energy-efficient scheduling. First, we present a primal-dual framework. Our approach makes use of the Lagrangian weak duality and convexity to…
We describe a new method (HOP) for identifying groups of particles in N-body simulations. Having assigned to every particle an estimate of its local density, we associate each particle with the densest of the N_hop particles nearest to it.…
Hamiltonian systems with linearly dependent constraints (irregular systems), are classified according to their behavior in the vicinity of the constraint surface. For these systems, the standard Dirac procedure is not directly applicable.…
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, and consequently, makes the air pollution enhance.…
We propose a method to organize experimental data from particle collision experiments in a general format which can enable a simple visualisation and effective classification of collision data using machine learning techniques. The method…
One exact and two heuristic algorithms for determining the generators, orbits and order of the graph automorphism group are presented. A basic tool of these algorithms is the well-known individualization and refinement procedure. A search…
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the…
In this paper, we propose the first optimum process scheduling algorithm for an increasingly prevalent type of heterogeneous multicore (HEMC) system that combines high-performance big cores and energy-efficient small cores with the same…
We present a quantum algorithm to achieve higher-order transformations of Hamiltonian dynamics. Namely, the algorithm takes as input a finite number of queries to a black-box seed Hamiltonian dynamics to simulate a desired Hamiltonian. Our…
Explorable heap selection is the problem of selecting the $n$th smallest value in a binary heap. The key values can only be accessed by traversing through the underlying infinite binary tree, and the complexity of the algorithm is measured…
A general framework for performing event-driven simulations of systems with semi-flexible or rigid bodies interacting under impulsive torques and forces is outlined. Two different approaches are presented. In the first, the dynamics and…
We study an interacting particle system of a finite number of labelled particles on the integer lattice, in which particles have intrinsic masses and left/right jump rates. If a particle is the minimal-label particle at its site when it…
Symplectic N-body integrators are widely used to study problems in celestial mechanics. The most popular algorithms are of 2nd and 4th order, requiring 2 and 6 substeps per timestep, respectively. The number of substeps increases rapidly…
We describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list…
With the increasing size of datasets and demand for real time response for interactive applications, improving runtime for algorithms with excessive computational requirements has become increasingly important. Many different algorithms…
Relational events are a type of social interactions, that sometimes are referred to as dynamic networks. Its dynamics typically depends on emerging patterns, so-called endogenous variables, or external forces, referred to as exogenous…
A new algorithm for numerical integration of the rigid-body equations of motion is proposed. The algorithm uses the leapfrog scheme and the quantities involved are angular velocities and orientational variables which can be expressed in…
High-order phenomena play crucial roles in many systems of interest, but their analysis is often highly nontrivial. There is a rich literature providing a number of alternative information-theoretic quantities capturing high-order…
The paper presents necessary and sufficient conditions for the order reduction of optimal control systems. Exploring the corresponding Hamiltonian system allows to solve the order reduction problem in terms of dynamical systems,…