𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The computational complexity of the quadrant interlocking (QI) iterative methods on shared memory parallel computers

✍ Scribed by Evans, D.J.; Abdullah, R.

Book ID
119958439
Publisher
Taylor and Francis Group
Year
1998
Tongue
English
Weight
633 KB
Volume
67
Category
Article
ISSN
0020-7160

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallelization of the ILU(0) preconditi
Parallelization of the ILU(0) preconditioner for CFD problems on shared-memory computers
✍ Laura C. Dutto; Wagdi G. Habashi πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 3 views

The use of ILU(0) factorization as a preconditioner is quite frequent when solving linear systems of CFD computations. This is because of its efficiency and moderate memory requirements. For a small number of processors, this preconditioner, parallelized through coloring methods, shows little saving

Vector and parallel algorithms for the m
Vector and parallel algorithms for the molecular dynamics simulation of macromolecules on shared-memory computers
✍ John E. Mertz; Douglas J. Tobias; Charles L. Brooks III; U. C. Singh πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 797 KB

## Abstract A detailed description of vector/parallel algorithms for the molecular dynamics (MD) simulation of macromolecular systems on multiple processor, shared‐memory computers is presented. The algorithms encompass three computationally intensive portions of typical MD programs: (__1__) the ev