Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems
IEEE Transactions on Computers
A new class of parallel algorithms for solving systems of linear equations
SIAM Journal on Scientific and Statistical Computing
A Systolic Architecture for Fast Dense Matrix Inversion
IEEE Transactions on Computers
Improved matrix triangularisation using a double pipeline systolic array
Information Processing Letters
| Hi-index | 14.98 |
A systolic array for the fast computation of the Faddeev algorithm is presented. Inversion of an n*n matrix on a systolic array is known to tend to 5 n inner product steps under the assumption that no data are duplicated. The proposed Faddeev array achieves matrix inversion in just 4 n steps with O(n/sup 2/) basic cells using careful duplications of some data. The array consists of two half-arrays which compute two separate but coupled triangularizations. The coupling is resolved by an on-the-fly decoupling process which duplicates pivot row data and passes them between the arrays using only nearest neighbor connections.