where z denotes the microscopic configuration and ρeq(z)dz is the equilibrium measure for the microscopic dynamics. In some cases the actual Hamiltonian (total energy) may be expressible in terms of the coarse-grained variables and is strictly conserved, but this is not always the case since some of the energy may in fact be incorporated in the coarse-grained free energy as an “entropy”. The eq...

A proper coarse variable set for Algebraic Multigrid (AMG) solvers can be constructed using Compatible Relaxation (CR). For a given coarse set, CR is a modified relaxation scheme that keeps the values of the coarse variables intact. Its convergence factor is a predictor of the potential AMG efficiency, similarly to the smoothing factor in geometric multigrid. A practical CR-based coarse set con...

We present an environment for connguring and coordinating coarse grained parallel applications on workstation clusters. The environment named CoPA is based on PVM and allows an automatic distribution of functional modules as they occur in typical CAE-applications. By implementing link-based communication on top of PVM, CoPA is able to perform a \post-game" analysis of the communication load bet...

This paper examines the challenges of mapping applications on to a Coarsegrained reconfigurable architecture (CGRA). Through crowd sourcing through a simple game and using the movement data from successful players the research project plans to produce better mappings, or improve existing algorithms through common patterns by the most successful players. This paper also examines the case studies...

Algebraic multigrid (AMG) is a powerful linear solver with attractive parallel properties. A parallel AMG method depends on efficient, parallel implementations of the coarse-grid selection algorithms and the restriction and prolongation operator construction algorithms. In the effort to effectively and quickly select the coarse grid, a number of parallel coarsening algorithms have been develope...

Brute-force molecular dynamics simulations are limited by the exuberant number of degrees of freedom and the relatively small time-steps. As a result, only relatively small assemblies of molecules over small time spans are accessible with current and foreseeable computational capabilities. In order to overcome this limitation, coarse-grained models have been proposed which employ a much smaller...

This paper analyzes the problem of matching two heterogeneous populations, e.g., men and women. If the payo¤ from a match exhibits complementarities, it is well known that absent any friction positive assortative matching is optimal (PAM). Coarse matching refers to a situation in which the populations into a …nite number of classes, then randomly matched within these classes. In a seminal paper...

We study decision makers who willingly forgo acts that finely vary with states, even though these acts are informationally and technologically feasible. They opt instead for coarse rules that are less sensitive to state by state variations. We model this coarse decision making as a consequence of individuals using classical, frequentist methods to draw robust inferences from scarce data. Our ce...