Searcharxiv⌕ Search

SEARCH · Searcharxiv

Results for “comp-gas”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5Linked to original sources
arXiv1998

Garden of Eden states in traffic models

We investigate the allowed configurations in the stationary state of the cellular automaton model for single-lane traffic. It is found that certain states in the configuration space can not be reached if one uses parallel dynamics. These so-called Garden of Eden (GoE) states do not exist for random-sequential dynamics and are responsible for the strong short-ranged correlations found in parallel dynamics. By eliminating the GoE states we obtain a simple and effective approximative description of the model. For $v_{max}=1$ the exact solution is recovered. For $v_{max}=2$ this elimination leads to much higher values of the flux compared to the mean-field result which are in good agreement with Monte Carlo simulations.

cond-mat.stat-mech↗
arXiv1998

Complexity of Two-Dimensional Patterns

In dynamical systems such as cellular automata and iterated maps, it is often useful to look at a language or set of symbol sequences produced by the system. There are well-established classification schemes, such as the Chomsky hierarchy, with which we can measure the complexity of these sets of sequences, and thus the complexity of the systems which produce them. In this paper, we look at the first few levels of a hierarchy of complexity for two-or-more-dimensional patterns. We show that several definitions of ``regular language'' or ``local rule'' that are equivalent in d=1 lead to distinct classes in d >= 2. We explore the closure properties and computational complexity of these classes, including undecidability and L-, NL- and NP-completeness results. We apply these classes to cellular automata, in particular to their sets of fixed and periodic points, finite-time images, and limit sets. We show that it is undecidable whether a CA in d >= 2 has a periodic point of a given period, and that certain ``local lattice languages'' are not finite-time images or limit sets of any CA. We also show that the entropy of a d-dimensional CA's finite-time image cannot decrease faster than t^{-d} unless it maps every initial condition to a single homogeneous state.

cond-mat↗
arXiv1998

A Lattice Boltzmann Model for Wave and Fracture phenomena

We show that the lattice Boltzmann formalism can be used to describe wave propagation in a heterogeneous media, as well as solid-body-like systems and fracture propagation. Several fundamental properties of real fractures (such as propagation speed and transition between rough and smooth crack surfaces) are well captured by our approach.

cond-mat.stat-mech↗
arXiv1994

Variational description of statistical field theories using Daubechies' wavelets

We investigate the description of statistical field theories using Daubechies' orthonormal compact wavelets on a lattice. A simple variational approach is used to extend mean field theory and make predictions for the fluctuation strengths of wavelet coefficients and thus for the correlation function. The results are compared to Monte Carlo simulations. We find that wavelets provide a reasonable description of critical phenomena with only a small number of variational parameters. This lets us hope for an implementation of the renormalization group in wavelet space.

hep-lat↗
arXiv1995

Hyper-Systolic Parallel Computing

A new class of parallel algorithms is introduced that can achieve a complexity of O(n^3/2) with respect to the interprocessor communication, in the exact computation of systems with pairwise mutual interactions of all elements. Hitherto, conventional methods exhibit a communicational complexity of O(n^2). The amount of computation operations is not altered for the new algorithm which can be formulated as a kind of h-range problem, known from the mathematical field of Additive Number Theory. We will demonstrate the reduction in communicational expense by comparing the standard-systolic algorithm and the new algorithm on the connection machine CM5 and the CRAY T3D. The parallel method can be useful in various scientific and engineering fields like exact n-body dynamics with long range forces, polymer chains, protein folding or signal processing.

hep-lat↗
arXiv1997

A Quantum Lattice-Gas Model for the Many-Particle Schroedinger Equation

We consider a general class of discrete unitary dynamical models on the lattice. We show that generically such models give rise to a wavefunction satisfying a Schroedinger equation in the continuum limit, in any number of dimensions. There is a simple mathematical relationship between the mass of the Schroedinger particle and the eigenvalues of a unitary matrix describing the local evolution of the model. Second quantized versions of these unitary models can be defined, describing in the continuum limit the evolution of a nonrelativistic quantum many-body theory. An arbitrary potential is easily incorporated into these systems. The models we describe fall in the class of quantum lattice gas automata, and can be implemented on a quantum computer with a speedup exponential in the number of particles in the system. This gives an efficient algorithm for simulating general nonrelativistic interacting quantum many-body systems on a quantum computer.

