WestminsterResearch will not be accepting deposits until 9th March 2015. This is to allow for a system upgrade and server migration.

A fast Faddeev array

Megson, Graham M. (1992) A fast Faddeev array. IEEE Transactions on Computers, 41 (12). pp. 1594-1600. ISSN 0018-9340

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1109/12.214668


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 (n2) 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.

Item Type:Article
Uncontrolled Keywords:Computational complexity, matrix algebra, parallel algorithms, systolic arrays, Faddeev algorithm, data duplications, fast Faddeev array, half-arrays, inner product steps, matrix inversion, nearest neighbor connections, on-the-fly decoupling, pivot row data, systolic array, triangularizations
Research Community:University of Westminster > Electronics and Computer Science, School of
ID Code:5691
Deposited On:27 Jan 2009 09:55
Last Modified:19 Oct 2009 16:24

Repository Staff Only: item control page