Similar Search Results

Moore, Cristopher - Santa Fe Institute - 1999

We calculate the generating functions for the number of tilings of rectangles of various widths by the right tromino …, the L tetromino, and the T tetromino. This allows us to place lower bounds on the entropy of tilings of the plane by each …

Persistent link: https://www.econbiz.de/10005790897

Hard Tiling Problems with Simple Tiles

Moore, Cristopher; Robson, John Michael - Santa Fe Institute - 2000

It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right tromino alone. In the process, we show tthat Monotone 1-in-3...

Persistent link: https://www.econbiz.de/10005791014

Convergency of the Monte Carlo algorithms for linear transport modeling1This work was supported by the Ministry of Science, Education and Technology of Bulgaria under grants # I501/95 MM449/94 as well as by EC under INCO-COPERNICUS Project 960237-STABLE.1

Nedjalkov, M.; Dimov, I. - In: Mathematics and Computers in Simulation (MATCOM) 47 (1998) 2, pp. 383-390

We consider the convergency of the basic Monte Carlo (MC) algorithms for solving the Boltzmann transport equation (BTE). It is a linear kinetic equation describing a broad class of particle transport phenomena such as electron and neutron transport, radiative transfer, medium energy electron and...

Persistent link: https://www.econbiz.de/10010748844

Excited states by quantum Monte Carlo method

Blume, D.; Lewerenz, M.; Whaley, K.B. - In: Mathematics and Computers in Simulation (MATCOM) 47 (1998) 2, pp. 133-141

We present applications of a new Monte Carlo algorithm for the calculation of excited state energies of multi-dimensional quantum systems. The method relies on computation of imaginary time correlation functions of appropriately chosen projection operators, followed by a numerical inverse...

Persistent link: https://www.econbiz.de/10010748907

Parallel resolvent Monte Carlo algorithms for linear algebra problems

Dimov, I.; Alexandrov, V.; Karaivanova, A. - In: Mathematics and Computers in Simulation (MATCOM) 55 (2001) 1, pp. 25-35

In this paper, we consider Monte Carlo (MC) algorithms based on the use of the resolvent matrix for solving linear algebraic problems. Estimates for the speedup and efficiency of the algorithms are presented. Some numerical examples performed on cluster of workstations using MPI are given.

Persistent link: https://www.econbiz.de/10010749272

From Monte Carlo to quantum computation

Heinrich, Stefan - In: Mathematics and Computers in Simulation (MATCOM) 62 (2003) 3, pp. 219-230

Quantum computing was so far mainly concerned with discrete problems. Recently, Novak and the author studied quantum algorithms for high dimensional integration and dealt with the question, what advantages quantum computing can bring over classical deterministic or randomized methods for this...

Persistent link: https://www.econbiz.de/10010749616

Monte Carlo algorithms for stationary device simulations

Nedjalkov, M.; Kosina, H.; Selberherr, S. - In: Mathematics and Computers in Simulation (MATCOM) 62 (2003) 3, pp. 453-461

The stochastic method used to simulate the stationary transport in semiconductor devices is revised in terms of the numerical Monte Carlo theory. A mathematically based approach has been used to derive the basic simulation algorithms, previously devised from physical considerations. The approach...

Persistent link: https://www.econbiz.de/10010750167

A revealed preference theory of monotone choice and strategic complementarity

Quah, John K.-H.; Shirai, Koji - Institute of Economic Research, Kyoto University - 2015

We carry out a revealed preference analysis of monotone comparative statics. We ask what restrictions on an agent's observed choice behavior are necessary and sufficient to rationalize the data with a preference guaranteeing that choices are always monotone with re- spect to a parameter. We...

Persistent link: https://www.econbiz.de/10011185953

Comparative Statics with Concave and Supermodular Functions

Quah, John - Department of Economics, Oxford University - 2004

Certain problems in comparative statics, including (but not exclusively) certain problems in consumer theory, cannot be easily addressed by the methods of lattice programming. One reason for this is that there is no order on the choice space which orders choices in a way which conforms with the...

Persistent link: https://www.econbiz.de/10010820331

An algorithmic approach for simulating realistic irregular lattices

Duque, Juan C.; Betancourt, Alejandro; Marin, Freddy - UNIVERSIDAD EAFIT - 2013

regular and irregular lattices with a predefined number of polygons. While most commercial and free GIS software offer the … possibility of generating regular lattices of any size, the generation of instances of irregular lattices is not a straightforward … irregular lattices with a predefined number of polygons. The irregular lattices generated with RI-Maps have guaranteed …

Persistent link: https://www.econbiz.de/10010762844