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 O(n/2) and O(4n/5), respectively.
This work was supported by the Serbian Sciense Council.
Preview
Unable to display preview. Download preview PDF.
References
L.G. Aleksandrov and H.N. Djidjev, Solving systems of linear equations on a systolic processor, Technical Report, Center of Informatics And Computer Technology, BAN-Sofia, 1–8 (1989).
A. El-Amawy, A Systolic Architecture for Fast Dense Matrix Inversion, I.E.E.E. Transactions on Computers 38, 449–455 (1989).
A. El-Amawy and K.R. Dharmarajan, Parallel VLSI algorithm for stable inversion of dense matrices, IEE Proc.,Pt E. 136, 575–580 (1989).
L. Geus, W. Henning, M. Vajteri and J. Volkert, Matrix inversion algorithms for a pyramidal multiprocessor system, Computers and Artificial Intelligence 7, 65–79 (1988).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milovanović, E.I., Milovanović, I.Ž., Stojčev, M.K. (1992). Matrix inversion algorithm for linear array processor. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_432
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_432
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive