Solving dense linear systems by Gauss- Huard's method on a distributed memory system

W. Hoffman; K. Potma; G.G. Pronk

doi:10.1016/0167-739X(94)90037-X

Solving dense linear systems by Gauss- Huard's method on a distributed memory system

W. Hoffman, K. Potma, G.G. Pronk

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

10 Citations (Scopus)

Abstract

A variant of Gaussian elimination that is known as Gauss-Huard's algorithm behaves like Gauss-Jordan's algorithm in the fact that it also reduces the matrix to diagonal form and it behaves like LU factorisation in the fact that it uses the same number of floating-point operations and has practically the same numerical stability. This contribution presents a block-variant of Gauss-Huard's algorithm with favourable data locality.

Original language	English
Pages (from-to)	321-325
Number of pages	5
Journal	Future Generation Computer Systems
Volume	10
Issue number	2/3
DOIs	https://doi.org/10.1016/0167-739X(94)90037-X
Publication status	Published - 1994
Externally published	Yes

Access to Document

10.1016/0167-739X(94)90037-X

Cite this

@article{b573cb4e295d4443a822a0b9a3c100ca,

title = "Solving dense linear systems by Gauss- Huard's method on a distributed memory system",

abstract = "A variant of Gaussian elimination that is known as Gauss-Huard's algorithm behaves like Gauss-Jordan's algorithm in the fact that it also reduces the matrix to diagonal form and it behaves like LU factorisation in the fact that it uses the same number of floating-point operations and has practically the same numerical stability. This contribution presents a block-variant of Gauss-Huard's algorithm with favourable data locality.",

author = "W. Hoffman and K. Potma and G.G. Pronk",

year = "1994",

doi = "10.1016/0167-739X(94)90037-X",

language = "English",

volume = "10",

pages = "321--325",

journal = "Future Generation Computer Systems",

issn = "0167-739X",

publisher = "Elsevier",

number = "2/3",

}

TY - JOUR

T1 - Solving dense linear systems by Gauss- Huard's method on a distributed memory system

AU - Hoffman, W.

AU - Potma, K.

AU - Pronk, G.G.

PY - 1994

Y1 - 1994

N2 - A variant of Gaussian elimination that is known as Gauss-Huard's algorithm behaves like Gauss-Jordan's algorithm in the fact that it also reduces the matrix to diagonal form and it behaves like LU factorisation in the fact that it uses the same number of floating-point operations and has practically the same numerical stability. This contribution presents a block-variant of Gauss-Huard's algorithm with favourable data locality.

AB - A variant of Gaussian elimination that is known as Gauss-Huard's algorithm behaves like Gauss-Jordan's algorithm in the fact that it also reduces the matrix to diagonal form and it behaves like LU factorisation in the fact that it uses the same number of floating-point operations and has practically the same numerical stability. This contribution presents a block-variant of Gauss-Huard's algorithm with favourable data locality.

U2 - 10.1016/0167-739X(94)90037-X

DO - 10.1016/0167-739X(94)90037-X

M3 - Article

VL - 10

SP - 321

EP - 325

JO - Future Generation Computer Systems

JF - Future Generation Computer Systems

SN - 0167-739X

IS - 2/3

ER -

Solving dense linear systems by Gauss- Huard's method on a distributed memory system

Abstract

Access to Document

Fingerprint

Cite this