论文信息 - Constructive interference in parallel algorithms

Constructive interference in parallel algorithms

Parallel algorithms are developed in the setting of iterative multilevel methods. The constituent parts of the algorithms are dependent rather than independent as in conventional parallel algorithms. We develop cases and conditions wherein this dependence generates a constructive interference in the computation. The resulting parallel algorithms can then be more efficient than serial counterparts.

W. Miranker | C. Douglas

[1] P. Swarztrauber. A direct Method for the Discrete Solution of Separable Elliptic Equations , 1974 .

[2] Marching Algorithms and Block Gaussian Elimination , 1976 .

[3] R. Nicolaides. On the ² convergence of an algorithm for solving finite element equations , 1977 .

[4] V. Pan,et al. Methods of aggregation , 1980 .

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

[6] W. Miranker,et al. Acceleration by aggregation of successive approximation methods , 1982 .

[7] Wolfgang Hackbusch,et al. Multi-grid convergence theory , 1982 .

[8] Craig Carl Douglas,et al. Multi-grid algorithms for elliptic boundary-value problems , 1982 .

[9] P. Wesseling. Theoretical and Practical Aspects of a Multigrid Method , 1982 .

[10] François Musy,et al. Multigrid Methods: Convergence Theory in a Variational Framework , 1984 .

[11] C. Douglas. Multi-Grid Algorithms with Applications to Elliptic Boundary Value Problems , 1984 .

[12] R. Bank,et al. Sharp Estimates for Multigrid Rates of Convergence with General Smoothing and Acceleration , 1985 .