A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used

The bottle-neck in most cloth simulation systems is that time steps must be small to avoid numerical instability. This paper describes a cloth simulation system that can stably take large time steps. The simulation system couples a new technique for enforcing constraints on individual cloth

error detection in numerical

We propose an ensemble Kalman filter (EnKF) without perturbed observations, referred to as the deterministic EnKF, or DEnKF. DEnKF is asymptotically equivalent to the ensemble square root filter (ESRF) in the case when the analysis correction is small; and readily permits the use of the traditional Schur product-based localisation schemes.

Collision avoidance is an important topic in multi-robot systems. Existing multi-robot pathfinding approaches ignore sideswipe collisions among robots (i.e., only consider the collision which two agents try to occupy the same node during the same time-step) [1, 3, 4], and allow diagonal move

Efficient time-stepping scheme for dynamics on

The space-time geometric structure of Maxwell's equations is examined and a subset of them is found to define a pair of exact discrete time-stepping relations. The desirability of adopting an approach to the discretization of electromagnetic problems which exploits this fact is advocated

In this paper a new time-stepping method for simulating systems of rigid bodies is given. Unlike methods which take an instantaneous point of view, our method is based on impulse-momentum equations, and so does not need to explicitly resolve impulsive forces. On the other hand, our method

classes, there exist time-stepping methods that automatically inherit the orthonormality preservation. However, a more widely applicable approach is to apply a standard integrator and regularly replace the approximate solution by an orthonormal matrix. Typically, the approximate solution is replaced

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration