Parallel pivoting algorithms for sparse symmetric matrices

F.J. Peters

Research output: Contribution to journalArticleAcademicpeer-review

24 Citations (Scopus)

Abstract

In this paper it is investigated which pivots may be processed simultaneously when solving a set of linear equations. It is shown that for dense sets of equations all the pivots must necessarily be processed one at a time; only if the set is sufficiently sparse, some pivots may be processed simultaneously. We present parallel pivoting algorithms for MIMD computers with sufficiently many processors and a common memory. Moreover we present algorithms for MIMD computers with an arbitrary, but fixed number of processors. For both types of computers algorithms embodying an ordering strategy are given.
Original languageEnglish
Pages (from-to)99-110
Number of pages12
JournalParallel Computing
Volume1
Issue number1
DOIs
Publication statusPublished - 1984

Fingerprint

Pivoting
Pivot
Sparse matrix
Symmetric matrix
Parallel algorithms
Linear equations
Data storage equipment
Linear equation
Arbitrary

Cite this

Peters, F.J. / Parallel pivoting algorithms for sparse symmetric matrices. In: Parallel Computing. 1984 ; Vol. 1, No. 1. pp. 99-110.
@article{ed42513ae5c54e58b70cde34d6c18274,
title = "Parallel pivoting algorithms for sparse symmetric matrices",
abstract = "In this paper it is investigated which pivots may be processed simultaneously when solving a set of linear equations. It is shown that for dense sets of equations all the pivots must necessarily be processed one at a time; only if the set is sufficiently sparse, some pivots may be processed simultaneously. We present parallel pivoting algorithms for MIMD computers with sufficiently many processors and a common memory. Moreover we present algorithms for MIMD computers with an arbitrary, but fixed number of processors. For both types of computers algorithms embodying an ordering strategy are given.",
author = "F.J. Peters",
year = "1984",
doi = "10.1016/S0167-8191(84)90446-0",
language = "English",
volume = "1",
pages = "99--110",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "1",

}

Parallel pivoting algorithms for sparse symmetric matrices. / Peters, F.J.

In: Parallel Computing, Vol. 1, No. 1, 1984, p. 99-110.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Parallel pivoting algorithms for sparse symmetric matrices

AU - Peters, F.J.

PY - 1984

Y1 - 1984

N2 - In this paper it is investigated which pivots may be processed simultaneously when solving a set of linear equations. It is shown that for dense sets of equations all the pivots must necessarily be processed one at a time; only if the set is sufficiently sparse, some pivots may be processed simultaneously. We present parallel pivoting algorithms for MIMD computers with sufficiently many processors and a common memory. Moreover we present algorithms for MIMD computers with an arbitrary, but fixed number of processors. For both types of computers algorithms embodying an ordering strategy are given.

AB - In this paper it is investigated which pivots may be processed simultaneously when solving a set of linear equations. It is shown that for dense sets of equations all the pivots must necessarily be processed one at a time; only if the set is sufficiently sparse, some pivots may be processed simultaneously. We present parallel pivoting algorithms for MIMD computers with sufficiently many processors and a common memory. Moreover we present algorithms for MIMD computers with an arbitrary, but fixed number of processors. For both types of computers algorithms embodying an ordering strategy are given.

U2 - 10.1016/S0167-8191(84)90446-0

DO - 10.1016/S0167-8191(84)90446-0

M3 - Article

VL - 1

SP - 99

EP - 110

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 1

ER -