In this paper, parallel algorithms suitable for the iterative solution of large sets of linear equations are developed. The algorithms based on the well known Gauss Seidel and SOR methods are presented in both synchronous and asynchronous forms. Results obtained using the M.I.M.D. computer at Loughborough University are given, for the model problem of the solution of the Laplace equation within the unit square.
No takes yet. Share an insight, caveat, or question.
Barlow et al. (1982) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: