๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Comparison of link-cell and neighbourhood tables on a range of computers

โœ Scribed by Juan J. Morales; Maria J. Nuevo

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
469 KB
Volume
69
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

โœฆ Synopsis

The recent improvement to the link-cell method (Comput. Phys. Commun. 60 (1990) 195), making it faster on a scalar computer than the traditional neighbour table (NT) method, was tested on different vectorial computers. The efficiency of both methods depends greatly on the particular processor architecture. In contrast to scalar computer results, the NT method was found to be better on the vectorial computers.

๐Ÿ“œ SIMILAR VOLUMES

A quick and efficient method of correct
A quick and efficient method of correct typesetting of tables on computers
โœ Mahipal S. Ghemawat ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 190 KB

Alignment of numerical data in a table body may be achieved by first typing it single-spaced and without horizontal lines and with only the last lines of the stub-headings. Once the numerical data have been aligned under each column, stub-headings may be completed, horizontal lines inserted and the

Consideration of data load time on moder
Consideration of data load time on modern processors for the Verlet table and linked-cell algorithms
โœ Eduard S. Fomin ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 508 KB

Neighbor search algorithms are widely used in molecular dynamics for the direct computation of short-range pairwise interatomic potentials. These algorithms are based on the Verlet table (VT) and linked-cell (LC) methods. It is widely believed that the VT is more efficient than the LC. The analysis

Performance comparison of a set of perio
Performance comparison of a set of periodic and non-periodic tridiagonal solvers on SP2 and Paragon parallel computers
โœ Sun, Xian-he; Moitra, Stuti ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 261 KB

Various tridiagonal solvers have been proposed in recent years for different parallel platforms. In this paper, the performance of three tridiagonal solvers, namely, the parallel partition LU algorithm, the parallel diagonal dominant algorithm, and the reduced diagonal dominant algorithm, is studied