By Topic

Systolic architecture for matrix triangularisation with partial pivoting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Barada, H. ; Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA ; El-Amawy, A.

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*n dense matrix in O(n2) time without any need for costly inter-iteration I/O. The processing elements (PEs) are very 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(n2) time. It is also shown that the same array can be modified to implement a scaled column-pivoting strategy.

Published in:

Computers and Digital Techniques, IEE Proceedings E  (Volume:135 ,  Issue: 4 )