✦ LIBER ✦

A two-dimensional monotonical logical grid algorithm

✍ Scribed by Sieghard Weinketz

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 434 KB
Volume: 74
Category: Article
ISSN: 0010-4655
DOI: 10.1016/0010-4655(93)90092-q

No coin nor oath required. For personal study only.

✦ Synopsis

This paper describes a two-dimensional implementation of a monotonical logical grid (MLG) algorithm for a Monte Carlo study of a two-dimensional Lennard-Jones fluid, and compares its performance with a conventional link-cell algorithm with the same purpose. It is obtained that the MLG scales approximately linear with the number of particles N, instead of the conventional N 2 cost for the link-cell method.

the computer memory (i.e., to a matrix structure), so that particles that are adjacent in the physical

📜 SIMILAR VOLUMES

Comments on broadcast algorithms for two

Comments on broadcast algorithms for two-dimensional grids

✍ Martin Simmen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Slmmen, M\_, Comments on broadcast algorithms for two-dimensional grids, Parallel Computing 17 (1991) 109-112. In a recent paper, Saad and Schultz discussed several algorithms for broadcasting data in loosely coupled two-dimensional processor grids. This note disputes a claim made about the perform

Two-dimensional multiple grid algorithm

Two-dimensional multiple grid algorithm for modeling transient open channel flows

✍ Prasada Rao 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 146 KB

A poly-algorithm for parallel dense matr

A poly-algorithm for parallel dense matrix multiplication on two-dimensional process grid topologies

✍ Li, J.; Skjellum, A.; Falgout, R. D. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 872 KB

In this paper, we present several new and generalized parallel dense matrix multiplication algorithms of the form C = αAB + βC on two-dimensional process grid topologies. These algorithms can deal with rectangular matrices distributed on rectangular grids. We classify these algorithms coherently int

Sweepline algorithm for unstructured-gri

Sweepline algorithm for unstructured-grid generation on two-dimensional non-convex domains

✍ Jiunn Fang; Ijaz. H. Parpia; Stephen R. Kennon 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 883 KB

A two-grids/projection algorithm for obs

A two-grids/projection algorithm for obstacle problems

✍ A. Caboussat; R. Glowinski 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 481 KB

In order to emphasize the possible relatmn between discontinuous and continuous approximations on different meshes, a two-grids method for the resolution of parabolic variational mequality problems is presented. The numemcal methodology combines a time splitting algorithm to decouple a diffusion phe

An algorithm for 1-bend embeddings of pl

An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid

✍ Aurora Morgana; Célia Picinin de Mello; Giovanna Sontacchi 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 491 KB

In this paper we characterize the class of plane graphs that can be embedded on the twodimensional grid with at most one bend on each edge. In addition, we provide an algorithm that either detects a forbidden conÿguration or generates an embedding with at most one bend on each edge.