Results 1  10
of
45,847
Numerical Solutions of the Euler Equations by Finite Volume Methods Using RungeKutta TimeStepping Schemes
, 1981
"... 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 to deter ..."
Abstract

Cited by 517 (78 self)
 Add to MetaCart
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
Large steps in cloth simulation
 SIGGRAPH 98 Conference Proceedings
, 1998
"... The bottleneck 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 particle ..."
Abstract

Cited by 576 (5 self)
 Add to MetaCart
The bottleneck 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
time step
"... 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 ..."
Abstract
 Add to MetaCart
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 productbased localisation schemes.
RealTime Systems
, 2000
"... Collision avoidance is an important topic in multirobot systems. Existing multirobot 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 timestep) [1, 3, 4], and allow diagonal move between ..."
Abstract

Cited by 602 (11 self)
 Add to MetaCart
Collision avoidance is an important topic in multirobot systems. Existing multirobot 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 timestep) [1, 3, 4], and allow diagonal move
Efficient timestepping scheme for dynamics on
, 2012
"... Efficient timestepping scheme for dynamics on ..."
The Geometry of TimeStepping
 Progress in Electromagnetics Research
, 2001
"... The spacetime geometric structure of Maxwell's equations is examined and a subset of them is found to define a pair of exact discrete timestepping relations. The desirability of adopting an approach to the discretization of electromagnetic problems which exploits this fact is advocated, and t ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
The spacetime geometric structure of Maxwell's equations is examined and a subset of them is found to define a pair of exact discrete timestepping relations. The desirability of adopting an approach to the discretization of electromagnetic problems which exploits this fact is advocated
An Implicit TimeStepping Scheme for Rigid Body Dynamics with Coulomb Friction
 INTERNATIONAL JOURNAL OF NUMERICAL METHODS IN ENGINEERING
, 1996
"... In this paper a new timestepping method for simulating systems of rigid bodies is given. Unlike methods which take an instantaneous point of view, our method is based on impulsemomentum equations, and so does not need to explicitly resolve impulsive forces. On the other hand, our method is distinc ..."
Abstract

Cited by 203 (18 self)
 Add to MetaCart
In this paper a new timestepping method for simulating systems of rigid bodies is given. Unlike methods which take an instantaneous point of view, our method is based on impulsemomentum equations, and so does not need to explicitly resolve impulsive forces. On the other hand, our method
TIMESTEPPING AND PRESERVING ORTHONORMALITY
, 1997
"... Certain applications produce initial value ODEs whose solutions, regarded as timedependent matrices, preserve orthonormality. Such systems arise in the computation of Lyapunov exponents and the construction of smooth singular value decompositions of parametrized matrices. For some special problem c ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
classes, there exist timestepping 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
PolynomialTime Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
 SIAM J. on Computing
, 1997
"... 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. ..."
Abstract

Cited by 1277 (4 self)
 Add to MetaCart
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
Results 1  10
of
45,847