Stability of a pivoting strategy for parallel Gaussian elimination

J. L. Mead; Rosemary Renaut; Bruno Welfert

doi:10.1023/A:1021931632067

Stability of a pivoting strategy for parallel Gaussian elimination

J. L. Mead, Rosemary Renaut, Bruno Welfert

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

Gaussian elimination with partial pivoting achieved by adding the pivot row to the kth row at step k, was introduced by Onaga and Takechi in 1986 as a means for reducing communications in parallel implementations. In this paper it is shown that the growth factor of this partial pivoting algorithm is bounded above by μ_n < 3^n-1, as compared to 2^n-1 for the standard partial pivoting. This bound μ_n, close to 3^n-2, is attainable for a class of near-singular matrices. Moreover, for the same matrices the growth factor is small under partial pivoting.

Original language	English (US)
Pages (from-to)	633-639
Number of pages	7
Journal	BIT Numerical Mathematics
Volume	41
Issue number	3
DOIs	https://doi.org/10.1023/A:1021931632067
State	Published - Sep 2001

Keywords

Gaussian elimination
Growth factor
Parallel algorithm
Stability

ASJC Scopus subject areas

Software
Computer Networks and Communications
Computational Mathematics
Applied Mathematics

Access to Document

10.1023/A:1021931632067

Cite this

@article{b2b31b5210a742daa880fafe8a753d35,

title = "Stability of a pivoting strategy for parallel Gaussian elimination",

abstract = "Gaussian elimination with partial pivoting achieved by adding the pivot row to the kth row at step k, was introduced by Onaga and Takechi in 1986 as a means for reducing communications in parallel implementations. In this paper it is shown that the growth factor of this partial pivoting algorithm is bounded above by μn < 3n-1, as compared to 2n-1 for the standard partial pivoting. This bound μn, close to 3n-2, is attainable for a class of near-singular matrices. Moreover, for the same matrices the growth factor is small under partial pivoting.",

keywords = "Gaussian elimination, Growth factor, Parallel algorithm, Stability",

author = "Mead, {J. L.} and Rosemary Renaut and Bruno Welfert",

year = "2001",

month = sep,

doi = "10.1023/A:1021931632067",

language = "English (US)",

volume = "41",

pages = "633--639",

journal = "BIT Numerical Mathematics",

issn = "0006-3835",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Stability of a pivoting strategy for parallel Gaussian elimination

AU - Mead, J. L.

AU - Renaut, Rosemary

AU - Welfert, Bruno

PY - 2001/9

Y1 - 2001/9

N2 - Gaussian elimination with partial pivoting achieved by adding the pivot row to the kth row at step k, was introduced by Onaga and Takechi in 1986 as a means for reducing communications in parallel implementations. In this paper it is shown that the growth factor of this partial pivoting algorithm is bounded above by μn < 3n-1, as compared to 2n-1 for the standard partial pivoting. This bound μn, close to 3n-2, is attainable for a class of near-singular matrices. Moreover, for the same matrices the growth factor is small under partial pivoting.

AB - Gaussian elimination with partial pivoting achieved by adding the pivot row to the kth row at step k, was introduced by Onaga and Takechi in 1986 as a means for reducing communications in parallel implementations. In this paper it is shown that the growth factor of this partial pivoting algorithm is bounded above by μn < 3n-1, as compared to 2n-1 for the standard partial pivoting. This bound μn, close to 3n-2, is attainable for a class of near-singular matrices. Moreover, for the same matrices the growth factor is small under partial pivoting.

KW - Gaussian elimination

KW - Growth factor

KW - Parallel algorithm

KW - Stability

UR - http://www.scopus.com/inward/record.url?scp=0012087577&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0012087577&partnerID=8YFLogxK

U2 - 10.1023/A:1021931632067

DO - 10.1023/A:1021931632067

M3 - Article

AN - SCOPUS:0012087577

SN - 0006-3835

VL - 41

SP - 633

EP - 639

JO - BIT Numerical Mathematics

JF - BIT Numerical Mathematics

IS - 3

ER -

Stability of a pivoting strategy for parallel Gaussian elimination

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this