Rank annihilation on a ring of processors


A wavefront algorith,n for computing the Sherman-Morrison Rank-1 update to an n x n matrix inverse on a ring of processors is discussed. A ring of n ~ z > 0 processing elements computes a single update in O(n(3k +2)) inner produc~ equivalent steps where k = ( a / z ) is the partition size of data for each processor. This is in contrast to the O(n 2… (More)
DOI: 10.1016/0167-8191(90)90121-O


2 Figures and Tables