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 journalArticleAcademicpeer-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 languageEnglish
Pages (from-to)321-325
Number of pages5
JournalFuture Generation Computer Systems
Volume10
Issue number2/3
DOIs
Publication statusPublished - 1994
Externally publishedYes

Fingerprint

Dive into the research topics of 'Solving dense linear systems by Gauss- Huard's method on a distributed memory system'. Together they form a unique fingerprint.

Cite this