quant-ph↗
arXiv1996

Unitarity in one dimensional nonlinear quantum cellular automata

Unitarity of the global evolution is an extremely stringent condition on finite state models in discrete spacetime. Quantum cellular automata, in particular, are tightly constrained. In previous work we proved a simple No-go Theorem which precludes nontrivial homogeneous evolution for linear quantum cellular automata. Here we carefully define general quantum cellular automata in order to investigate the possibility that there be nontrivial homogeneous unitary evolution when the local rule is nonlinear. Since the unitary global transition amplitudes are constructed from the product of local transition amplitudes, infinite lattices require different treatment than periodic ones. We prove Unitarity Theorems for both cases, expressing the equivalence in $1+1$ dimensions of global unitarity and certain sets of constraints on the local rule, and then show that these constraints can be solved to give a variety of multiparameter families of nonlinear quantum cellular automata. The Unitarity Theorems, together with a Surjectivity Theorem for the infinite case, also imply that unitarity is decidable for one dimensional cellular automata.

quant-ph↗
arXiv1994

Limits to Extensions of Burgers Equation

The vector Burgers equation is extended to include pressure gradients and gravity. It is shown that within the framework of the Cole-Hopf transformation there are no physical solutions to this problem. This result is important because it clearly demonstrates that any extension of Burgers equation to more interesting physical situations is strongly limited.

solv-int↗
arXiv1995

Approximate Lie Group Analysis of a Model Advection Equation on an Unstructured Grid

A technique of ``approximate group analysis'' recently developed by Baikov, Gazizov and Ibragimov is applied to a differential approximation (otherwise referred to as an equivalent differential equation) corresponding to the finite difference approximation of a nonlinear advection equation on unstructured grid. We determine which groups from the infinite variety of groups admitted by a nonlinear advection equation ``survive'' the discretization. The situations arising for different choices of an arbitrary function (local speed of propagation) are also studied.

solv-int↗
arXiv1994

Simulation of Cavity Flow by the Lattice Boltzmann Method

A detailed analysis is presented to demonstrate the capabilities of the lattice Boltzmann method. Thorough comparisons with other numerical solutions for the two-dimensional, driven cavity flow show that the lattice Boltzmann method gives accurate results over a wide range of Reynolds numbers. Studies of errors and convergence rates are carried out. Compressibility effects are quantified for different maximum velocities, and parameter ranges are found for stable simulations. The paper's objective is to stimulate further work using this relatively new approach for applied engineering problems in transport phenomena utilizing parallel computers.

comp-gas↗
arXiv1996

Adaptive Mesh Refinement for Singular Current Sheets in Incompressible Magnetohydrodynamic Flows

The formation of current sheets in ideal incompressible magnetohydrodynamic flows in two dimensions is studied numerically using the technique of adaptive mesh refinement. The growth of current density is in agreement with simple scaling assumptions. As expected, adaptive mesh refinement shows to be very efficient for studying singular structures compared to non-adaptive treatments.

comp-gas↗
arXiv1999

A new discrete velocity method for Navier-Stokes equations

The relation between Latttice Boltzmann Method, which has recently become popular, and the Kinetic Schemes, which are routinely used in Computational Fluid Dynamics, is explored. A new discrete velocity model for the numerical solution of the Navier-Stokes equations for incompressible fluid flow is presented by combining both the approaches. The new scheme can be interpreted as a pseudo-compressibility method and, for a particular choice of parameters, this interpretation carries over to the Lattice Boltzmann Method.

comp-gas↗
arXiv1996

Estimating the Fractal Dimension, K_2-entropy, and the Predictability of the Atmosphere

