Abstract
The paper presents parallel algorithm for computing the inversion of a dense matrix based on Gauss-Jordan elimination. The algorithm is proposed for the implementation on the linear array at a processor level which operate in a pipeline fashion. Two types of architectures are considered. One which uses serial data transfer (AP/S) and another which uses parallel data transfer (AP/P) between neighboring processors. The speed up of AP/S and AP/P are 0(n/2) and 0(4ra/5), respectively.
Cite
CITATION STYLE
Milovanović, E. I., Milovanović, I., & Stojčev, M. K. (1992). Matrix inversion algorithm for linear array processor. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 634 LNCS, pp. 367–372). Springer Verlag. https://doi.org/10.1007/3-540-55895-0_432
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
