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 | |
Publication status | Published - 1994 |
Externally published | Yes |