论文信息 - A short note on standard parallel multigrid algorithms for 3D-problems

A short note on standard parallel multigrid algorithms for 3D-problems

We present some results concerning parallel multigrid (MG) algorithms for 3D problems. For certain-practically important-anisotropic cases, plane relaxation is needed for smoothing if standard MG (coarsening etc.) is used. Parallel versions of these sophisticated MG algorithms are described, and their time complexity and multiprocessor efficiency is studied.

Ulrich Trottenberg | Clemens-August Thole | U. Trottenberg | C. Thole

[1] H. Mierendorff,et al. Efficient multigrid algorithms for locally constrained parallel systems , 1986 .

[2] Ulrich Trottenberg,et al. Basic smoothing procedures for the multigrid treatment of elliptic 3D operators , 1986 .

[3] K. Stüben,et al. Multigrid methods: Fundamental algorithms, model problem analysis and applications , 1982 .

[4] Oliver A. McBryan,et al. The multigrid method on parallel processors , 1986 .

[5] H. Mierendorff,et al. Bus coupled systems for multigrid algorithms , 1986 .

[6] Achi Brandt,et al. Vectorized multigrid poisson solver for the CDC cyber 205 , 1983 .

[7] B. L. Buzbee,et al. Proceedings of the 1978 LASL Workshop on Vector and Parallel Processors , 1978 .

[8] J. Schröder,et al. Reduktionsverfahren für Differenzengleichungen bei Randwertaufgaben I , 1974 .

[9] Karl Solchenbach,et al. Parallel Multigrid Methods: Implementation on SUPRENUM-like Architectures and Applications , 1987, ICS.

[10] Yousef Saad,et al. Multigrid Algorithms on the Hypercube Multiprocessor , 1986, IEEE Transactions on Computers.

[11] W. Holter,et al. A vectorized multigrid solver for the three-dimensional Poisson equation , 1986 .

[12] Achi Brandt,et al. Multigrid solvers on parallel computers , 1981 .

[13] Anne Greenbaum. A multigrid method for multiprocessors , 1986 .