Some multigrid algorithms for elliptic problems on data parallel machines

Journal Article · Wed Dec 31 23:00:00 EST 1997 · SIAM Journal on Scientific Computing

DOI:https://doi.org/10.1137/S1064827596303648· OSTI ID:599808

Bandy, V A; Dendy, Jr, J E; Spangenberg, W H ^[1]

---

1. Los Alamos National Lab., NM (United States)

Previously a semicoarsening multigrid algorithm suitable for use on data parallel architectures was investigated. Through the use of new software tools, the performance of this algorithm has been considerably improved. The method has also been extended to three space dimensions. The method performs well for strongly anisotropic problems and for problems with coefficients jumping by orders of magnitude across internal interfaces. The parallel efficiency of this method is analyzed, and its actual performance on the CM-5 is compared with its performance on the CRAY Y-MP and the Sparc-5. A standard coarsening multigrid algorithm is also considered, and they compare its performance on these three platforms as well.

• Sponsoring Organization: USDOE, Washington, DC (United States)
• DOE Contract Number: W-7405-ENG-36
• OSTI ID: 599808
• Journal Information: SIAM Journal on Scientific Computing, Journal Name: SIAM Journal on Scientific Computing Journal Issue: 1 Vol. 19; ISSN 1064-8275; ISSN SJOCE3
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
COMPARATIVE EVALUATIONS
COMPUTER ARCHITECTURE
ITERATIVE METHODS
MESH GENERATION
PARALLEL PROCESSING
PARTIAL DIFFERENTIAL EQUATIONS
PERFORMANCE