• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 45,847
Next 10 →

Numerical Solutions of the Euler Equations by Finite Volume Methods Using Runge-Kutta Time-Stepping Schemes

by Antony Jameson, Wolfgang Schmidt, Eli Turkel , 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

by David Baraff, Andrew Witkin - SIGGRAPH 98 Conference Proceedings , 1998
"... 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 particle ..."
Abstract - Cited by 576 (5 self) - Add to MetaCart
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

time-stepping

by unknown authors
"... error detection in numerical ..."
Abstract - Add to MetaCart
error detection in numerical

time step

by A Deterministic, Pavel Sakov, Peter R. Oke, La Denkf, La Enkf, L Enkf
"... 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 product-based localisation schemes.

Real-Time Systems

by Fan Liu, Ajit Narayanan, Quan Bai , 2000
"... 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 between ..."
Abstract - Cited by 602 (11 self) - Add to MetaCart
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

by Boris N. Khoromskij, Ivan V. Oseledets, Reinhold Schneider, I. V. Oseledets, B. N. Khoromskij, R. Schneider , 2012
"... Efficient time-stepping scheme for dynamics on ..."
Abstract - Add to MetaCart
Efficient time-stepping scheme for dynamics on

The Geometry of Time-Stepping

by Claudio Mattiussi - Progress in Electromagnetics Research , 2001
"... 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, and t ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
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

An Implicit Time-Stepping Scheme for Rigid Body Dynamics with Coulomb Friction

by David Stewart, J. C. Trinkle - INTERNATIONAL JOURNAL OF NUMERICAL METHODS IN ENGINEERING , 1996
"... 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 is distinc ..."
Abstract - Cited by 203 (18 self) - Add to MetaCart
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

TIME-STEPPING AND PRESERVING ORTHONORMALITY

by Desmond J. Higham , 1997
"... Certain applications produce initial value ODEs whose solutions, regarded as time-dependent 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 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

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

by Peter W. Shor - 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
Next 10 →
Results 1 - 10 of 45,847
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University