Answers are grounded in this paper and cite their sources.
An array that inverts an n*n dense matrix in 5n-1 time units, including I/O time, is presented. The inversion algorithm consists of three phases and assumes that Gaussian elimination without pivoting can be applied. The array, which consists of 2n/sup 2/-n simple processing elements, implements and overlaps the execution of all three phases without any need for intermediate I/O or reconfiguration. An efficient data-steering technique which is well suited for feedback recurrences is utilized.>
No takes yet. Share an insight, caveat, or question.
A. El-Amawy (1989) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: