𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast algorithm for computer simulations in INEPT experiments

✍ Scribed by Jean-Claude Lartigue; Michel Pétraud; Mouna Harket; Bernard De Jeso; Max Ratier


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
550 KB
Volume
20
Category
Article
ISSN
0097-8485

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


A Fast Algorithm for Particle Simulation
✍ L. Greengard; V. Rokhlin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 407 KB

We restrict our attention in this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potenti

Introduction to “A Fast Algorithm for Pa
✍ John A. Board Jr. 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 113 KB

tions of all of these methods are certainly possible, ## Department of Electrical and Computer Engineering Greengard and Bill Gropp pointed out early on the suitabil-Duke University ity of the FMA for parallel processing [3].

A validated fast algorithm for simulatio
✍ D. Dalponte; P. Rinaldi; G. Cazenave; E. Usunoff; L. Vives; M. Varni; M. Vénere; 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 727 KB

## Abstract Hydrological modelling in large plains is not a straightforward task owing to the crucial influence of several elements, namely, accumulation of water on local depressions, absence of an integrated drainage network, generalized meagre surface slopes, strong sensitivity of the soil water

A fast impingement detection algorithm f
✍ Qingmao Hu; Ulrich Langlotz; Jeff Lawrence; Frank Langlotz; Lutz-Peter Nolte 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB

## Objective: For simulation of computer-aided orthopedic interventions, the detection of impingement between parts of the patient's anatomy and/or implants is often of key importance. the impingement (collision) detection methods used in the existing literature seem to be unsuitable for two reason

A fast pairlist-construction algorithm f
✍ Tim N. Heinz; Philippe H. Hünenberger 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 222 KB

## Abstract A new grid‐cell algorithm is presented that permits the fast construction of cutoff‐based nonbonded pairlists in molecular simulations under periodic boundary conditions based on an arbitrary box shape. The key features of the method are (1) the use of a one‐dimensional mask array (to d