The series of mean daily temperature of air recorded over a period of 215 years is used for analysing the dimensionality and the predictability of the atmospheric system. The total number of data points of the series is 78527. Other 37 versions of the original series are generated, including ``seasonally adjusted'' data, a smoothed series, series without annual course, etc. Modified methods of Grassberger and Procaccia are applied. A procedure for selection of the ``meaningful'' scaling region is proposed. Several scaling regions are revealed in the ln C(r) versus ln r diagram. The first one in the range of larger ln r has a gradual slope and the second one in the range of intermediate ln r has a fast slope. Other two regions are settled in the range of small ln r. The results lead us to claim that the series arises from the activity of at least two subsystems. The first subsystem is low-dimensional (d_f=1.6) and it possesses the potential predictability of several weeks. We suggest that this subsystem is connected with seasonal variability of weather. The second subsystem is high-dimensional (d_f>17) and its error-doubling time is about 4-7 days. It is found that the predictability differs in dependence on season. The predictability time for summer, winter and the entire year (T_2 approx. 4.7 days) is longer than for transition-seasons (T_2 approx. 4.0 days for spring, T_2 approx. 3.6 days for autumn). The role of random noise and the number of data points are discussed. It is shown that a 15-year-long daily temperature series is not sufficient for reliable estimations based on Grassberger and Procaccia algorithms.

comp-gas↗
arXiv1994

Heat Transfer in Lattice BGK Modeled Fluid

The thermal lattice BGK model is a recently suggested numerical tool which aims to simulate thermohydrodynamic problems. We investigate the quality of the lattice BGK simulation by calculating the temperature profiles in the Couette flow under different Eckert and Mach numbers. A revised lower order model is proposed and the higher order model is proved once again to be advantageous.

comp-gas↗
arXiv1995

Simulating Three-Dimensional Hydrodynamics on a Cellular-Automata Machine

We demonstrate how three-dimensional fluid flow simulations can be carried out on the Cellular Automata Machine 8 (CAM-8), a special-purpose computer for cellular-automata computations. The principal algorithmic innovation is the use of a lattice-gas model with a 16-bit collision operator that is specially adapted to the machine architecture. It is shown how the collision rules can be optimized to obtain a low viscosity of the fluid. Predictions of the viscosity based on a Boltzmann approximation agree well with measurements of the viscosity made on CAM-8. Several test simulations of flows in simple geometries -- channels, pipes, and a cubic array of spheres -- are carried out. Measurements of average flux in these geometries compare well with theoretical predictions.

chao-dyn↗
arXiv1995

An Euler Solver Based on Locally Adaptive Discrete Velocities

A new discrete-velocity model is presented to solve the three-dimensional Euler equations. The velocities in the model are of an adaptive nature---both the origin of the discrete-velocity space and the magnitudes of the discrete-velocities are dependent on the local flow--- and are used in a finite volume context. The numerical implementation of the model follows the near-equilibrium flow method of Nadiga and Pullin [1] and results in a scheme which is second order in space (in the smooth regions and between first and second order at discontinuities) and second order in time. (The three-dimensional code is included.) For one choice of the scaling between the magnitude of the discrete-velocities and the local internal energy of the flow, the method reduces to a flux-splitting scheme based on characteristics. As a preliminary exercise, the result of the Sod shock-tube simulation is compared to the exact solution.

comp-gas↗
arXiv1995

Cellular automaton model of precipitation/dissolution coupled with solute transport

Precipitation/dissolution reactions coupled with solute transport are modelled as a cellular automaton in which solute molecules perform a random walk on a regular lattice and react according to a local probabilistic rule. Stationary solid particles dissolve with a certain probability and, provided solid is already present or the solution is saturated, solute particles have a probability to precipitate. In our simulation of the dissolution of a solid block inside uniformly flowing water we obtain solid precipitation downstream from the original solid edge, in contrast to the standard reaction-transport equations. The observed effect is the result of fluctuations in solute density and diminishes when we average over a larger ensemble. The additional precipitation of solid is accompanied by a substantial reduction in the relatively small solute concentration. The model is appropriate for the study of the rôle of intrinsic fluctuations in the presence of reaction thresholds and can be employed to investigate porosity changes associated with the carbonation of cement.

comp-gas↗