### Abstract

Original language | English |
---|---|

Pages (from-to) | 99-110 |

Number of pages | 12 |

Journal | Parallel Computing |

Volume | 1 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1984 |

### Fingerprint

### Cite this

*Parallel Computing*,

*1*(1), 99-110. https://doi.org/10.1016/S0167-8191(84)90446-0

}

*Parallel Computing*, vol. 1, no. 1, pp. 99-110. https://doi.org/10.1016/S0167-8191(84)90446-0

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

Research output: Contribution to journal › Article › Academic › peer-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 -