At the kernel of most scientific computations lies the solution of linear equations which, in finite element codes, is often performed by the frontal method. This method, like many algorithms for sparse matrices, is usually implemented with extensive use of indirect addressing which scarcely benefit
β¦ LIBER β¦
Exploiting vector computers for simulation
β Scribed by Peter R. Benyon
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 478 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0378-4754
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A frontal technique for vector computers
β
Luisa Brusa; Francesca Riccio
π
Article
π
1989
π
John Wiley and Sons
π
English
β 639 KB
Mathematical software libraries for vect
β
Kenneth W. Neves
π
Article
π
1982
π
Elsevier Science
π
English
β 771 KB
Some algorithms for vector or parallel c
β
Jocelyne Erhel; Alain Lichnewsky; Francois Thomasset
π
Article
π
1984
π
Elsevier Science
π
English
β 548 KB
A segmented FFT algorithm for vector com
β
Mike Ashworth; Andrew G. Lyne
π
Article
π
1988
π
Elsevier Science
π
English
β 627 KB
Vector and parallel algorithms for the m
β
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
Tridiagonalization of band symmetric mat
β
T.Z. Kalamboukis
π
Article
π
1990
π
Elsevier Science
π
English
β 245 KB