Results 1  10
of
463,501
A New Consistent DiscreteVelocity Model for the Boltzmann Equation
"... This paper discusses the convergence of a new discretevelocity model to the Boltzmann equation. First the consistency of the collision integral approximation is proved. Based on this we prove the convergence of solutions for a modied model to DiPernaLions solutions of the Boltzmann equation. As a ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
This paper discusses the convergence of a new discretevelocity model to the Boltzmann equation. First the consistency of the collision integral approximation is proved. Based on this we prove the convergence of solutions for a modied model to DiPernaLions solutions of the Boltzmann equation. As a
CONVOLUTIVE DECOMPOSITION AND FAST SUMMATION METHODS FOR DISCRETEVELOCITY APPROXIMATIONS OF THE BOLTZMANN EQUATION
, 2012
"... Abstract. Discretevelocity approximations represent a popular way for computing the Boltzmann collision operator. The direct numerical evaluation of such methods involve a prohibitive cost, typically O(N 2d+1) where d is the dimension of the velocity space. In this paper, following the ideas introd ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Discretevelocity approximations represent a popular way for computing the Boltzmann collision operator. The direct numerical evaluation of such methods involve a prohibitive cost, typically O(N 2d+1) where d is the dimension of the velocity space. In this paper, following the ideas
A New Consistent DiscreteVelocity Model for the Boltzmann Equation
"... MOS subject classification: 82C40 (76P05, 82C80, 65C20) This paper discusses the convergence of a new discretevelocity model to the Boltzmann equation. First the consistency of the collision integral approximation is proved. Based on this we prove the convergence of solutions for a modified model t ..."
Abstract
 Add to MetaCart
MOS subject classification: 82C40 (76P05, 82C80, 65C20) This paper discusses the convergence of a new discretevelocity model to the Boltzmann equation. First the consistency of the collision integral approximation is proved. Based on this we prove the convergence of solutions for a modified model
A learning algorithm for Boltzmann machines
 Cognitive Science
, 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract

Cited by 586 (13 self)
 Add to MetaCart
problem in o very short time. One kind of computation for which massively porollel networks appear to be well suited is large constraint satisfaction searches, but to use the connections efficiently two conditions must be met: First, a search technique that is suitable for parallel networks must be found
The Theory of Hybrid Automata
, 1996
"... A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied on pur ..."
Abstract

Cited by 680 (13 self)
 Add to MetaCart
A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied
Accuracy of discretevelocity BGK models for the simulation of the incompressible NavierStokes equations
 Comput. Fluids
, 1995
"... Two discretizations of a 9velocity Boltzmann equation with a BGK collision operator are studied. A ChapmanEnskog expansion of the PDE system predicts that the macroscopic behavior corresponds to the incompressible NavierStokes equations with additional terms of order Mach number squared. We intro ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Two discretizations of a 9velocity Boltzmann equation with a BGK collision operator are studied. A ChapmanEnskog expansion of the PDE system predicts that the macroscopic behavior corresponds to the incompressible NavierStokes equations with additional terms of order Mach number squared. We
Algorithms for Quantum Computation: Discrete Logarithms and Factoring
, 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken into consi ..."
Abstract

Cited by 1103 (7 self)
 Add to MetaCart
A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken
Diffusive Relaxation Schemes for DiscreteVelocity Kinetic Equations
 SIAM J. NUM. ANAL
"... Many kinetic models of the Boltzmann equation have a diffusive scaling that leads to the NavierStokes type parabolic equations, such as the heat equation, the porous media equations, the advectiondiffusion equation and the viscous Burgers equation. In such problems the diffusive relaxation paramet ..."
Abstract

Cited by 19 (9 self)
 Add to MetaCart
Many kinetic models of the Boltzmann equation have a diffusive scaling that leads to the NavierStokes type parabolic equations, such as the heat equation, the porous media equations, the advectiondiffusion equation and the viscous Burgers equation. In such problems the diffusive relaxation
Qualitative Simulation
 Artificial Intelligence
, 2001
"... Qualitative simulation predicts the set of possible behaviors... ..."
Abstract

Cited by 513 (31 self)
 Add to MetaCart
Qualitative simulation predicts the set of possible behaviors...
Simulating Physics with Computers
 SIAM Journal on Computing
, 1982
"... 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 of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 601 (1 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 of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration
Results 1  10
of
463,501