Parallel S.O.R. iterative methods

Authors:
D. J. Evans
Affiliations:
-
Venue:
Parallel Computing
Year:
1984

Citing 2
Cited 6

Asynchronous Iterative Methods for Multiprocessors

Journal of the ACM (JACM)
Parallel Processing Systems

Parallel Processing Systems

Speed-up of scalable iterative linear solvers implemented on an array of transputers

Parallel Computing
Implementation of the Parallel Four Points Modified Explicit Group Iterative Algorithm on Shared Memory Parallel Computer

PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
OpenMP Implementation of Parallel Linear Solver for Reservoir Simulation

IWOMP '07 Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era
Dynamic load balancing for a grid application

HiPC'04 Proceedings of the 11th international conference on High Performance Computing
The performance model of an enhanced parallel algorithm for the SOR method

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
The performance model for a parallel SOR algorithm using the red-black scheme

International Journal of High Performance Systems Architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

New explicit group S.O.R. methods suitable for use on an asynchronous MIMD computer are presented for the numerical solution of the sparse linear systems derived from the discretization of two-dimensional, second-order, elliptic boundary value problems. A comparison with existing implicit line S.O.R. schemes for the Dirichlet model problem shows the new schemes to be superior (Barlow and Evans, 1982).