SYSTOLIC ARCHITECTURE FOR MATRIX TRIANGULARISATION WITH PARTIAL PIVOTING.

H. Barada, A. El-Amawy

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

A systolic array for triangularisation of dense matrices, using Gaussian elimination with partial pivoting, is presented. The adopted algorithm is a slightly modified version of the traditional partial-pivoting algorithm. The modification is aimed at eliminating the need for global communications, without jeopardising the numerical stability of the algorithm. The array triangularises an n multiplied by n dense matrix in O(n**2) time without any need for costly inter-iteration I/O. The processing elements (PEs) are simple and all data communications are strictly local. It is shown that an extended array (with n extra PEs) can solve a dense system of equations in O(n**2) time. The same array can be modified to implement a scaled column-pivoting strategy.

Original languageBritish English
Pages (from-to)208-213
Number of pages6
JournalIEE Proceedings E: Computers and Digital Techniques
Volume135
Issue number4
DOIs
StatePublished - 1988

Fingerprint

Dive into the research topics of 'SYSTOLIC ARCHITECTURE FOR MATRIX TRIANGULARISATION WITH PARTIAL PIVOTING.'. Together they form a unique fingerprint.

Cite this