We study the potential performance of multigrid algorithms running on massively parallel computers with the intent of discovering whether currently envisioned machines will provide an efficient platform for such algorithms. These algorithms substantially improve the performance of iterative methods
β¦ LIBER β¦
Structural analysis on massively parallel computers
β Scribed by C.T. Vaughan
- Publisher
- Elsevier Science
- Year
- 1991
- Weight
- 625 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0956-0521
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Analysis of Multigrid Algorithms on Mass
β
Lesley R. Matheson; Robert E. Tarjan
π
Article
π
1996
π
Elsevier Science
π
English
β 234 KB
Multidimensional dynamic programming on
β
E. Angel; P. Leong
π
Article
π
1994
π
Elsevier Science
π
English
β 660 KB
CarβParrinello Molecular Dynamics on Mas
β
JΓΌrg Hutter; Alessandro Curioni
π
Article
π
2005
π
John Wiley and Sons
π
English
β 79 KB
Static allocation in massively parallel
β
Guillermo Maturana
π
Article
π
1987
π
Elsevier Science
π
English
β 346 KB
Visibility analysis on a massively data-
β
Germain, Daniel; Laurendeau, Denis; VΓ©zina, Guy
π
Article
π
1996
π
John Wiley and Sons
π
English
β 737 KB
Visibility analysis algorithms use digital elevation models OEMs), which represent terrain topography, to determine visibility at each point on the terrain from a given location in space. This analysis can be computationally very demanding, particularly when manipulating high resolution DEMs accurat
Massive parallel computing
β
Peter Sloot; Andrew Grant
π
Article
π
1995
π
Elsevier Science
π
English
β 160 KB